/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 12:20:07,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 12:20:07,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 12:20:07,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 12:20:07,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 12:20:07,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 12:20:07,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 12:20:07,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 12:20:07,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 12:20:07,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 12:20:07,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 12:20:07,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 12:20:07,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 12:20:07,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 12:20:07,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 12:20:07,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 12:20:07,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 12:20:07,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 12:20:07,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 12:20:07,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 12:20:07,228 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 12:20:07,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 12:20:07,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 12:20:07,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 12:20:07,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 12:20:07,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 12:20:07,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 12:20:07,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 12:20:07,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 12:20:07,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 12:20:07,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 12:20:07,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 12:20:07,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 12:20:07,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 12:20:07,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 12:20:07,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 12:20:07,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 12:20:07,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 12:20:07,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 12:20:07,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 12:20:07,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 12:20:07,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 12:20:07,244 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 12:20:07,253 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 12:20:07,253 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 12:20:07,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 12:20:07,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 12:20:07,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 12:20:07,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 12:20:07,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 12:20:07,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 12:20:07,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 12:20:07,256 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 12:20:07,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 12:20:07,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 12:20:07,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 12:20:07,256 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 12:20:07,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 12:20:07,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:20:07,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 12:20:07,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 12:20:07,256 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 12:20:07,257 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 12:20:07,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 12:20:07,257 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 12:20:07,257 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 12:20:07,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 12:20:07,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 12:20:07,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 12:20:07,484 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 12:20:07,485 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 12:20:07,486 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound10.c [2022-04-28 12:20:07,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5a5a5f8/ec1d7997134c46de8f086e4836dbf1ca/FLAG5a932f02b [2022-04-28 12:20:07,901 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 12:20:07,901 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound10.c [2022-04-28 12:20:07,907 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5a5a5f8/ec1d7997134c46de8f086e4836dbf1ca/FLAG5a932f02b [2022-04-28 12:20:08,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5a5a5f8/ec1d7997134c46de8f086e4836dbf1ca [2022-04-28 12:20:08,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 12:20:08,330 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 12:20:08,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 12:20:08,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 12:20:08,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 12:20:08,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:20:08" (1/1) ... [2022-04-28 12:20:08,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e337781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:08, skipping insertion in model container [2022-04-28 12:20:08,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:20:08" (1/1) ... [2022-04-28 12:20:08,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 12:20:08,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 12:20:08,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound10.c[490,503] [2022-04-28 12:20:08,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:20:08,544 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 12:20:08,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound10.c[490,503] [2022-04-28 12:20:08,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:20:08,585 INFO L208 MainTranslator]: Completed translation [2022-04-28 12:20:08,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:08 WrapperNode [2022-04-28 12:20:08,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 12:20:08,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 12:20:08,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 12:20:08,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 12:20:08,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:08" (1/1) ... [2022-04-28 12:20:08,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:08" (1/1) ... [2022-04-28 12:20:08,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:08" (1/1) ... [2022-04-28 12:20:08,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:08" (1/1) ... [2022-04-28 12:20:08,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:08" (1/1) ... [2022-04-28 12:20:08,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:08" (1/1) ... [2022-04-28 12:20:08,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:08" (1/1) ... [2022-04-28 12:20:08,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 12:20:08,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 12:20:08,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 12:20:08,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 12:20:08,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:08" (1/1) ... [2022-04-28 12:20:08,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:20:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:20:08,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 12:20:08,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 12:20:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 12:20:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 12:20:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 12:20:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 12:20:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 12:20:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 12:20:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 12:20:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 12:20:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 12:20:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 12:20:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 12:20:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 12:20:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 12:20:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 12:20:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 12:20:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 12:20:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 12:20:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 12:20:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 12:20:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 12:20:08,756 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 12:20:08,757 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 12:20:08,910 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 12:20:08,924 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 12:20:08,924 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 12:20:08,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:20:08 BoogieIcfgContainer [2022-04-28 12:20:08,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 12:20:08,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 12:20:08,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 12:20:08,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 12:20:08,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:20:08" (1/3) ... [2022-04-28 12:20:08,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f43c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:20:08, skipping insertion in model container [2022-04-28 12:20:08,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:20:08" (2/3) ... [2022-04-28 12:20:08,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f43c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:20:08, skipping insertion in model container [2022-04-28 12:20:08,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:20:08" (3/3) ... [2022-04-28 12:20:08,939 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_valuebound10.c [2022-04-28 12:20:08,948 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 12:20:08,948 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 12:20:08,982 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 12:20:09,004 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@17d76fc4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@697213d0 [2022-04-28 12:20:09,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 12:20:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 20 states have (on average 1.45) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 12:20:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 12:20:09,016 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:20:09,017 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:20:09,017 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:20:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:20:09,021 INFO L85 PathProgramCache]: Analyzing trace with hash -587582002, now seen corresponding path program 1 times [2022-04-28 12:20:09,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:20:09,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1344115868] [2022-04-28 12:20:09,041 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:20:09,041 INFO L85 PathProgramCache]: Analyzing trace with hash -587582002, now seen corresponding path program 2 times [2022-04-28 12:20:09,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:20:09,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673983649] [2022-04-28 12:20:09,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:20:09,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:20:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:20:09,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 12:20:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:20:09,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {72#(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(11, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-04-28 12:20:09,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 12:20:09,220 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #103#return; {43#true} is VALID [2022-04-28 12:20:09,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 12:20:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:20:09,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:20:09,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:20:09,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:20:09,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #79#return; {44#false} is VALID [2022-04-28 12:20:09,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 12:20:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:20:09,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:20:09,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:20:09,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:20:09,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #81#return; {44#false} is VALID [2022-04-28 12:20:09,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 12:20:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:20:09,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:20:09,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:20:09,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:20:09,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #83#return; {44#false} is VALID [2022-04-28 12:20:09,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-28 12:20:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:20:09,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:20:09,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:20:09,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:20:09,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #85#return; {44#false} is VALID [2022-04-28 12:20:09,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-28 12:20:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:20:09,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:20:09,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:20:09,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:20:09,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #87#return; {44#false} is VALID [2022-04-28 12:20:09,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 12:20:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:20:09,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:20:09,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:20:09,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:20:09,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #89#return; {44#false} is VALID [2022-04-28 12:20:09,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {72#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 12:20:09,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {72#(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(11, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-04-28 12:20:09,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 12:20:09,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #103#return; {43#true} is VALID [2022-04-28 12:20:09,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret6 := main(); {43#true} is VALID [2022-04-28 12:20:09,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {43#true} is VALID [2022-04-28 12:20:09,291 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {43#true} is VALID [2022-04-28 12:20:09,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:20:09,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:20:09,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:20:09,292 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #79#return; {44#false} is VALID [2022-04-28 12:20:09,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {44#false} is VALID [2022-04-28 12:20:09,293 INFO L272 TraceCheckUtils]: 12: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {43#true} is VALID [2022-04-28 12:20:09,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:20:09,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:20:09,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:20:09,295 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {44#false} {44#false} #81#return; {44#false} is VALID [2022-04-28 12:20:09,296 INFO L272 TraceCheckUtils]: 17: Hoare triple {44#false} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-28 12:20:09,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:20:09,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:20:09,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:20:09,300 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {44#false} {44#false} #83#return; {44#false} is VALID [2022-04-28 12:20:09,300 INFO L272 TraceCheckUtils]: 22: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-28 12:20:09,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:20:09,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:20:09,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:20:09,301 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {44#false} {44#false} #85#return; {44#false} is VALID [2022-04-28 12:20:09,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {44#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {44#false} is VALID [2022-04-28 12:20:09,304 INFO L272 TraceCheckUtils]: 28: Hoare triple {44#false} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {43#true} is VALID [2022-04-28 12:20:09,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:20:09,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:20:09,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:20:09,305 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {44#false} {44#false} #87#return; {44#false} is VALID [2022-04-28 12:20:09,306 INFO L272 TraceCheckUtils]: 33: Hoare triple {44#false} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {43#true} is VALID [2022-04-28 12:20:09,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:20:09,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:20:09,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:20:09,307 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {44#false} {44#false} #89#return; {44#false} is VALID [2022-04-28 12:20:09,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {44#false} assume !true; {44#false} is VALID [2022-04-28 12:20:09,307 INFO L272 TraceCheckUtils]: 39: Hoare triple {44#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {44#false} is VALID [2022-04-28 12:20:09,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-28 12:20:09,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-28 12:20:09,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-28 12:20:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 12:20:09,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:20:09,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673983649] [2022-04-28 12:20:09,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673983649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:20:09,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:20:09,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:20:09,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:20:09,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1344115868] [2022-04-28 12:20:09,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1344115868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:20:09,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:20:09,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:20:09,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089030148] [2022-04-28 12:20:09,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:20:09,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-28 12:20:09,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:20:09,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:20:09,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:09,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 12:20:09,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:20:09,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 12:20:09,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 12:20:09,377 INFO L87 Difference]: Start difference. First operand has 40 states, 20 states have (on average 1.45) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:20:09,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:09,539 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-04-28 12:20:09,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 12:20:09,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-28 12:20:09,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:20:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:20:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-04-28 12:20:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:20:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-04-28 12:20:09,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2022-04-28 12:20:09,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:09,710 INFO L225 Difference]: With dead ends: 73 [2022-04-28 12:20:09,711 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 12:20:09,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 12:20:09,719 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:20:09,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 42 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:20:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 12:20:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 12:20:09,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:20:09,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 12:20:09,758 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 12:20:09,758 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 12:20:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:09,769 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-28 12:20:09,769 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-28 12:20:09,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:20:09,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:20:09,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-28 12:20:09,771 INFO L87 Difference]: Start difference. First operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-28 12:20:09,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:09,778 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-28 12:20:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-28 12:20:09,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:20:09,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:20:09,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:20:09,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:20:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 12:20:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-04-28 12:20:09,782 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 43 [2022-04-28 12:20:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:20:09,782 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-04-28 12:20:09,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:20:09,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 46 transitions. [2022-04-28 12:20:09,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-28 12:20:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 12:20:09,878 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:20:09,878 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:20:09,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 12:20:09,878 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:20:09,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:20:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash 987777007, now seen corresponding path program 1 times [2022-04-28 12:20:09,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:20:09,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [367130542] [2022-04-28 12:20:09,880 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:20:09,880 INFO L85 PathProgramCache]: Analyzing trace with hash 987777007, now seen corresponding path program 2 times [2022-04-28 12:20:09,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:20:09,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573225371] [2022-04-28 12:20:09,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:20:09,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:20:09,916 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:20:09,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272151012] [2022-04-28 12:20:09,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:20:09,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:20:09,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:20:09,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:20:09,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 12:20:09,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:20:09,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:20:09,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:20:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:20:09,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:20:10,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {361#true} is VALID [2022-04-28 12:20:10,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#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(11, 2);call #Ultimate.allocInit(12, 3); {361#true} is VALID [2022-04-28 12:20:10,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 12:20:10,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #103#return; {361#true} is VALID [2022-04-28 12:20:10,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret6 := main(); {361#true} is VALID [2022-04-28 12:20:10,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {361#true} is VALID [2022-04-28 12:20:10,196 INFO L272 TraceCheckUtils]: 6: Hoare triple {361#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {361#true} is VALID [2022-04-28 12:20:10,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 12:20:10,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 12:20:10,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 12:20:10,197 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {361#true} {361#true} #79#return; {361#true} is VALID [2022-04-28 12:20:10,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {361#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {361#true} is VALID [2022-04-28 12:20:10,197 INFO L272 TraceCheckUtils]: 12: Hoare triple {361#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {361#true} is VALID [2022-04-28 12:20:10,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 12:20:10,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 12:20:10,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 12:20:10,198 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {361#true} {361#true} #81#return; {361#true} is VALID [2022-04-28 12:20:10,198 INFO L272 TraceCheckUtils]: 17: Hoare triple {361#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {361#true} is VALID [2022-04-28 12:20:10,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 12:20:10,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 12:20:10,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 12:20:10,198 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {361#true} {361#true} #83#return; {361#true} is VALID [2022-04-28 12:20:10,199 INFO L272 TraceCheckUtils]: 22: Hoare triple {361#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {361#true} is VALID [2022-04-28 12:20:10,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {361#true} ~cond := #in~cond; {435#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:20:10,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {435#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {439#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:20:10,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {439#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {439#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:20:10,200 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {439#(not (= |assume_abort_if_not_#in~cond| 0))} {361#true} #85#return; {446#(<= 1 main_~y~0)} is VALID [2022-04-28 12:20:10,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {446#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {450#(<= 1 main_~b~0)} is VALID [2022-04-28 12:20:10,201 INFO L272 TraceCheckUtils]: 28: Hoare triple {450#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {361#true} is VALID [2022-04-28 12:20:10,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 12:20:10,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 12:20:10,203 INFO L290 TraceCheckUtils]: 31: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 12:20:10,203 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {361#true} {450#(<= 1 main_~b~0)} #87#return; {450#(<= 1 main_~b~0)} is VALID [2022-04-28 12:20:10,206 INFO L272 TraceCheckUtils]: 33: Hoare triple {450#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {361#true} is VALID [2022-04-28 12:20:10,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 12:20:10,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 12:20:10,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 12:20:10,210 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {361#true} {450#(<= 1 main_~b~0)} #89#return; {450#(<= 1 main_~b~0)} is VALID [2022-04-28 12:20:10,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {450#(<= 1 main_~b~0)} assume !false; {450#(<= 1 main_~b~0)} is VALID [2022-04-28 12:20:10,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {450#(<= 1 main_~b~0)} assume !(0 != ~b~0); {362#false} is VALID [2022-04-28 12:20:10,212 INFO L272 TraceCheckUtils]: 40: Hoare triple {362#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {362#false} is VALID [2022-04-28 12:20:10,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {362#false} ~cond := #in~cond; {362#false} is VALID [2022-04-28 12:20:10,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {362#false} assume 0 == ~cond; {362#false} is VALID [2022-04-28 12:20:10,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-04-28 12:20:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 12:20:10,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:20:10,471 INFO L290 TraceCheckUtils]: 43: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-04-28 12:20:10,471 INFO L290 TraceCheckUtils]: 42: Hoare triple {362#false} assume 0 == ~cond; {362#false} is VALID [2022-04-28 12:20:10,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {362#false} ~cond := #in~cond; {362#false} is VALID [2022-04-28 12:20:10,471 INFO L272 TraceCheckUtils]: 40: Hoare triple {362#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {362#false} is VALID [2022-04-28 12:20:10,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {450#(<= 1 main_~b~0)} assume !(0 != ~b~0); {362#false} is VALID [2022-04-28 12:20:10,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {450#(<= 1 main_~b~0)} assume !false; {450#(<= 1 main_~b~0)} is VALID [2022-04-28 12:20:10,479 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {361#true} {450#(<= 1 main_~b~0)} #89#return; {450#(<= 1 main_~b~0)} is VALID [2022-04-28 12:20:10,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 12:20:10,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 12:20:10,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 12:20:10,480 INFO L272 TraceCheckUtils]: 33: Hoare triple {450#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {361#true} is VALID [2022-04-28 12:20:10,480 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {361#true} {450#(<= 1 main_~b~0)} #87#return; {450#(<= 1 main_~b~0)} is VALID [2022-04-28 12:20:10,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 12:20:10,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 12:20:10,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 12:20:10,481 INFO L272 TraceCheckUtils]: 28: Hoare triple {450#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {361#true} is VALID [2022-04-28 12:20:10,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {446#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {450#(<= 1 main_~b~0)} is VALID [2022-04-28 12:20:10,481 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {439#(not (= |assume_abort_if_not_#in~cond| 0))} {361#true} #85#return; {446#(<= 1 main_~y~0)} is VALID [2022-04-28 12:20:10,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {439#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {439#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:20:10,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {559#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {439#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:20:10,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {361#true} ~cond := #in~cond; {559#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 12:20:10,483 INFO L272 TraceCheckUtils]: 22: Hoare triple {361#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {361#true} is VALID [2022-04-28 12:20:10,483 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {361#true} {361#true} #83#return; {361#true} is VALID [2022-04-28 12:20:10,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 12:20:10,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 12:20:10,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 12:20:10,483 INFO L272 TraceCheckUtils]: 17: Hoare triple {361#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {361#true} is VALID [2022-04-28 12:20:10,483 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {361#true} {361#true} #81#return; {361#true} is VALID [2022-04-28 12:20:10,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 12:20:10,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 12:20:10,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 12:20:10,483 INFO L272 TraceCheckUtils]: 12: Hoare triple {361#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {361#true} is VALID [2022-04-28 12:20:10,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {361#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {361#true} is VALID [2022-04-28 12:20:10,484 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {361#true} {361#true} #79#return; {361#true} is VALID [2022-04-28 12:20:10,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 12:20:10,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 12:20:10,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 12:20:10,484 INFO L272 TraceCheckUtils]: 6: Hoare triple {361#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {361#true} is VALID [2022-04-28 12:20:10,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {361#true} is VALID [2022-04-28 12:20:10,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret6 := main(); {361#true} is VALID [2022-04-28 12:20:10,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #103#return; {361#true} is VALID [2022-04-28 12:20:10,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 12:20:10,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#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(11, 2);call #Ultimate.allocInit(12, 3); {361#true} is VALID [2022-04-28 12:20:10,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {361#true} is VALID [2022-04-28 12:20:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 12:20:10,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:20:10,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573225371] [2022-04-28 12:20:10,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:20:10,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272151012] [2022-04-28 12:20:10,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272151012] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:20:10,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:20:10,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-28 12:20:10,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:20:10,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [367130542] [2022-04-28 12:20:10,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [367130542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:20:10,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:20:10,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:20:10,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728524622] [2022-04-28 12:20:10,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:20:10,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-04-28 12:20:10,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:20:10,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:20:10,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:10,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:20:10,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:20:10,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:20:10,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 12:20:10,510 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:20:10,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:10,792 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2022-04-28 12:20:10,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:20:10,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-04-28 12:20:10,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:20:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:20:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-28 12:20:10,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:20:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-28 12:20:10,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-28 12:20:10,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:10,854 INFO L225 Difference]: With dead ends: 52 [2022-04-28 12:20:10,854 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 12:20:10,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:20:10,855 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 19 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:20:10,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 128 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:20:10,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 12:20:10,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-04-28 12:20:10,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:20:10,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 12:20:10,873 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 12:20:10,873 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 12:20:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:10,875 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-28 12:20:10,875 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-04-28 12:20:10,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:20:10,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:20:10,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 44 states. [2022-04-28 12:20:10,876 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 44 states. [2022-04-28 12:20:10,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:10,879 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-28 12:20:10,879 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-04-28 12:20:10,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:20:10,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:20:10,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:20:10,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:20:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 12:20:10,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-28 12:20:10,881 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 44 [2022-04-28 12:20:10,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:20:10,881 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-28 12:20:10,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:20:10,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 48 transitions. [2022-04-28 12:20:10,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:10,920 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-28 12:20:10,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 12:20:10,921 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:20:10,921 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:20:10,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 12:20:11,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:20:11,144 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:20:11,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:20:11,144 INFO L85 PathProgramCache]: Analyzing trace with hash 561616070, now seen corresponding path program 1 times [2022-04-28 12:20:11,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:20:11,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1805437309] [2022-04-28 12:20:11,145 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:20:11,145 INFO L85 PathProgramCache]: Analyzing trace with hash 561616070, now seen corresponding path program 2 times [2022-04-28 12:20:11,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:20:11,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207007718] [2022-04-28 12:20:11,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:20:11,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:20:11,186 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:20:11,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2017180818] [2022-04-28 12:20:11,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:20:11,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:20:11,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:20:11,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:20:11,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 12:20:11,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:20:11,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:20:11,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 12:20:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:20:11,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:20:11,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {901#true} call ULTIMATE.init(); {901#true} is VALID [2022-04-28 12:20:11,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#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(11, 2);call #Ultimate.allocInit(12, 3); {901#true} is VALID [2022-04-28 12:20:11,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 12:20:11,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #103#return; {901#true} is VALID [2022-04-28 12:20:11,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret6 := main(); {901#true} is VALID [2022-04-28 12:20:11,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {901#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {901#true} is VALID [2022-04-28 12:20:11,376 INFO L272 TraceCheckUtils]: 6: Hoare triple {901#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {901#true} is VALID [2022-04-28 12:20:11,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-28 12:20:11,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-28 12:20:11,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 12:20:11,376 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {901#true} {901#true} #79#return; {901#true} is VALID [2022-04-28 12:20:11,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {901#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {901#true} is VALID [2022-04-28 12:20:11,376 INFO L272 TraceCheckUtils]: 12: Hoare triple {901#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {901#true} is VALID [2022-04-28 12:20:11,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-28 12:20:11,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-28 12:20:11,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 12:20:11,377 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {901#true} {901#true} #81#return; {901#true} is VALID [2022-04-28 12:20:11,377 INFO L272 TraceCheckUtils]: 17: Hoare triple {901#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {901#true} is VALID [2022-04-28 12:20:11,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-28 12:20:11,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-28 12:20:11,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 12:20:11,377 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {901#true} {901#true} #83#return; {901#true} is VALID [2022-04-28 12:20:11,377 INFO L272 TraceCheckUtils]: 22: Hoare triple {901#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {901#true} is VALID [2022-04-28 12:20:11,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-28 12:20:11,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-28 12:20:11,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 12:20:11,378 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {901#true} {901#true} #85#return; {901#true} is VALID [2022-04-28 12:20:11,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {901#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {901#true} is VALID [2022-04-28 12:20:11,378 INFO L272 TraceCheckUtils]: 28: Hoare triple {901#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {901#true} is VALID [2022-04-28 12:20:11,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-28 12:20:11,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-28 12:20:11,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 12:20:11,378 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {901#true} {901#true} #87#return; {901#true} is VALID [2022-04-28 12:20:11,378 INFO L272 TraceCheckUtils]: 33: Hoare triple {901#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {901#true} is VALID [2022-04-28 12:20:11,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-28 12:20:11,378 INFO L290 TraceCheckUtils]: 35: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-28 12:20:11,378 INFO L290 TraceCheckUtils]: 36: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 12:20:11,379 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {901#true} {901#true} #89#return; {901#true} is VALID [2022-04-28 12:20:11,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {901#true} assume !false; {901#true} is VALID [2022-04-28 12:20:11,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1023#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:20:11,379 INFO L290 TraceCheckUtils]: 40: Hoare triple {1023#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} assume !false; {1023#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:20:11,380 INFO L272 TraceCheckUtils]: 41: Hoare triple {1023#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1030#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:20:11,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {1030#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1034#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:20:11,381 INFO L290 TraceCheckUtils]: 43: Hoare triple {1034#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {902#false} is VALID [2022-04-28 12:20:11,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-04-28 12:20:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 12:20:11,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:20:11,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:20:11,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207007718] [2022-04-28 12:20:11,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:20:11,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017180818] [2022-04-28 12:20:11,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017180818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:20:11,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:20:11,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:20:11,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:20:11,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1805437309] [2022-04-28 12:20:11,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1805437309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:20:11,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:20:11,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:20:11,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933456328] [2022-04-28 12:20:11,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:20:11,383 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2022-04-28 12:20:11,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:20:11,383 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 12:20:11,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:11,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:20:11,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:20:11,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:20:11,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:20:11,402 INFO L87 Difference]: Start difference. First operand 37 states and 48 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 12:20:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:11,582 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-28 12:20:11,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:20:11,582 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2022-04-28 12:20:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:20:11,583 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 12:20:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-28 12:20:11,584 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 12:20:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-28 12:20:11,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-28 12:20:11,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:11,631 INFO L225 Difference]: With dead ends: 50 [2022-04-28 12:20:11,631 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 12:20:11,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:20:11,632 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:20:11,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:20:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 12:20:11,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2022-04-28 12:20:11,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:20:11,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:20:11,652 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:20:11,653 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:20:11,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:11,655 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-04-28 12:20:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-04-28 12:20:11,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:20:11,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:20:11,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-28 12:20:11,655 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-28 12:20:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:11,657 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-04-28 12:20:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-04-28 12:20:11,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:20:11,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:20:11,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:20:11,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:20:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:20:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2022-04-28 12:20:11,659 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 45 [2022-04-28 12:20:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:20:11,660 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2022-04-28 12:20:11,660 INFO L496 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 12:20:11,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 54 transitions. [2022-04-28 12:20:11,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:11,704 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 12:20:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 12:20:11,704 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:20:11,705 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:20:11,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 12:20:11,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 12:20:11,921 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:20:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:20:11,922 INFO L85 PathProgramCache]: Analyzing trace with hash -680064098, now seen corresponding path program 1 times [2022-04-28 12:20:11,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:20:11,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1678850497] [2022-04-28 12:20:11,922 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:20:11,922 INFO L85 PathProgramCache]: Analyzing trace with hash -680064098, now seen corresponding path program 2 times [2022-04-28 12:20:11,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:20:11,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345777535] [2022-04-28 12:20:11,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:20:11,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:20:11,944 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:20:11,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1771293229] [2022-04-28 12:20:11,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:20:11,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:20:11,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:20:11,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:20:11,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 12:20:11,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:20:11,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:20:11,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:20:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:20:12,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:20:15,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {1324#true} call ULTIMATE.init(); {1324#true} is VALID [2022-04-28 12:20:15,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {1324#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(11, 2);call #Ultimate.allocInit(12, 3); {1324#true} is VALID [2022-04-28 12:20:15,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-28 12:20:15,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1324#true} {1324#true} #103#return; {1324#true} is VALID [2022-04-28 12:20:15,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {1324#true} call #t~ret6 := main(); {1324#true} is VALID [2022-04-28 12:20:15,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {1324#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1324#true} is VALID [2022-04-28 12:20:15,086 INFO L272 TraceCheckUtils]: 6: Hoare triple {1324#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1324#true} is VALID [2022-04-28 12:20:15,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-28 12:20:15,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-28 12:20:15,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-28 12:20:15,086 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1324#true} {1324#true} #79#return; {1324#true} is VALID [2022-04-28 12:20:15,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {1324#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1324#true} is VALID [2022-04-28 12:20:15,086 INFO L272 TraceCheckUtils]: 12: Hoare triple {1324#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1324#true} is VALID [2022-04-28 12:20:15,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-28 12:20:15,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-28 12:20:15,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-28 12:20:15,087 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1324#true} {1324#true} #81#return; {1324#true} is VALID [2022-04-28 12:20:15,087 INFO L272 TraceCheckUtils]: 17: Hoare triple {1324#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1324#true} is VALID [2022-04-28 12:20:15,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-28 12:20:15,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-28 12:20:15,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-28 12:20:15,087 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1324#true} {1324#true} #83#return; {1324#true} is VALID [2022-04-28 12:20:15,087 INFO L272 TraceCheckUtils]: 22: Hoare triple {1324#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1324#true} is VALID [2022-04-28 12:20:15,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-28 12:20:15,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-28 12:20:15,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-28 12:20:15,088 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1324#true} {1324#true} #85#return; {1324#true} is VALID [2022-04-28 12:20:15,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {1324#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:20:15,088 INFO L272 TraceCheckUtils]: 28: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1324#true} is VALID [2022-04-28 12:20:15,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-28 12:20:15,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-28 12:20:15,089 INFO L290 TraceCheckUtils]: 31: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-28 12:20:15,089 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1324#true} {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:20:15,089 INFO L272 TraceCheckUtils]: 33: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1324#true} is VALID [2022-04-28 12:20:15,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-28 12:20:15,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-28 12:20:15,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-28 12:20:15,090 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1324#true} {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:20:15,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:20:15,091 INFO L290 TraceCheckUtils]: 39: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:20:15,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:20:15,091 INFO L272 TraceCheckUtils]: 41: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1324#true} is VALID [2022-04-28 12:20:15,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-28 12:20:15,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-28 12:20:15,092 INFO L290 TraceCheckUtils]: 44: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-28 12:20:15,092 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1324#true} {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:20:15,093 INFO L272 TraceCheckUtils]: 46: Hoare triple {1410#(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)); {1468#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:20:15,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {1468#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1472#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:20:15,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {1472#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1325#false} is VALID [2022-04-28 12:20:15,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {1325#false} assume !false; {1325#false} is VALID [2022-04-28 12:20:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 12:20:15,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:20:15,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:20:15,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345777535] [2022-04-28 12:20:15,094 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:20:15,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771293229] [2022-04-28 12:20:15,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771293229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:20:15,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:20:15,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:20:15,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:20:15,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1678850497] [2022-04-28 12:20:15,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1678850497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:20:15,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:20:15,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:20:15,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335901590] [2022-04-28 12:20:15,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:20:15,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2022-04-28 12:20:15,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:20:15,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 12:20:15,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:15,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:20:15,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:20:15,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:20:15,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:20:15,122 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 12:20:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:15,328 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-28 12:20:15,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:20:15,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2022-04-28 12:20:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:20:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 12:20:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 12:20:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 12:20:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 12:20:15,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 12:20:15,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:15,407 INFO L225 Difference]: With dead ends: 58 [2022-04-28 12:20:15,407 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 12:20:15,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:20:15,409 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:20:15,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 161 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:20:15,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 12:20:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-04-28 12:20:15,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:20:15,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 12:20:15,450 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 12:20:15,450 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 12:20:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:15,452 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2022-04-28 12:20:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-04-28 12:20:15,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:20:15,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:20:15,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 56 states. [2022-04-28 12:20:15,453 INFO L87 Difference]: Start difference. First operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 56 states. [2022-04-28 12:20:15,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:15,455 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2022-04-28 12:20:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-04-28 12:20:15,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:20:15,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:20:15,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:20:15,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:20:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 12:20:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2022-04-28 12:20:15,458 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 50 [2022-04-28 12:20:15,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:20:15,458 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2022-04-28 12:20:15,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 12:20:15,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 71 transitions. [2022-04-28 12:20:15,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2022-04-28 12:20:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 12:20:15,533 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:20:15,533 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:20:15,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 12:20:15,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:20:15,734 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:20:15,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:20:15,734 INFO L85 PathProgramCache]: Analyzing trace with hash 606548870, now seen corresponding path program 1 times [2022-04-28 12:20:15,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:20:15,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [605678470] [2022-04-28 12:20:15,735 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:20:15,735 INFO L85 PathProgramCache]: Analyzing trace with hash 606548870, now seen corresponding path program 2 times [2022-04-28 12:20:15,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:20:15,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214797418] [2022-04-28 12:20:15,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:20:15,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:20:15,749 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:20:15,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2000310497] [2022-04-28 12:20:15,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:20:15,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:20:15,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:20:15,752 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:20:15,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 12:20:15,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:20:15,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:20:15,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:20:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:20:15,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:20:18,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {1818#true} call ULTIMATE.init(); {1818#true} is VALID [2022-04-28 12:20:18,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#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(11, 2);call #Ultimate.allocInit(12, 3); {1818#true} is VALID [2022-04-28 12:20:18,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 12:20:18,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1818#true} #103#return; {1818#true} is VALID [2022-04-28 12:20:18,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {1818#true} call #t~ret6 := main(); {1818#true} is VALID [2022-04-28 12:20:18,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {1818#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1818#true} is VALID [2022-04-28 12:20:18,326 INFO L272 TraceCheckUtils]: 6: Hoare triple {1818#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1818#true} is VALID [2022-04-28 12:20:18,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 12:20:18,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 12:20:18,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 12:20:18,326 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1818#true} {1818#true} #79#return; {1818#true} is VALID [2022-04-28 12:20:18,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {1818#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1818#true} is VALID [2022-04-28 12:20:18,326 INFO L272 TraceCheckUtils]: 12: Hoare triple {1818#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1818#true} is VALID [2022-04-28 12:20:18,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 12:20:18,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 12:20:18,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 12:20:18,327 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1818#true} {1818#true} #81#return; {1818#true} is VALID [2022-04-28 12:20:18,327 INFO L272 TraceCheckUtils]: 17: Hoare triple {1818#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1818#true} is VALID [2022-04-28 12:20:18,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 12:20:18,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 12:20:18,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 12:20:18,327 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1818#true} {1818#true} #83#return; {1818#true} is VALID [2022-04-28 12:20:18,327 INFO L272 TraceCheckUtils]: 22: Hoare triple {1818#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1818#true} is VALID [2022-04-28 12:20:18,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 12:20:18,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 12:20:18,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 12:20:18,328 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1818#true} {1818#true} #85#return; {1818#true} is VALID [2022-04-28 12:20:18,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {1818#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:20:18,328 INFO L272 TraceCheckUtils]: 28: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1818#true} is VALID [2022-04-28 12:20:18,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 12:20:18,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 12:20:18,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 12:20:18,329 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1818#true} {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:20:18,329 INFO L272 TraceCheckUtils]: 33: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1818#true} is VALID [2022-04-28 12:20:18,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 12:20:18,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 12:20:18,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 12:20:18,330 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1818#true} {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #89#return; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:20:18,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:20:18,331 INFO L290 TraceCheckUtils]: 39: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:20:18,331 INFO L290 TraceCheckUtils]: 40: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:20:18,331 INFO L272 TraceCheckUtils]: 41: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1818#true} is VALID [2022-04-28 12:20:18,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 12:20:18,331 INFO L290 TraceCheckUtils]: 43: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 12:20:18,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 12:20:18,332 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1818#true} {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #91#return; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:20:18,332 INFO L272 TraceCheckUtils]: 46: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1818#true} is VALID [2022-04-28 12:20:18,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 12:20:18,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 12:20:18,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 12:20:18,333 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1818#true} {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #93#return; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:20:18,334 INFO L272 TraceCheckUtils]: 51: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1977#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:20:18,334 INFO L290 TraceCheckUtils]: 52: Hoare triple {1977#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1981#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:20:18,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {1981#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1819#false} is VALID [2022-04-28 12:20:18,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {1819#false} assume !false; {1819#false} is VALID [2022-04-28 12:20:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 12:20:18,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:20:18,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:20:18,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214797418] [2022-04-28 12:20:18,335 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:20:18,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000310497] [2022-04-28 12:20:18,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000310497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:20:18,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:20:18,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:20:18,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:20:18,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [605678470] [2022-04-28 12:20:18,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [605678470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:20:18,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:20:18,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:20:18,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468518006] [2022-04-28 12:20:18,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:20:18,336 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2022-04-28 12:20:18,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:20:18,336 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:20:18,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:18,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:20:18,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:20:18,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:20:18,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:20:18,364 INFO L87 Difference]: Start difference. First operand 55 states and 71 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:20:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:18,722 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2022-04-28 12:20:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:20:18,722 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2022-04-28 12:20:18,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:20:18,723 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:20:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 12:20:18,724 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:20:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 12:20:18,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 12:20:18,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:18,781 INFO L225 Difference]: With dead ends: 62 [2022-04-28 12:20:18,781 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 12:20:18,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:20:18,782 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 7 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:20:18,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 151 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:20:18,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 12:20:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-28 12:20:18,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:20:18,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 12:20:18,822 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 12:20:18,823 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 12:20:18,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:18,825 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-04-28 12:20:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-04-28 12:20:18,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:20:18,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:20:18,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 60 states. [2022-04-28 12:20:18,826 INFO L87 Difference]: Start difference. First operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 60 states. [2022-04-28 12:20:18,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:18,829 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-04-28 12:20:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-04-28 12:20:18,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:20:18,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:20:18,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:20:18,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:20:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 12:20:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2022-04-28 12:20:18,832 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 55 [2022-04-28 12:20:18,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:20:18,833 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2022-04-28 12:20:18,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:20:18,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 74 transitions. [2022-04-28 12:20:18,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-04-28 12:20:18,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 12:20:18,921 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:20:18,921 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:20:18,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 12:20:19,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:20:19,122 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:20:19,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:20:19,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1584976990, now seen corresponding path program 1 times [2022-04-28 12:20:19,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:20:19,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [785698253] [2022-04-28 12:20:19,122 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:20:19,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1584976990, now seen corresponding path program 2 times [2022-04-28 12:20:19,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:20:19,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369164183] [2022-04-28 12:20:19,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:20:19,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:20:19,147 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:20:19,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1465110490] [2022-04-28 12:20:19,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:20:19,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:20:19,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:20:19,150 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:20:19,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 12:20:19,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:20:19,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:20:19,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 12:20:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:20:19,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:20:27,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {2351#true} call ULTIMATE.init(); {2351#true} is VALID [2022-04-28 12:20:27,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {2351#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(11, 2);call #Ultimate.allocInit(12, 3); {2351#true} is VALID [2022-04-28 12:20:27,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 12:20:27,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2351#true} {2351#true} #103#return; {2351#true} is VALID [2022-04-28 12:20:27,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {2351#true} call #t~ret6 := main(); {2351#true} is VALID [2022-04-28 12:20:27,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {2351#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2351#true} is VALID [2022-04-28 12:20:27,029 INFO L272 TraceCheckUtils]: 6: Hoare triple {2351#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2351#true} is VALID [2022-04-28 12:20:27,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-28 12:20:27,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-28 12:20:27,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 12:20:27,029 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2351#true} {2351#true} #79#return; {2351#true} is VALID [2022-04-28 12:20:27,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {2351#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2351#true} is VALID [2022-04-28 12:20:27,029 INFO L272 TraceCheckUtils]: 12: Hoare triple {2351#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2351#true} is VALID [2022-04-28 12:20:27,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-28 12:20:27,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-28 12:20:27,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 12:20:27,030 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2351#true} {2351#true} #81#return; {2351#true} is VALID [2022-04-28 12:20:27,030 INFO L272 TraceCheckUtils]: 17: Hoare triple {2351#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2351#true} is VALID [2022-04-28 12:20:27,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-28 12:20:27,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-28 12:20:27,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 12:20:27,030 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2351#true} {2351#true} #83#return; {2351#true} is VALID [2022-04-28 12:20:27,030 INFO L272 TraceCheckUtils]: 22: Hoare triple {2351#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2351#true} is VALID [2022-04-28 12:20:27,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-28 12:20:27,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-28 12:20:27,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 12:20:27,031 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2351#true} {2351#true} #85#return; {2351#true} is VALID [2022-04-28 12:20:27,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {2351#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 12:20:27,031 INFO L272 TraceCheckUtils]: 28: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2351#true} is VALID [2022-04-28 12:20:27,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-28 12:20:27,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-28 12:20:27,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 12:20:27,032 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2351#true} {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #87#return; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 12:20:27,033 INFO L272 TraceCheckUtils]: 33: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2351#true} is VALID [2022-04-28 12:20:27,033 INFO L290 TraceCheckUtils]: 34: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-28 12:20:27,033 INFO L290 TraceCheckUtils]: 35: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-28 12:20:27,033 INFO L290 TraceCheckUtils]: 36: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 12:20:27,034 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2351#true} {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #89#return; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 12:20:27,034 INFO L290 TraceCheckUtils]: 38: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !false; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 12:20:27,035 INFO L290 TraceCheckUtils]: 39: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 12:20:27,035 INFO L290 TraceCheckUtils]: 40: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !false; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 12:20:27,035 INFO L272 TraceCheckUtils]: 41: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2351#true} is VALID [2022-04-28 12:20:27,035 INFO L290 TraceCheckUtils]: 42: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-28 12:20:27,036 INFO L290 TraceCheckUtils]: 43: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-28 12:20:27,036 INFO L290 TraceCheckUtils]: 44: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 12:20:27,037 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2351#true} {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #91#return; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 12:20:27,037 INFO L272 TraceCheckUtils]: 46: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~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)); {2351#true} is VALID [2022-04-28 12:20:27,037 INFO L290 TraceCheckUtils]: 47: Hoare triple {2351#true} ~cond := #in~cond; {2498#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:20:27,038 INFO L290 TraceCheckUtils]: 48: Hoare triple {2498#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:20:27,038 INFO L290 TraceCheckUtils]: 49: Hoare triple {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:20:27,039 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #93#return; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 12:20:27,039 INFO L272 TraceCheckUtils]: 51: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~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)); {2351#true} is VALID [2022-04-28 12:20:27,039 INFO L290 TraceCheckUtils]: 52: Hoare triple {2351#true} ~cond := #in~cond; {2498#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:20:27,040 INFO L290 TraceCheckUtils]: 53: Hoare triple {2498#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:20:27,040 INFO L290 TraceCheckUtils]: 54: Hoare triple {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:20:27,041 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #95#return; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 12:20:27,042 INFO L272 TraceCheckUtils]: 56: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {2527#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:20:27,042 INFO L290 TraceCheckUtils]: 57: Hoare triple {2527#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2531#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:20:27,042 INFO L290 TraceCheckUtils]: 58: Hoare triple {2531#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2352#false} is VALID [2022-04-28 12:20:27,042 INFO L290 TraceCheckUtils]: 59: Hoare triple {2352#false} assume !false; {2352#false} is VALID [2022-04-28 12:20:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 12:20:27,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:21:19,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:21:19,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369164183] [2022-04-28 12:21:19,476 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:21:19,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465110490] [2022-04-28 12:21:19,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465110490] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 12:21:19,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:21:19,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 12:21:19,477 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:21:19,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [785698253] [2022-04-28 12:21:19,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [785698253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:21:19,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:21:19,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:21:19,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871439540] [2022-04-28 12:21:19,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:21:19,478 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), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2022-04-28 12:21:19,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:21:19,478 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), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 12:21:19,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:19,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:21:19,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:19,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:21:19,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:21:19,520 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 12:21:19,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:19,900 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-04-28 12:21:19,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 12:21:19,900 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), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2022-04-28 12:21:19,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:21:19,900 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), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 12:21:19,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 12:21:19,901 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), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 12:21:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 12:21:19,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-28 12:21:19,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:19,956 INFO L225 Difference]: With dead ends: 66 [2022-04-28 12:21:19,956 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 12:21:19,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-28 12:21:19,956 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 11 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:21:19,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 164 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:21:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 12:21:20,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-28 12:21:20,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:21:20,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 12:21:20,006 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 12:21:20,006 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 12:21:20,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:20,008 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2022-04-28 12:21:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2022-04-28 12:21:20,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:20,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:20,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 64 states. [2022-04-28 12:21:20,009 INFO L87 Difference]: Start difference. First operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 64 states. [2022-04-28 12:21:20,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:20,011 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2022-04-28 12:21:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2022-04-28 12:21:20,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:20,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:20,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:21:20,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:21:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 12:21:20,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-04-28 12:21:20,014 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 60 [2022-04-28 12:21:20,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:21:20,014 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2022-04-28 12:21:20,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 12:21:20,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 77 transitions. [2022-04-28 12:21:20,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:20,087 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-28 12:21:20,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 12:21:20,087 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:21:20,087 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:21:20,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 12:21:20,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:21:20,291 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:21:20,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:21:20,291 INFO L85 PathProgramCache]: Analyzing trace with hash -669670075, now seen corresponding path program 1 times [2022-04-28 12:21:20,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:20,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [964990208] [2022-04-28 12:21:20,292 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:21:20,292 INFO L85 PathProgramCache]: Analyzing trace with hash -669670075, now seen corresponding path program 2 times [2022-04-28 12:21:20,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:21:20,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046353090] [2022-04-28 12:21:20,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:21:20,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:21:20,305 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:21:20,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [434230533] [2022-04-28 12:21:20,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:21:20,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:21:20,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:21:20,307 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:21:20,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 12:21:20,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:21:20,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:21:20,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 12:21:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:21:20,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:21:20,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {2944#true} call ULTIMATE.init(); {2944#true} is VALID [2022-04-28 12:21:20,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {2944#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(11, 2);call #Ultimate.allocInit(12, 3); {2944#true} is VALID [2022-04-28 12:21:20,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2944#true} {2944#true} #103#return; {2944#true} is VALID [2022-04-28 12:21:20,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {2944#true} call #t~ret6 := main(); {2944#true} is VALID [2022-04-28 12:21:20,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {2944#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2944#true} is VALID [2022-04-28 12:21:20,539 INFO L272 TraceCheckUtils]: 6: Hoare triple {2944#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,547 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2944#true} {2944#true} #79#return; {2944#true} is VALID [2022-04-28 12:21:20,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {2944#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2944#true} is VALID [2022-04-28 12:21:20,547 INFO L272 TraceCheckUtils]: 12: Hoare triple {2944#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,547 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2944#true} {2944#true} #81#return; {2944#true} is VALID [2022-04-28 12:21:20,547 INFO L272 TraceCheckUtils]: 17: Hoare triple {2944#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,547 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2944#true} {2944#true} #83#return; {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L272 TraceCheckUtils]: 22: Hoare triple {2944#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2944#true} {2944#true} #85#return; {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {2944#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L272 TraceCheckUtils]: 28: Hoare triple {2944#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2944#true} {2944#true} #87#return; {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L272 TraceCheckUtils]: 33: Hoare triple {2944#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2944#true} {2944#true} #89#return; {2944#true} is VALID [2022-04-28 12:21:20,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {2944#true} assume !false; {2944#true} is VALID [2022-04-28 12:21:20,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {2944#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:21:20,550 INFO L290 TraceCheckUtils]: 40: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !false; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:21:20,550 INFO L272 TraceCheckUtils]: 41: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,551 INFO L290 TraceCheckUtils]: 43: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,551 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2944#true} {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #91#return; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:21:20,551 INFO L272 TraceCheckUtils]: 46: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,552 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2944#true} {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #93#return; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:21:20,552 INFO L272 TraceCheckUtils]: 51: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,552 INFO L290 TraceCheckUtils]: 52: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,552 INFO L290 TraceCheckUtils]: 53: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,552 INFO L290 TraceCheckUtils]: 54: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,553 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {2944#true} {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #95#return; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:21:20,553 INFO L272 TraceCheckUtils]: 56: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,553 INFO L290 TraceCheckUtils]: 57: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,553 INFO L290 TraceCheckUtils]: 58: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,553 INFO L290 TraceCheckUtils]: 59: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,554 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2944#true} {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #97#return; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:21:20,555 INFO L290 TraceCheckUtils]: 61: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {3133#(and (= main_~a~0 (+ main_~c~0 main_~b~0)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 12:21:20,556 INFO L290 TraceCheckUtils]: 62: Hoare triple {3133#(and (= main_~a~0 (+ main_~c~0 main_~b~0)) (= (+ (- 1) main_~k~0) 0))} assume !false; {3133#(and (= main_~a~0 (+ main_~c~0 main_~b~0)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 12:21:20,556 INFO L272 TraceCheckUtils]: 63: Hoare triple {3133#(and (= main_~a~0 (+ main_~c~0 main_~b~0)) (= (+ (- 1) main_~k~0) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3140#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:21:20,557 INFO L290 TraceCheckUtils]: 64: Hoare triple {3140#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3144#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:21:20,557 INFO L290 TraceCheckUtils]: 65: Hoare triple {3144#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2945#false} is VALID [2022-04-28 12:21:20,557 INFO L290 TraceCheckUtils]: 66: Hoare triple {2945#false} assume !false; {2945#false} is VALID [2022-04-28 12:21:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 12:21:20,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:21:20,798 INFO L290 TraceCheckUtils]: 66: Hoare triple {2945#false} assume !false; {2945#false} is VALID [2022-04-28 12:21:20,799 INFO L290 TraceCheckUtils]: 65: Hoare triple {3144#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2945#false} is VALID [2022-04-28 12:21:20,799 INFO L290 TraceCheckUtils]: 64: Hoare triple {3140#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3144#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:21:20,800 INFO L272 TraceCheckUtils]: 63: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3140#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:21:20,800 INFO L290 TraceCheckUtils]: 62: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:21:20,802 INFO L290 TraceCheckUtils]: 61: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:21:20,803 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2944#true} {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #97#return; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:21:20,803 INFO L290 TraceCheckUtils]: 59: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,803 INFO L290 TraceCheckUtils]: 58: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,803 INFO L272 TraceCheckUtils]: 56: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,804 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {2944#true} {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #95#return; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:21:20,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,804 INFO L290 TraceCheckUtils]: 53: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,804 INFO L290 TraceCheckUtils]: 52: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,804 INFO L272 TraceCheckUtils]: 51: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,805 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2944#true} {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #93#return; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:21:20,805 INFO L290 TraceCheckUtils]: 49: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,805 INFO L290 TraceCheckUtils]: 48: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,805 INFO L290 TraceCheckUtils]: 47: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,805 INFO L272 TraceCheckUtils]: 46: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,806 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2944#true} {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #91#return; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:21:20,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,806 INFO L290 TraceCheckUtils]: 43: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,806 INFO L290 TraceCheckUtils]: 42: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,806 INFO L272 TraceCheckUtils]: 41: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,806 INFO L290 TraceCheckUtils]: 40: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:21:20,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {2944#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:21:20,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {2944#true} assume !false; {2944#true} is VALID [2022-04-28 12:21:20,807 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2944#true} {2944#true} #89#return; {2944#true} is VALID [2022-04-28 12:21:20,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,807 INFO L272 TraceCheckUtils]: 33: Hoare triple {2944#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,807 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2944#true} {2944#true} #87#return; {2944#true} is VALID [2022-04-28 12:21:20,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,807 INFO L272 TraceCheckUtils]: 28: Hoare triple {2944#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {2944#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2944#true} is VALID [2022-04-28 12:21:20,807 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2944#true} {2944#true} #85#return; {2944#true} is VALID [2022-04-28 12:21:20,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,808 INFO L272 TraceCheckUtils]: 22: Hoare triple {2944#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,808 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2944#true} {2944#true} #83#return; {2944#true} is VALID [2022-04-28 12:21:20,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,808 INFO L272 TraceCheckUtils]: 17: Hoare triple {2944#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,808 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2944#true} {2944#true} #81#return; {2944#true} is VALID [2022-04-28 12:21:20,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,808 INFO L272 TraceCheckUtils]: 12: Hoare triple {2944#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {2944#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2944#true} is VALID [2022-04-28 12:21:20,808 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2944#true} {2944#true} #79#return; {2944#true} is VALID [2022-04-28 12:21:20,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 12:21:20,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 12:21:20,809 INFO L272 TraceCheckUtils]: 6: Hoare triple {2944#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2944#true} is VALID [2022-04-28 12:21:20,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {2944#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2944#true} is VALID [2022-04-28 12:21:20,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {2944#true} call #t~ret6 := main(); {2944#true} is VALID [2022-04-28 12:21:20,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2944#true} {2944#true} #103#return; {2944#true} is VALID [2022-04-28 12:21:20,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 12:21:20,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {2944#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(11, 2);call #Ultimate.allocInit(12, 3); {2944#true} is VALID [2022-04-28 12:21:20,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {2944#true} call ULTIMATE.init(); {2944#true} is VALID [2022-04-28 12:21:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-28 12:21:20,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:21:20,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046353090] [2022-04-28 12:21:20,809 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:21:20,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434230533] [2022-04-28 12:21:20,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434230533] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 12:21:20,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:21:20,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 12:21:20,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:21:20,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [964990208] [2022-04-28 12:21:20,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [964990208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:21:20,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:21:20,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:21:20,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016878752] [2022-04-28 12:21:20,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:21:20,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 67 [2022-04-28 12:21:20,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:21:20,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-28 12:21:20,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:20,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:21:20,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:20,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:21:20,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 12:21:20,842 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-28 12:21:21,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:21,016 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-28 12:21:21,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:21:21,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 67 [2022-04-28 12:21:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:21:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-28 12:21:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-28 12:21:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-28 12:21:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-28 12:21:21,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-28 12:21:21,057 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-28 12:21:21,059 INFO L225 Difference]: With dead ends: 69 [2022-04-28 12:21:21,059 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 12:21:21,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:21:21,060 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:21:21,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 137 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:21:21,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 12:21:21,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2022-04-28 12:21:21,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:21:21,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 12:21:21,094 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 12:21:21,094 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 12:21:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:21,096 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2022-04-28 12:21:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-04-28 12:21:21,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:21,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:21,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-28 12:21:21,096 INFO L87 Difference]: Start difference. First operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-28 12:21:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:21,098 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2022-04-28 12:21:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-04-28 12:21:21,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:21,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:21,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:21:21,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:21:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 12:21:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2022-04-28 12:21:21,100 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 67 [2022-04-28 12:21:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:21:21,100 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2022-04-28 12:21:21,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-28 12:21:21,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 71 transitions. [2022-04-28 12:21:21,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:21,181 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2022-04-28 12:21:21,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 12:21:21,181 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:21:21,181 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:21:21,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 12:21:21,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:21:21,387 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:21:21,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:21:21,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1682830289, now seen corresponding path program 1 times [2022-04-28 12:21:21,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:21,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [851989196] [2022-04-28 12:21:21,388 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:21:21,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1682830289, now seen corresponding path program 2 times [2022-04-28 12:21:21,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:21:21,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797594909] [2022-04-28 12:21:21,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:21:21,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:21:21,400 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:21:21,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [569011343] [2022-04-28 12:21:21,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:21:21,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:21:21,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:21:21,401 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:21:21,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 12:21:21,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:21:21,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:21:21,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:21:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:21:21,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:21:21,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3744#true} is VALID [2022-04-28 12:21:21,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#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(11, 2);call #Ultimate.allocInit(12, 3); {3744#true} is VALID [2022-04-28 12:21:21,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3744#true} #103#return; {3744#true} is VALID [2022-04-28 12:21:21,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {3744#true} call #t~ret6 := main(); {3744#true} is VALID [2022-04-28 12:21:21,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {3744#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3744#true} is VALID [2022-04-28 12:21:21,650 INFO L272 TraceCheckUtils]: 6: Hoare triple {3744#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,650 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3744#true} {3744#true} #79#return; {3744#true} is VALID [2022-04-28 12:21:21,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {3744#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3744#true} is VALID [2022-04-28 12:21:21,650 INFO L272 TraceCheckUtils]: 12: Hoare triple {3744#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,651 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3744#true} {3744#true} #81#return; {3744#true} is VALID [2022-04-28 12:21:21,651 INFO L272 TraceCheckUtils]: 17: Hoare triple {3744#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {3744#true} ~cond := #in~cond; {3803#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:21:21,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {3803#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3807#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:21:21,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {3807#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3807#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:21:21,656 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3807#(not (= |assume_abort_if_not_#in~cond| 0))} {3744#true} #83#return; {3814#(<= 1 main_~x~0)} is VALID [2022-04-28 12:21:21,656 INFO L272 TraceCheckUtils]: 22: Hoare triple {3814#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,657 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3744#true} {3814#(<= 1 main_~x~0)} #85#return; {3814#(<= 1 main_~x~0)} is VALID [2022-04-28 12:21:21,658 INFO L290 TraceCheckUtils]: 27: Hoare triple {3814#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3833#(<= 1 main_~a~0)} is VALID [2022-04-28 12:21:21,658 INFO L272 TraceCheckUtils]: 28: Hoare triple {3833#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,658 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3744#true} {3833#(<= 1 main_~a~0)} #87#return; {3833#(<= 1 main_~a~0)} is VALID [2022-04-28 12:21:21,658 INFO L272 TraceCheckUtils]: 33: Hoare triple {3833#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,659 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3744#true} {3833#(<= 1 main_~a~0)} #89#return; {3833#(<= 1 main_~a~0)} is VALID [2022-04-28 12:21:21,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {3833#(<= 1 main_~a~0)} assume !false; {3833#(<= 1 main_~a~0)} is VALID [2022-04-28 12:21:21,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {3833#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:21:21,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {3870#(<= 1 main_~c~0)} assume !false; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:21:21,660 INFO L272 TraceCheckUtils]: 41: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,661 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #91#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:21:21,661 INFO L272 TraceCheckUtils]: 46: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,661 INFO L290 TraceCheckUtils]: 47: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,661 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #93#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:21:21,662 INFO L272 TraceCheckUtils]: 51: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,662 INFO L290 TraceCheckUtils]: 52: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,662 INFO L290 TraceCheckUtils]: 53: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,662 INFO L290 TraceCheckUtils]: 54: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,662 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #95#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:21:21,662 INFO L272 TraceCheckUtils]: 56: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,662 INFO L290 TraceCheckUtils]: 57: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,663 INFO L290 TraceCheckUtils]: 58: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,663 INFO L290 TraceCheckUtils]: 59: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,663 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #97#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:21:21,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {3870#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:21:21,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {3870#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3940#(<= 1 main_~b~0)} is VALID [2022-04-28 12:21:21,664 INFO L290 TraceCheckUtils]: 63: Hoare triple {3940#(<= 1 main_~b~0)} assume !false; {3940#(<= 1 main_~b~0)} is VALID [2022-04-28 12:21:21,665 INFO L290 TraceCheckUtils]: 64: Hoare triple {3940#(<= 1 main_~b~0)} assume !(0 != ~b~0); {3745#false} is VALID [2022-04-28 12:21:21,665 INFO L272 TraceCheckUtils]: 65: Hoare triple {3745#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {3745#false} is VALID [2022-04-28 12:21:21,665 INFO L290 TraceCheckUtils]: 66: Hoare triple {3745#false} ~cond := #in~cond; {3745#false} is VALID [2022-04-28 12:21:21,665 INFO L290 TraceCheckUtils]: 67: Hoare triple {3745#false} assume 0 == ~cond; {3745#false} is VALID [2022-04-28 12:21:21,665 INFO L290 TraceCheckUtils]: 68: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2022-04-28 12:21:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 12:21:21,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:21:21,950 INFO L290 TraceCheckUtils]: 68: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2022-04-28 12:21:21,950 INFO L290 TraceCheckUtils]: 67: Hoare triple {3745#false} assume 0 == ~cond; {3745#false} is VALID [2022-04-28 12:21:21,950 INFO L290 TraceCheckUtils]: 66: Hoare triple {3745#false} ~cond := #in~cond; {3745#false} is VALID [2022-04-28 12:21:21,950 INFO L272 TraceCheckUtils]: 65: Hoare triple {3745#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {3745#false} is VALID [2022-04-28 12:21:21,951 INFO L290 TraceCheckUtils]: 64: Hoare triple {3940#(<= 1 main_~b~0)} assume !(0 != ~b~0); {3745#false} is VALID [2022-04-28 12:21:21,951 INFO L290 TraceCheckUtils]: 63: Hoare triple {3940#(<= 1 main_~b~0)} assume !false; {3940#(<= 1 main_~b~0)} is VALID [2022-04-28 12:21:21,951 INFO L290 TraceCheckUtils]: 62: Hoare triple {3870#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3940#(<= 1 main_~b~0)} is VALID [2022-04-28 12:21:21,952 INFO L290 TraceCheckUtils]: 61: Hoare triple {3870#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:21:21,952 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #97#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:21:21,952 INFO L290 TraceCheckUtils]: 59: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,952 INFO L290 TraceCheckUtils]: 58: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,953 INFO L290 TraceCheckUtils]: 57: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,953 INFO L272 TraceCheckUtils]: 56: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,953 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #95#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:21:21,953 INFO L290 TraceCheckUtils]: 54: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,953 INFO L290 TraceCheckUtils]: 53: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,953 INFO L290 TraceCheckUtils]: 52: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,953 INFO L272 TraceCheckUtils]: 51: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,954 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #93#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:21:21,954 INFO L290 TraceCheckUtils]: 49: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,954 INFO L290 TraceCheckUtils]: 48: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,954 INFO L290 TraceCheckUtils]: 47: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,954 INFO L272 TraceCheckUtils]: 46: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,955 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #91#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:21:21,955 INFO L290 TraceCheckUtils]: 44: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,955 INFO L290 TraceCheckUtils]: 43: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,955 INFO L290 TraceCheckUtils]: 42: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,955 INFO L272 TraceCheckUtils]: 41: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,955 INFO L290 TraceCheckUtils]: 40: Hoare triple {3870#(<= 1 main_~c~0)} assume !false; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:21:21,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {3833#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:21:21,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {3833#(<= 1 main_~a~0)} assume !false; {3833#(<= 1 main_~a~0)} is VALID [2022-04-28 12:21:21,957 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3744#true} {3833#(<= 1 main_~a~0)} #89#return; {3833#(<= 1 main_~a~0)} is VALID [2022-04-28 12:21:21,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,957 INFO L272 TraceCheckUtils]: 33: Hoare triple {3833#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,957 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3744#true} {3833#(<= 1 main_~a~0)} #87#return; {3833#(<= 1 main_~a~0)} is VALID [2022-04-28 12:21:21,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,957 INFO L272 TraceCheckUtils]: 28: Hoare triple {3833#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {3814#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3833#(<= 1 main_~a~0)} is VALID [2022-04-28 12:21:21,958 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3744#true} {3814#(<= 1 main_~x~0)} #85#return; {3814#(<= 1 main_~x~0)} is VALID [2022-04-28 12:21:21,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,958 INFO L272 TraceCheckUtils]: 22: Hoare triple {3814#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,959 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3807#(not (= |assume_abort_if_not_#in~cond| 0))} {3744#true} #83#return; {3814#(<= 1 main_~x~0)} is VALID [2022-04-28 12:21:21,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {3807#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3807#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:21:21,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {4109#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3807#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:21:21,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {3744#true} ~cond := #in~cond; {4109#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 12:21:21,960 INFO L272 TraceCheckUtils]: 17: Hoare triple {3744#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,960 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3744#true} {3744#true} #81#return; {3744#true} is VALID [2022-04-28 12:21:21,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,960 INFO L272 TraceCheckUtils]: 12: Hoare triple {3744#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {3744#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3744#true} is VALID [2022-04-28 12:21:21,960 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3744#true} {3744#true} #79#return; {3744#true} is VALID [2022-04-28 12:21:21,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 12:21:21,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 12:21:21,960 INFO L272 TraceCheckUtils]: 6: Hoare triple {3744#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {3744#true} is VALID [2022-04-28 12:21:21,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {3744#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3744#true} is VALID [2022-04-28 12:21:21,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {3744#true} call #t~ret6 := main(); {3744#true} is VALID [2022-04-28 12:21:21,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3744#true} #103#return; {3744#true} is VALID [2022-04-28 12:21:21,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 12:21:21,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#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(11, 2);call #Ultimate.allocInit(12, 3); {3744#true} is VALID [2022-04-28 12:21:21,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3744#true} is VALID [2022-04-28 12:21:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 12:21:21,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:21:21,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797594909] [2022-04-28 12:21:21,961 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:21:21,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569011343] [2022-04-28 12:21:21,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569011343] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:21:21,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:21:21,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 12:21:21,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:21:21,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [851989196] [2022-04-28 12:21:21,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [851989196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:21:21,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:21:21,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:21:21,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956867779] [2022-04-28 12:21:21,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:21:21,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 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 69 [2022-04-28 12:21:21,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:21:21,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 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-28 12:21:21,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:21,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:21:21,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:21,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:21:21,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:21:21,995 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 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-28 12:21:22,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:22,666 INFO L93 Difference]: Finished difference Result 106 states and 146 transitions. [2022-04-28 12:21:22,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:21:22,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 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 69 [2022-04-28 12:21:22,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:21:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 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-28 12:21:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2022-04-28 12:21:22,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 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-28 12:21:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2022-04-28 12:21:22,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 110 transitions. [2022-04-28 12:21:22,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:22,749 INFO L225 Difference]: With dead ends: 106 [2022-04-28 12:21:22,749 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 12:21:22,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:21:22,750 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 30 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:21:22,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 259 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:21:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 12:21:22,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2022-04-28 12:21:22,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:21:22,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 12:21:22,853 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 12:21:22,853 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 12:21:22,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:22,856 INFO L93 Difference]: Finished difference Result 98 states and 137 transitions. [2022-04-28 12:21:22,856 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2022-04-28 12:21:22,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:22,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:22,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 98 states. [2022-04-28 12:21:22,857 INFO L87 Difference]: Start difference. First operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 98 states. [2022-04-28 12:21:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:22,860 INFO L93 Difference]: Finished difference Result 98 states and 137 transitions. [2022-04-28 12:21:22,860 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2022-04-28 12:21:22,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:22,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:22,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:21:22,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:21:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 12:21:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 122 transitions. [2022-04-28 12:21:22,864 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 122 transitions. Word has length 69 [2022-04-28 12:21:22,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:21:22,864 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 122 transitions. [2022-04-28 12:21:22,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 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-28 12:21:22,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 122 transitions. [2022-04-28 12:21:23,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:23,025 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 122 transitions. [2022-04-28 12:21:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 12:21:23,026 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:21:23,026 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:21:23,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 12:21:23,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:21:23,227 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:21:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:21:23,227 INFO L85 PathProgramCache]: Analyzing trace with hash 376741854, now seen corresponding path program 1 times [2022-04-28 12:21:23,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:23,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2081169048] [2022-04-28 12:21:23,228 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:21:23,228 INFO L85 PathProgramCache]: Analyzing trace with hash 376741854, now seen corresponding path program 2 times [2022-04-28 12:21:23,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:21:23,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643782865] [2022-04-28 12:21:23,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:21:23,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:21:23,249 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:21:23,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [763959020] [2022-04-28 12:21:23,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:21:23,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:21:23,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:21:23,250 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:21:23,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 12:21:23,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:21:23,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:21:23,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 12:21:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:21:23,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:21:23,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {4762#true} call ULTIMATE.init(); {4762#true} is VALID [2022-04-28 12:21:23,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {4762#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(11, 2);call #Ultimate.allocInit(12, 3); {4762#true} is VALID [2022-04-28 12:21:23,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:23,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4762#true} #103#return; {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {4762#true} call #t~ret6 := main(); {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {4762#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L272 TraceCheckUtils]: 6: Hoare triple {4762#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4762#true} {4762#true} #79#return; {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {4762#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L272 TraceCheckUtils]: 12: Hoare triple {4762#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4762#true} {4762#true} #81#return; {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L272 TraceCheckUtils]: 17: Hoare triple {4762#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:23,541 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4762#true} {4762#true} #83#return; {4762#true} is VALID [2022-04-28 12:21:23,542 INFO L272 TraceCheckUtils]: 22: Hoare triple {4762#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:23,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:23,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:23,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:23,542 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4762#true} {4762#true} #85#return; {4762#true} is VALID [2022-04-28 12:21:23,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {4762#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:21:23,555 INFO L272 TraceCheckUtils]: 28: Hoare triple {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:23,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:23,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:23,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:23,556 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4762#true} {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #87#return; {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:21:23,556 INFO L272 TraceCheckUtils]: 33: Hoare triple {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:23,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:23,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:23,556 INFO L290 TraceCheckUtils]: 36: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:23,557 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4762#true} {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #89#return; {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:21:23,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:21:23,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4885#(= main_~q~0 0)} is VALID [2022-04-28 12:21:23,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {4885#(= main_~q~0 0)} assume !false; {4885#(= main_~q~0 0)} is VALID [2022-04-28 12:21:23,558 INFO L272 TraceCheckUtils]: 41: Hoare triple {4885#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:23,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:23,558 INFO L290 TraceCheckUtils]: 43: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:23,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:23,558 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4762#true} {4885#(= main_~q~0 0)} #91#return; {4885#(= main_~q~0 0)} is VALID [2022-04-28 12:21:23,558 INFO L272 TraceCheckUtils]: 46: Hoare triple {4885#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:23,558 INFO L290 TraceCheckUtils]: 47: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:23,558 INFO L290 TraceCheckUtils]: 48: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:23,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:23,559 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4762#true} {4885#(= main_~q~0 0)} #93#return; {4885#(= main_~q~0 0)} is VALID [2022-04-28 12:21:23,559 INFO L272 TraceCheckUtils]: 51: Hoare triple {4885#(= main_~q~0 0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:23,559 INFO L290 TraceCheckUtils]: 52: Hoare triple {4762#true} ~cond := #in~cond; {4925#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:21:23,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {4925#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:21:23,560 INFO L290 TraceCheckUtils]: 54: Hoare triple {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:21:23,561 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} {4885#(= main_~q~0 0)} #95#return; {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-28 12:21:23,561 INFO L272 TraceCheckUtils]: 56: Hoare triple {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:23,561 INFO L290 TraceCheckUtils]: 57: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:23,561 INFO L290 TraceCheckUtils]: 58: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:23,561 INFO L290 TraceCheckUtils]: 59: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:23,562 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4762#true} {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} #97#return; {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-28 12:21:23,562 INFO L290 TraceCheckUtils]: 61: Hoare triple {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} assume !(~c~0 >= ~b~0); {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-28 12:21:23,562 INFO L290 TraceCheckUtils]: 62: Hoare triple {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:21:23,563 INFO L290 TraceCheckUtils]: 63: Hoare triple {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:21:23,563 INFO L290 TraceCheckUtils]: 64: Hoare triple {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:21:23,573 INFO L290 TraceCheckUtils]: 65: Hoare triple {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:21:23,573 INFO L272 TraceCheckUtils]: 66: Hoare triple {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:23,573 INFO L290 TraceCheckUtils]: 67: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:23,573 INFO L290 TraceCheckUtils]: 68: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:23,573 INFO L290 TraceCheckUtils]: 69: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:23,574 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4762#true} {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #91#return; {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:21:23,575 INFO L272 TraceCheckUtils]: 71: Hoare triple {4958#(and (= main_~p~0 0) (= 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)); {4986#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:21:23,575 INFO L290 TraceCheckUtils]: 72: Hoare triple {4986#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4990#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:21:23,575 INFO L290 TraceCheckUtils]: 73: Hoare triple {4990#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4763#false} is VALID [2022-04-28 12:21:23,575 INFO L290 TraceCheckUtils]: 74: Hoare triple {4763#false} assume !false; {4763#false} is VALID [2022-04-28 12:21:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 12:21:23,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:21:36,348 INFO L290 TraceCheckUtils]: 74: Hoare triple {4763#false} assume !false; {4763#false} is VALID [2022-04-28 12:21:36,349 INFO L290 TraceCheckUtils]: 73: Hoare triple {4990#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4763#false} is VALID [2022-04-28 12:21:36,349 INFO L290 TraceCheckUtils]: 72: Hoare triple {4986#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4990#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:21:36,350 INFO L272 TraceCheckUtils]: 71: Hoare triple {5006#(= 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)); {4986#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:21:36,350 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4762#true} {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #91#return; {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:21:36,350 INFO L290 TraceCheckUtils]: 69: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:36,350 INFO L290 TraceCheckUtils]: 68: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:36,350 INFO L290 TraceCheckUtils]: 67: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:36,350 INFO L272 TraceCheckUtils]: 66: Hoare triple {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:36,353 INFO L290 TraceCheckUtils]: 65: Hoare triple {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:21:36,353 INFO L290 TraceCheckUtils]: 64: Hoare triple {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:21:36,354 INFO L290 TraceCheckUtils]: 63: Hoare triple {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:21:36,354 INFO L290 TraceCheckUtils]: 62: Hoare triple {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:21:36,354 INFO L290 TraceCheckUtils]: 61: Hoare triple {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:21:36,357 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4762#true} {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #97#return; {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:21:36,357 INFO L290 TraceCheckUtils]: 59: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:36,357 INFO L290 TraceCheckUtils]: 58: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:36,357 INFO L290 TraceCheckUtils]: 57: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:36,357 INFO L272 TraceCheckUtils]: 56: Hoare triple {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:36,358 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} {4762#true} #95#return; {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:21:36,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:21:36,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {5065#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:21:36,359 INFO L290 TraceCheckUtils]: 52: Hoare triple {4762#true} ~cond := #in~cond; {5065#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:21:36,359 INFO L272 TraceCheckUtils]: 51: Hoare triple {4762#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:36,359 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4762#true} {4762#true} #93#return; {4762#true} is VALID [2022-04-28 12:21:36,359 INFO L290 TraceCheckUtils]: 49: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:36,359 INFO L290 TraceCheckUtils]: 48: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:36,359 INFO L290 TraceCheckUtils]: 47: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:36,359 INFO L272 TraceCheckUtils]: 46: Hoare triple {4762#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:36,359 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4762#true} {4762#true} #91#return; {4762#true} is VALID [2022-04-28 12:21:36,359 INFO L290 TraceCheckUtils]: 44: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:36,359 INFO L290 TraceCheckUtils]: 43: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:36,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:36,359 INFO L272 TraceCheckUtils]: 41: Hoare triple {4762#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:36,359 INFO L290 TraceCheckUtils]: 40: Hoare triple {4762#true} assume !false; {4762#true} is VALID [2022-04-28 12:21:36,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {4762#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4762#true} is VALID [2022-04-28 12:21:36,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {4762#true} assume !false; {4762#true} is VALID [2022-04-28 12:21:36,359 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4762#true} {4762#true} #89#return; {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L272 TraceCheckUtils]: 33: Hoare triple {4762#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4762#true} {4762#true} #87#return; {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L272 TraceCheckUtils]: 28: Hoare triple {4762#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {4762#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4762#true} {4762#true} #85#return; {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L272 TraceCheckUtils]: 22: Hoare triple {4762#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4762#true} {4762#true} #83#return; {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:36,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L272 TraceCheckUtils]: 17: Hoare triple {4762#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4762#true} {4762#true} #81#return; {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L272 TraceCheckUtils]: 12: Hoare triple {4762#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {4762#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4762#true} {4762#true} #79#return; {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L272 TraceCheckUtils]: 6: Hoare triple {4762#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {4762#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {4762#true} call #t~ret6 := main(); {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4762#true} #103#return; {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {4762#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(11, 2);call #Ultimate.allocInit(12, 3); {4762#true} is VALID [2022-04-28 12:21:36,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {4762#true} call ULTIMATE.init(); {4762#true} is VALID [2022-04-28 12:21:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 12:21:36,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:21:36,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643782865] [2022-04-28 12:21:36,362 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:21:36,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763959020] [2022-04-28 12:21:36,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763959020] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:21:36,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:21:36,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-28 12:21:36,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:21:36,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2081169048] [2022-04-28 12:21:36,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2081169048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:21:36,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:21:36,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 12:21:36,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366453207] [2022-04-28 12:21:36,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:21:36,363 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 75 [2022-04-28 12:21:36,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:21:36,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 12:21:36,399 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-28 12:21:36,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 12:21:36,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:36,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 12:21:36,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-28 12:21:36,400 INFO L87 Difference]: Start difference. First operand 89 states and 122 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 12:21:37,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:37,259 INFO L93 Difference]: Finished difference Result 124 states and 173 transitions. [2022-04-28 12:21:37,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:21:37,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 75 [2022-04-28 12:21:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:21:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 12:21:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-28 12:21:37,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 12:21:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-28 12:21:37,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2022-04-28 12:21:37,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:37,337 INFO L225 Difference]: With dead ends: 124 [2022-04-28 12:21:37,337 INFO L226 Difference]: Without dead ends: 121 [2022-04-28 12:21:37,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-04-28 12:21:37,338 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 23 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 12:21:37,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 218 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 12:21:37,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-28 12:21:37,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2022-04-28 12:21:37,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:21:37,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 12:21:37,502 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 12:21:37,502 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 12:21:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:37,506 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2022-04-28 12:21:37,506 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2022-04-28 12:21:37,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:37,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:37,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 121 states. [2022-04-28 12:21:37,507 INFO L87 Difference]: Start difference. First operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 121 states. [2022-04-28 12:21:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:37,510 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2022-04-28 12:21:37,510 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2022-04-28 12:21:37,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:37,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:37,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:21:37,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:21:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 12:21:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2022-04-28 12:21:37,514 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 75 [2022-04-28 12:21:37,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:21:37,515 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2022-04-28 12:21:37,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 12:21:37,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 166 transitions. [2022-04-28 12:21:37,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2022-04-28 12:21:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 12:21:37,737 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:21:37,737 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:21:37,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 12:21:37,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 12:21:37,948 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:21:37,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:21:37,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1245952186, now seen corresponding path program 3 times [2022-04-28 12:21:37,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:37,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [54561518] [2022-04-28 12:21:37,949 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:21:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1245952186, now seen corresponding path program 4 times [2022-04-28 12:21:37,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:21:37,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072300634] [2022-04-28 12:21:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:21:37,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:21:37,971 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:21:37,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1043258678] [2022-04-28 12:21:37,971 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:21:37,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:21:37,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:21:37,976 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:21:37,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 12:21:38,019 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:21:38,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:21:38,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-28 12:21:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:21:38,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:21:39,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {5956#true} call ULTIMATE.init(); {5956#true} is VALID [2022-04-28 12:21:39,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {5956#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(11, 2);call #Ultimate.allocInit(12, 3); {5956#true} is VALID [2022-04-28 12:21:39,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:21:39,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5956#true} {5956#true} #103#return; {5956#true} is VALID [2022-04-28 12:21:39,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {5956#true} call #t~ret6 := main(); {5956#true} is VALID [2022-04-28 12:21:39,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {5956#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5956#true} is VALID [2022-04-28 12:21:39,097 INFO L272 TraceCheckUtils]: 6: Hoare triple {5956#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:21:39,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:21:39,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:21:39,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:21:39,098 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5956#true} {5956#true} #79#return; {5956#true} is VALID [2022-04-28 12:21:39,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {5956#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5956#true} is VALID [2022-04-28 12:21:39,098 INFO L272 TraceCheckUtils]: 12: Hoare triple {5956#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:21:39,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {5956#true} ~cond := #in~cond; {6000#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:21:39,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {6000#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6004#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:21:39,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {6004#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6004#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:21:39,099 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6004#(not (= |assume_abort_if_not_#in~cond| 0))} {5956#true} #81#return; {6011#(and (<= 0 main_~y~0) (<= main_~y~0 10))} is VALID [2022-04-28 12:21:39,099 INFO L272 TraceCheckUtils]: 17: Hoare triple {6011#(and (<= 0 main_~y~0) (<= main_~y~0 10))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:21:39,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {5956#true} ~cond := #in~cond; {6000#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:21:39,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {6000#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6004#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:21:39,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {6004#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6004#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:21:39,100 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6004#(not (= |assume_abort_if_not_#in~cond| 0))} {6011#(and (<= 0 main_~y~0) (<= main_~y~0 10))} #83#return; {6027#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10))} is VALID [2022-04-28 12:21:39,100 INFO L272 TraceCheckUtils]: 22: Hoare triple {6027#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:21:39,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:21:39,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:21:39,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:21:39,107 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5956#true} {6027#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10))} #85#return; {6027#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10))} is VALID [2022-04-28 12:21:39,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {6027#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:21:39,108 INFO L272 TraceCheckUtils]: 28: Hoare triple {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= 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 assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:21:39,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:21:39,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:21:39,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:21:39,109 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5956#true} {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:21:39,109 INFO L272 TraceCheckUtils]: 33: Hoare triple {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= 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 assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:21:39,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:21:39,109 INFO L290 TraceCheckUtils]: 35: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:21:39,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:21:39,109 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5956#true} {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:21:39,110 INFO L290 TraceCheckUtils]: 38: Hoare triple {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= 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; {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:21:39,110 INFO L290 TraceCheckUtils]: 39: Hoare triple {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= 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 !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:21:39,111 INFO L290 TraceCheckUtils]: 40: Hoare triple {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:21:39,111 INFO L272 TraceCheckUtils]: 41: Hoare triple {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:21:39,111 INFO L290 TraceCheckUtils]: 42: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:21:39,111 INFO L290 TraceCheckUtils]: 43: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:21:39,111 INFO L290 TraceCheckUtils]: 44: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:21:39,111 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5956#true} {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #91#return; {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:21:39,111 INFO L272 TraceCheckUtils]: 46: Hoare triple {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~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)); {5956#true} is VALID [2022-04-28 12:21:39,111 INFO L290 TraceCheckUtils]: 47: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:21:39,112 INFO L290 TraceCheckUtils]: 48: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:21:39,112 INFO L290 TraceCheckUtils]: 49: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:21:39,112 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5956#true} {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #93#return; {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:21:39,112 INFO L272 TraceCheckUtils]: 51: Hoare triple {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~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)); {5956#true} is VALID [2022-04-28 12:21:39,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {5956#true} ~cond := #in~cond; {6123#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:21:39,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {6123#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:21:39,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:21:39,114 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #95#return; {6134#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:21:39,114 INFO L272 TraceCheckUtils]: 56: Hoare triple {6134#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:21:39,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:21:39,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:21:39,114 INFO L290 TraceCheckUtils]: 59: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:21:39,115 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5956#true} {6134#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #97#return; {6134#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:21:39,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {6134#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {6153#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (< main_~c~0 main_~b~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:21:39,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {6153#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (< main_~c~0 main_~b~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1))} is VALID [2022-04-28 12:21:39,116 INFO L290 TraceCheckUtils]: 63: Hoare triple {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1))} assume !false; {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1))} is VALID [2022-04-28 12:21:39,117 INFO L290 TraceCheckUtils]: 64: Hoare triple {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1))} is VALID [2022-04-28 12:21:39,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1))} assume !false; {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1))} is VALID [2022-04-28 12:21:39,117 INFO L272 TraceCheckUtils]: 66: Hoare triple {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:21:39,117 INFO L290 TraceCheckUtils]: 67: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:21:39,117 INFO L290 TraceCheckUtils]: 68: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:21:39,117 INFO L290 TraceCheckUtils]: 69: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:21:39,118 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {5956#true} {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1))} #91#return; {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1))} is VALID [2022-04-28 12:21:39,118 INFO L272 TraceCheckUtils]: 71: Hoare triple {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:21:39,118 INFO L290 TraceCheckUtils]: 72: Hoare triple {5956#true} ~cond := #in~cond; {6123#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:21:39,118 INFO L290 TraceCheckUtils]: 73: Hoare triple {6123#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:21:39,119 INFO L290 TraceCheckUtils]: 74: Hoare triple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:21:39,120 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1))} #93#return; {6197#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 12:21:39,120 INFO L272 TraceCheckUtils]: 76: Hoare triple {6197#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 10) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:21:39,121 INFO L290 TraceCheckUtils]: 77: Hoare triple {6201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:21:39,121 INFO L290 TraceCheckUtils]: 78: Hoare triple {6205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5957#false} is VALID [2022-04-28 12:21:39,121 INFO L290 TraceCheckUtils]: 79: Hoare triple {5957#false} assume !false; {5957#false} is VALID [2022-04-28 12:21:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 34 proven. 32 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 12:21:39,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:22:08,928 INFO L290 TraceCheckUtils]: 79: Hoare triple {5957#false} assume !false; {5957#false} is VALID [2022-04-28 12:22:08,929 INFO L290 TraceCheckUtils]: 78: Hoare triple {6205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5957#false} is VALID [2022-04-28 12:22:08,929 INFO L290 TraceCheckUtils]: 77: Hoare triple {6201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:22:08,930 INFO L272 TraceCheckUtils]: 76: Hoare triple {6221#(= 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)); {6201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:22:08,930 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} {6225#(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)))))} #93#return; {6221#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:22:08,931 INFO L290 TraceCheckUtils]: 74: Hoare triple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:22:08,931 INFO L290 TraceCheckUtils]: 73: Hoare triple {6235#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:22:08,931 INFO L290 TraceCheckUtils]: 72: Hoare triple {5956#true} ~cond := #in~cond; {6235#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:22:08,931 INFO L272 TraceCheckUtils]: 71: Hoare triple {6225#(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)); {5956#true} is VALID [2022-04-28 12:22:08,932 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {5956#true} {6225#(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)))))} #91#return; {6225#(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-28 12:22:08,932 INFO L290 TraceCheckUtils]: 69: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:22:08,932 INFO L290 TraceCheckUtils]: 68: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:22:08,932 INFO L290 TraceCheckUtils]: 67: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:22:08,932 INFO L272 TraceCheckUtils]: 66: Hoare triple {6225#(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 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:22:08,933 INFO L290 TraceCheckUtils]: 65: Hoare triple {6225#(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; {6225#(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-28 12:22:08,933 INFO L290 TraceCheckUtils]: 64: Hoare triple {6260#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6225#(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-28 12:22:08,933 INFO L290 TraceCheckUtils]: 63: Hoare triple {6260#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {6260#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-28 12:22:09,055 INFO L290 TraceCheckUtils]: 62: Hoare triple {6267#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~c~0 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6260#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-28 12:22:09,056 INFO L290 TraceCheckUtils]: 61: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} assume !(~c~0 >= ~b~0); {6267#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~c~0 0))} is VALID [2022-04-28 12:22:09,056 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5956#true} {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} #97#return; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-28 12:22:09,056 INFO L290 TraceCheckUtils]: 59: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:22:09,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:22:09,057 INFO L290 TraceCheckUtils]: 57: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:22:09,057 INFO L272 TraceCheckUtils]: 56: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:22:09,057 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5956#true} {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} #95#return; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-28 12:22:09,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:22:09,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:22:09,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:22:09,057 INFO L272 TraceCheckUtils]: 51: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:22:09,058 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5956#true} {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} #93#return; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-28 12:22:09,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:22:09,058 INFO L290 TraceCheckUtils]: 48: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:22:09,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:22:09,058 INFO L272 TraceCheckUtils]: 46: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:22:09,059 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5956#true} {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} #91#return; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-28 12:22:09,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:22:09,059 INFO L290 TraceCheckUtils]: 43: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:22:09,059 INFO L290 TraceCheckUtils]: 42: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:22:09,059 INFO L272 TraceCheckUtils]: 41: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:22:09,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} assume !false; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-28 12:22:09,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-28 12:22:09,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} assume !false; {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-28 12:22:09,061 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5956#true} {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} #89#return; {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-28 12:22:09,061 INFO L290 TraceCheckUtils]: 36: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:22:09,061 INFO L290 TraceCheckUtils]: 35: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:22:09,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:22:09,061 INFO L272 TraceCheckUtils]: 33: Hoare triple {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:22:09,062 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5956#true} {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} #87#return; {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-28 12:22:09,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:22:09,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:22:09,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:22:09,062 INFO L272 TraceCheckUtils]: 28: Hoare triple {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:22:09,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {5956#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-28 12:22:09,062 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5956#true} {5956#true} #85#return; {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L272 TraceCheckUtils]: 22: Hoare triple {5956#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5956#true} {5956#true} #83#return; {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L272 TraceCheckUtils]: 17: Hoare triple {5956#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5956#true} {5956#true} #81#return; {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L272 TraceCheckUtils]: 12: Hoare triple {5956#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {5956#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5956#true} {5956#true} #79#return; {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 12:22:09,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 12:22:09,064 INFO L272 TraceCheckUtils]: 6: Hoare triple {5956#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {5956#true} is VALID [2022-04-28 12:22:09,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {5956#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5956#true} is VALID [2022-04-28 12:22:09,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {5956#true} call #t~ret6 := main(); {5956#true} is VALID [2022-04-28 12:22:09,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5956#true} {5956#true} #103#return; {5956#true} is VALID [2022-04-28 12:22:09,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 12:22:09,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {5956#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(11, 2);call #Ultimate.allocInit(12, 3); {5956#true} is VALID [2022-04-28 12:22:09,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {5956#true} call ULTIMATE.init(); {5956#true} is VALID [2022-04-28 12:22:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 12:22:09,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:22:09,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072300634] [2022-04-28 12:22:09,064 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:22:09,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043258678] [2022-04-28 12:22:09,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043258678] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:22:09,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:22:09,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 23 [2022-04-28 12:22:09,065 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:22:09,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [54561518] [2022-04-28 12:22:09,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [54561518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:22:09,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:22:09,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 12:22:09,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609691888] [2022-04-28 12:22:09,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:22:09,065 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Word has length 80 [2022-04-28 12:22:09,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:22:09,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-28 12:22:09,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:22:09,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 12:22:09,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:22:09,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 12:22:09,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-04-28 12:22:09,109 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-28 12:22:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:22:10,931 INFO L93 Difference]: Finished difference Result 134 states and 179 transitions. [2022-04-28 12:22:10,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 12:22:10,931 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Word has length 80 [2022-04-28 12:22:10,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:22:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-28 12:22:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 91 transitions. [2022-04-28 12:22:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-28 12:22:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 91 transitions. [2022-04-28 12:22:10,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 91 transitions. [2022-04-28 12:22:11,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:22:11,032 INFO L225 Difference]: With dead ends: 134 [2022-04-28 12:22:11,032 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 12:22:11,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2022-04-28 12:22:11,033 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 66 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 12:22:11,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 157 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 12:22:11,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 12:22:11,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2022-04-28 12:22:11,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:22:11,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 12:22:11,278 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 12:22:11,279 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 12:22:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:22:11,281 INFO L93 Difference]: Finished difference Result 132 states and 177 transitions. [2022-04-28 12:22:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 177 transitions. [2022-04-28 12:22:11,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:22:11,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:22:11,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 132 states. [2022-04-28 12:22:11,282 INFO L87 Difference]: Start difference. First operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 132 states. [2022-04-28 12:22:11,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:22:11,285 INFO L93 Difference]: Finished difference Result 132 states and 177 transitions. [2022-04-28 12:22:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 177 transitions. [2022-04-28 12:22:11,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:22:11,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:22:11,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:22:11,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:22:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 12:22:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 175 transitions. [2022-04-28 12:22:11,288 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 175 transitions. Word has length 80 [2022-04-28 12:22:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:22:11,288 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 175 transitions. [2022-04-28 12:22:11,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-28 12:22:11,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 175 transitions. [2022-04-28 12:22:11,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:22:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 175 transitions. [2022-04-28 12:22:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 12:22:11,551 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:22:11,551 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:22:11,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 12:22:11,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 12:22:11,752 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:22:11,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:22:11,753 INFO L85 PathProgramCache]: Analyzing trace with hash 901388446, now seen corresponding path program 5 times [2022-04-28 12:22:11,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:22:11,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [513523425] [2022-04-28 12:22:11,753 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:22:11,753 INFO L85 PathProgramCache]: Analyzing trace with hash 901388446, now seen corresponding path program 6 times [2022-04-28 12:22:11,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:22:11,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789629089] [2022-04-28 12:22:11,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:22:11,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:22:11,765 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:22:11,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1783117839] [2022-04-28 12:22:11,765 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:22:11,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:22:11,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:22:11,769 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:22:11,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 12:22:11,834 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 12:22:11,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:22:11,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 12:22:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:22:11,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:22:16,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {7262#true} call ULTIMATE.init(); {7262#true} is VALID [2022-04-28 12:22:16,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {7262#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(11, 2);call #Ultimate.allocInit(12, 3); {7262#true} is VALID [2022-04-28 12:22:16,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 12:22:16,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7262#true} {7262#true} #103#return; {7262#true} is VALID [2022-04-28 12:22:16,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {7262#true} call #t~ret6 := main(); {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {7262#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L272 TraceCheckUtils]: 6: Hoare triple {7262#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7262#true} {7262#true} #79#return; {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {7262#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L272 TraceCheckUtils]: 12: Hoare triple {7262#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7262#true} {7262#true} #81#return; {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L272 TraceCheckUtils]: 17: Hoare triple {7262#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7262#true} {7262#true} #83#return; {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L272 TraceCheckUtils]: 22: Hoare triple {7262#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7262#true} is VALID [2022-04-28 12:22:16,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 12:22:16,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 12:22:16,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 12:22:16,611 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7262#true} {7262#true} #85#return; {7262#true} is VALID [2022-04-28 12:22:16,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {7262#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:22:16,611 INFO L272 TraceCheckUtils]: 28: Hoare triple {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7262#true} is VALID [2022-04-28 12:22:16,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 12:22:16,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 12:22:16,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 12:22:16,612 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7262#true} {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #87#return; {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:22:16,612 INFO L272 TraceCheckUtils]: 33: Hoare triple {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7262#true} is VALID [2022-04-28 12:22:16,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 12:22:16,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 12:22:16,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 12:22:16,613 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7262#true} {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #89#return; {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:22:16,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !false; {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:22:16,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7385#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:22:16,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {7385#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !false; {7385#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:22:16,614 INFO L272 TraceCheckUtils]: 41: Hoare triple {7385#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7262#true} is VALID [2022-04-28 12:22:16,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 12:22:16,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 12:22:16,614 INFO L290 TraceCheckUtils]: 44: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 12:22:16,615 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7262#true} {7385#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #91#return; {7385#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:22:16,615 INFO L272 TraceCheckUtils]: 46: Hoare triple {7385#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~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)); {7262#true} is VALID [2022-04-28 12:22:16,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {7262#true} ~cond := #in~cond; {7410#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:22:16,615 INFO L290 TraceCheckUtils]: 48: Hoare triple {7410#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7414#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:22:16,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {7414#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7414#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:22:16,617 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7414#(not (= |__VERIFIER_assert_#in~cond| 0))} {7385#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #93#return; {7421#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:22:16,617 INFO L272 TraceCheckUtils]: 51: Hoare triple {7421#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7262#true} is VALID [2022-04-28 12:22:16,617 INFO L290 TraceCheckUtils]: 52: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 12:22:16,617 INFO L290 TraceCheckUtils]: 53: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 12:22:16,617 INFO L290 TraceCheckUtils]: 54: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 12:22:16,617 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7262#true} {7421#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #95#return; {7421#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:22:16,618 INFO L272 TraceCheckUtils]: 56: Hoare triple {7421#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7262#true} is VALID [2022-04-28 12:22:16,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 12:22:16,618 INFO L290 TraceCheckUtils]: 58: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 12:22:16,618 INFO L290 TraceCheckUtils]: 59: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 12:22:16,624 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7262#true} {7421#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #97#return; {7421#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:22:16,624 INFO L290 TraceCheckUtils]: 61: Hoare triple {7421#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {7421#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:22:16,626 INFO L290 TraceCheckUtils]: 62: Hoare triple {7421#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {7458#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~a~0 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:22:16,627 INFO L290 TraceCheckUtils]: 63: Hoare triple {7458#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~a~0 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {7458#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~a~0 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:22:16,628 INFO L290 TraceCheckUtils]: 64: Hoare triple {7458#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~a~0 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7465#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:22:16,629 INFO L290 TraceCheckUtils]: 65: Hoare triple {7465#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {7465#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:22:16,629 INFO L272 TraceCheckUtils]: 66: Hoare triple {7465#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7262#true} is VALID [2022-04-28 12:22:16,629 INFO L290 TraceCheckUtils]: 67: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 12:22:16,629 INFO L290 TraceCheckUtils]: 68: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 12:22:16,629 INFO L290 TraceCheckUtils]: 69: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 12:22:16,630 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {7262#true} {7465#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {7465#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:22:16,630 INFO L272 TraceCheckUtils]: 71: Hoare triple {7465#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7262#true} is VALID [2022-04-28 12:22:16,631 INFO L290 TraceCheckUtils]: 72: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 12:22:16,631 INFO L290 TraceCheckUtils]: 73: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 12:22:16,631 INFO L290 TraceCheckUtils]: 74: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 12:22:16,631 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {7262#true} {7465#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {7465#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:22:16,631 INFO L272 TraceCheckUtils]: 76: Hoare triple {7465#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7262#true} is VALID [2022-04-28 12:22:16,634 INFO L290 TraceCheckUtils]: 77: Hoare triple {7262#true} ~cond := #in~cond; {7410#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:22:16,634 INFO L290 TraceCheckUtils]: 78: Hoare triple {7410#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7414#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:22:16,635 INFO L290 TraceCheckUtils]: 79: Hoare triple {7414#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7414#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:22:16,635 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7414#(not (= |__VERIFIER_assert_#in~cond| 0))} {7465#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {7465#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:22:16,638 INFO L272 TraceCheckUtils]: 81: Hoare triple {7465#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7517#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:22:16,638 INFO L290 TraceCheckUtils]: 82: Hoare triple {7517#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7521#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:22:16,638 INFO L290 TraceCheckUtils]: 83: Hoare triple {7521#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7263#false} is VALID [2022-04-28 12:22:16,638 INFO L290 TraceCheckUtils]: 84: Hoare triple {7263#false} assume !false; {7263#false} is VALID [2022-04-28 12:22:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-04-28 12:22:16,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:23:08,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:23:08,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789629089] [2022-04-28 12:23:08,569 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:23:08,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783117839] [2022-04-28 12:23:08,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783117839] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 12:23:08,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:23:08,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 12:23:08,569 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:23:08,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [513523425] [2022-04-28 12:23:08,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [513523425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:23:08,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:23:08,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 12:23:08,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171078206] [2022-04-28 12:23:08,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:23:08,569 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 85 [2022-04-28 12:23:08,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:23:08,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 12:23:08,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:23:08,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 12:23:08,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:23:08,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 12:23:08,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-28 12:23:08,620 INFO L87 Difference]: Start difference. First operand 130 states and 175 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 12:23:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:23:09,924 INFO L93 Difference]: Finished difference Result 138 states and 182 transitions. [2022-04-28 12:23:09,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 12:23:09,924 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 85 [2022-04-28 12:23:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:23:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 12:23:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-28 12:23:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 12:23:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-28 12:23:09,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 91 transitions. [2022-04-28 12:23:10,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:23:10,021 INFO L225 Difference]: With dead ends: 138 [2022-04-28 12:23:10,021 INFO L226 Difference]: Without dead ends: 136 [2022-04-28 12:23:10,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-04-28 12:23:10,021 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 25 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 12:23:10,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 210 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 12:23:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-28 12:23:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2022-04-28 12:23:10,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:23:10,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 134 states, 74 states have (on average 1.1756756756756757) internal successors, (87), 76 states have internal predecessors, (87), 47 states have call successors, (47), 13 states have call predecessors, (47), 12 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 12:23:10,252 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 134 states, 74 states have (on average 1.1756756756756757) internal successors, (87), 76 states have internal predecessors, (87), 47 states have call successors, (47), 13 states have call predecessors, (47), 12 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 12:23:10,256 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 134 states, 74 states have (on average 1.1756756756756757) internal successors, (87), 76 states have internal predecessors, (87), 47 states have call successors, (47), 13 states have call predecessors, (47), 12 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 12:23:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:23:10,259 INFO L93 Difference]: Finished difference Result 136 states and 180 transitions. [2022-04-28 12:23:10,259 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 180 transitions. [2022-04-28 12:23:10,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:23:10,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:23:10,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 74 states have (on average 1.1756756756756757) internal successors, (87), 76 states have internal predecessors, (87), 47 states have call successors, (47), 13 states have call predecessors, (47), 12 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 136 states. [2022-04-28 12:23:10,260 INFO L87 Difference]: Start difference. First operand has 134 states, 74 states have (on average 1.1756756756756757) internal successors, (87), 76 states have internal predecessors, (87), 47 states have call successors, (47), 13 states have call predecessors, (47), 12 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 136 states. [2022-04-28 12:23:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:23:10,262 INFO L93 Difference]: Finished difference Result 136 states and 180 transitions. [2022-04-28 12:23:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 180 transitions. [2022-04-28 12:23:10,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:23:10,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:23:10,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:23:10,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:23:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 74 states have (on average 1.1756756756756757) internal successors, (87), 76 states have internal predecessors, (87), 47 states have call successors, (47), 13 states have call predecessors, (47), 12 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 12:23:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 178 transitions. [2022-04-28 12:23:10,266 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 178 transitions. Word has length 85 [2022-04-28 12:23:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:23:10,266 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 178 transitions. [2022-04-28 12:23:10,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 12:23:10,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 178 transitions. [2022-04-28 12:23:10,502 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-28 12:23:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 178 transitions. [2022-04-28 12:23:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 12:23:10,503 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:23:10,503 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 6, 6, 6, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:23:10,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 12:23:10,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 12:23:10,711 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:23:10,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:23:10,712 INFO L85 PathProgramCache]: Analyzing trace with hash -686534738, now seen corresponding path program 1 times [2022-04-28 12:23:10,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:23:10,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [889959638] [2022-04-28 12:23:10,712 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:23:10,712 INFO L85 PathProgramCache]: Analyzing trace with hash -686534738, now seen corresponding path program 2 times [2022-04-28 12:23:10,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:23:10,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430126845] [2022-04-28 12:23:10,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:23:10,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:23:10,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:23:10,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1163977990] [2022-04-28 12:23:10,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:23:10,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:23:10,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:23:10,723 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:23:10,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 12:23:10,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:23:10,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:23:10,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 12:23:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:23:10,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:23:11,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {8366#true} call ULTIMATE.init(); {8366#true} is VALID [2022-04-28 12:23:11,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {8366#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(11, 2);call #Ultimate.allocInit(12, 3); {8366#true} is VALID [2022-04-28 12:23:11,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:11,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8366#true} {8366#true} #103#return; {8366#true} is VALID [2022-04-28 12:23:11,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {8366#true} call #t~ret6 := main(); {8366#true} is VALID [2022-04-28 12:23:11,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {8366#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8366#true} is VALID [2022-04-28 12:23:11,315 INFO L272 TraceCheckUtils]: 6: Hoare triple {8366#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:11,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:11,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:11,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:11,315 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8366#true} {8366#true} #79#return; {8366#true} is VALID [2022-04-28 12:23:11,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {8366#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8366#true} is VALID [2022-04-28 12:23:11,315 INFO L272 TraceCheckUtils]: 12: Hoare triple {8366#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:11,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:11,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:11,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:11,316 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8366#true} {8366#true} #81#return; {8366#true} is VALID [2022-04-28 12:23:11,316 INFO L272 TraceCheckUtils]: 17: Hoare triple {8366#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:11,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:11,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:11,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:11,316 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8366#true} {8366#true} #83#return; {8366#true} is VALID [2022-04-28 12:23:11,316 INFO L272 TraceCheckUtils]: 22: Hoare triple {8366#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:11,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:11,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:11,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:11,316 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8366#true} {8366#true} #85#return; {8366#true} is VALID [2022-04-28 12:23:11,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {8366#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {8452#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,317 INFO L272 TraceCheckUtils]: 28: Hoare triple {8452#(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 assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:11,317 INFO L290 TraceCheckUtils]: 29: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:11,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:11,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:11,317 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8366#true} {8452#(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))} #87#return; {8452#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,317 INFO L272 TraceCheckUtils]: 33: Hoare triple {8452#(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 assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:11,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:11,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:11,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:11,318 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8366#true} {8452#(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))} #89#return; {8452#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {8452#(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; {8452#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {8452#(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 !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8489#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {8489#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {8489#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,319 INFO L272 TraceCheckUtils]: 41: Hoare triple {8489#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:11,319 INFO L290 TraceCheckUtils]: 42: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:11,319 INFO L290 TraceCheckUtils]: 43: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:11,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:11,320 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8366#true} {8489#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #91#return; {8489#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,320 INFO L272 TraceCheckUtils]: 46: Hoare triple {8489#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~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)); {8366#true} is VALID [2022-04-28 12:23:11,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:11,320 INFO L290 TraceCheckUtils]: 48: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:11,320 INFO L290 TraceCheckUtils]: 49: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:11,321 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8366#true} {8489#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #93#return; {8489#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,321 INFO L272 TraceCheckUtils]: 51: Hoare triple {8489#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~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)); {8366#true} is VALID [2022-04-28 12:23:11,321 INFO L290 TraceCheckUtils]: 52: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:11,321 INFO L290 TraceCheckUtils]: 53: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:11,321 INFO L290 TraceCheckUtils]: 54: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:11,322 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8366#true} {8489#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #95#return; {8489#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,322 INFO L272 TraceCheckUtils]: 56: Hoare triple {8489#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:11,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:11,322 INFO L290 TraceCheckUtils]: 58: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:11,322 INFO L290 TraceCheckUtils]: 59: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:11,323 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8366#true} {8489#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #97#return; {8489#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,323 INFO L290 TraceCheckUtils]: 61: Hoare triple {8489#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,324 INFO L290 TraceCheckUtils]: 62: Hoare triple {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,324 INFO L272 TraceCheckUtils]: 63: Hoare triple {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:11,324 INFO L290 TraceCheckUtils]: 64: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:11,324 INFO L290 TraceCheckUtils]: 65: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:11,324 INFO L290 TraceCheckUtils]: 66: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:11,324 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {8366#true} {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #91#return; {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,324 INFO L272 TraceCheckUtils]: 68: Hoare triple {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~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)); {8366#true} is VALID [2022-04-28 12:23:11,325 INFO L290 TraceCheckUtils]: 69: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:11,325 INFO L290 TraceCheckUtils]: 70: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:11,325 INFO L290 TraceCheckUtils]: 71: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:11,325 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8366#true} {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #93#return; {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,325 INFO L272 TraceCheckUtils]: 73: Hoare triple {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 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)); {8366#true} is VALID [2022-04-28 12:23:11,325 INFO L290 TraceCheckUtils]: 74: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:11,325 INFO L290 TraceCheckUtils]: 75: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:11,325 INFO L290 TraceCheckUtils]: 76: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:11,326 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8366#true} {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #95#return; {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,326 INFO L272 TraceCheckUtils]: 78: Hoare triple {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:11,326 INFO L290 TraceCheckUtils]: 79: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:11,326 INFO L290 TraceCheckUtils]: 80: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:11,326 INFO L290 TraceCheckUtils]: 81: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:11,327 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8366#true} {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #97#return; {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,327 INFO L290 TraceCheckUtils]: 83: Hoare triple {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:11,328 INFO L290 TraceCheckUtils]: 84: Hoare triple {8556#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8626#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 12:23:11,328 INFO L290 TraceCheckUtils]: 85: Hoare triple {8626#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !false; {8626#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 12:23:11,329 INFO L290 TraceCheckUtils]: 86: Hoare triple {8626#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {8633#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 12:23:11,329 INFO L272 TraceCheckUtils]: 87: Hoare triple {8633#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {8637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:23:11,329 INFO L290 TraceCheckUtils]: 88: Hoare triple {8637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:23:11,330 INFO L290 TraceCheckUtils]: 89: Hoare triple {8641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8367#false} is VALID [2022-04-28 12:23:11,330 INFO L290 TraceCheckUtils]: 90: Hoare triple {8367#false} assume !false; {8367#false} is VALID [2022-04-28 12:23:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-28 12:23:11,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:23:11,776 INFO L290 TraceCheckUtils]: 90: Hoare triple {8367#false} assume !false; {8367#false} is VALID [2022-04-28 12:23:11,776 INFO L290 TraceCheckUtils]: 89: Hoare triple {8641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8367#false} is VALID [2022-04-28 12:23:11,776 INFO L290 TraceCheckUtils]: 88: Hoare triple {8637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:23:11,777 INFO L272 TraceCheckUtils]: 87: Hoare triple {8657#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {8637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:23:11,777 INFO L290 TraceCheckUtils]: 86: Hoare triple {8661#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {8657#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-28 12:23:11,777 INFO L290 TraceCheckUtils]: 85: Hoare triple {8661#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !false; {8661#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-28 12:23:12,797 INFO L290 TraceCheckUtils]: 84: Hoare triple {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8661#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-28 12:23:12,797 INFO L290 TraceCheckUtils]: 83: Hoare triple {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= ~b~0); {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:23:12,798 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8366#true} {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #97#return; {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:23:12,798 INFO L290 TraceCheckUtils]: 81: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:12,798 INFO L290 TraceCheckUtils]: 80: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:12,798 INFO L290 TraceCheckUtils]: 79: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:12,798 INFO L272 TraceCheckUtils]: 78: Hoare triple {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:12,799 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8366#true} {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #95#return; {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:23:12,799 INFO L290 TraceCheckUtils]: 76: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:12,799 INFO L290 TraceCheckUtils]: 75: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:12,799 INFO L290 TraceCheckUtils]: 74: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:12,799 INFO L272 TraceCheckUtils]: 73: Hoare triple {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~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)); {8366#true} is VALID [2022-04-28 12:23:12,800 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8366#true} {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #93#return; {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:23:12,800 INFO L290 TraceCheckUtils]: 71: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:12,800 INFO L290 TraceCheckUtils]: 70: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:12,800 INFO L290 TraceCheckUtils]: 69: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:12,800 INFO L272 TraceCheckUtils]: 68: Hoare triple {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~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)); {8366#true} is VALID [2022-04-28 12:23:12,801 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {8366#true} {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #91#return; {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:23:12,801 INFO L290 TraceCheckUtils]: 66: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:12,801 INFO L290 TraceCheckUtils]: 65: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:12,801 INFO L290 TraceCheckUtils]: 64: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:12,801 INFO L272 TraceCheckUtils]: 63: Hoare triple {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:12,801 INFO L290 TraceCheckUtils]: 62: Hoare triple {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:23:13,417 INFO L290 TraceCheckUtils]: 61: Hoare triple {8738#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {8668#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:23:13,418 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8366#true} {8738#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #97#return; {8738#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:23:13,418 INFO L290 TraceCheckUtils]: 59: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:13,418 INFO L290 TraceCheckUtils]: 58: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:13,418 INFO L290 TraceCheckUtils]: 57: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:13,418 INFO L272 TraceCheckUtils]: 56: Hoare triple {8738#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:13,419 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8366#true} {8738#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #95#return; {8738#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:23:13,419 INFO L290 TraceCheckUtils]: 54: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:13,419 INFO L290 TraceCheckUtils]: 53: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:13,419 INFO L290 TraceCheckUtils]: 52: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:13,419 INFO L272 TraceCheckUtils]: 51: Hoare triple {8738#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:13,420 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8366#true} {8738#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #93#return; {8738#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:23:13,420 INFO L290 TraceCheckUtils]: 49: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:13,420 INFO L290 TraceCheckUtils]: 48: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:13,420 INFO L290 TraceCheckUtils]: 47: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:13,420 INFO L272 TraceCheckUtils]: 46: Hoare triple {8738#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:13,421 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8366#true} {8738#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #91#return; {8738#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:23:13,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:13,421 INFO L290 TraceCheckUtils]: 43: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:13,421 INFO L290 TraceCheckUtils]: 42: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:13,421 INFO L272 TraceCheckUtils]: 41: Hoare triple {8738#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:13,421 INFO L290 TraceCheckUtils]: 40: Hoare triple {8738#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !false; {8738#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:23:13,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {8805#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8738#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:23:13,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {8805#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !false; {8805#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:23:13,423 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8366#true} {8805#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #89#return; {8805#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:23:13,423 INFO L290 TraceCheckUtils]: 36: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:13,423 INFO L290 TraceCheckUtils]: 35: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:13,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:13,423 INFO L272 TraceCheckUtils]: 33: Hoare triple {8805#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:13,423 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8366#true} {8805#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #87#return; {8805#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:23:13,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:13,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:13,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:13,424 INFO L272 TraceCheckUtils]: 28: Hoare triple {8805#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:13,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {8366#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {8805#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:23:13,424 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8366#true} {8366#true} #85#return; {8366#true} is VALID [2022-04-28 12:23:13,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:13,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:13,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:13,424 INFO L272 TraceCheckUtils]: 22: Hoare triple {8366#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:13,424 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8366#true} {8366#true} #83#return; {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L272 TraceCheckUtils]: 17: Hoare triple {8366#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8366#true} {8366#true} #81#return; {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L272 TraceCheckUtils]: 12: Hoare triple {8366#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {8366#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8366#true} {8366#true} #79#return; {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {8366#true} assume !(0 == ~cond); {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {8366#true} ~cond := #in~cond; {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L272 TraceCheckUtils]: 6: Hoare triple {8366#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {8366#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {8366#true} call #t~ret6 := main(); {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8366#true} {8366#true} #103#return; {8366#true} is VALID [2022-04-28 12:23:13,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {8366#true} assume true; {8366#true} is VALID [2022-04-28 12:23:13,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {8366#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(11, 2);call #Ultimate.allocInit(12, 3); {8366#true} is VALID [2022-04-28 12:23:13,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {8366#true} call ULTIMATE.init(); {8366#true} is VALID [2022-04-28 12:23:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-28 12:23:13,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:23:13,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430126845] [2022-04-28 12:23:13,426 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:23:13,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163977990] [2022-04-28 12:23:13,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163977990] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:23:13,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:23:13,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 12:23:13,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:23:13,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [889959638] [2022-04-28 12:23:13,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [889959638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:23:13,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:23:13,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:23:13,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783296176] [2022-04-28 12:23:13,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:23:13,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 91 [2022-04-28 12:23:13,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:23:13,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 12:23:13,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:23:13,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:23:13,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:23:13,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:23:13,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:23:13,473 INFO L87 Difference]: Start difference. First operand 134 states and 178 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 12:23:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:23:14,840 INFO L93 Difference]: Finished difference Result 161 states and 214 transitions. [2022-04-28 12:23:14,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:23:14,840 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 91 [2022-04-28 12:23:14,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:23:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 12:23:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-28 12:23:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 12:23:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-28 12:23:14,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2022-04-28 12:23:14,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:23:14,951 INFO L225 Difference]: With dead ends: 161 [2022-04-28 12:23:14,951 INFO L226 Difference]: Without dead ends: 158 [2022-04-28 12:23:14,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-04-28 12:23:14,952 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 12:23:14,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 275 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 12:23:14,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-28 12:23:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2022-04-28 12:23:15,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:23:15,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 157 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 89 states have internal predecessors, (102), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 12:23:15,215 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 157 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 89 states have internal predecessors, (102), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 12:23:15,215 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 157 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 89 states have internal predecessors, (102), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 12:23:15,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:23:15,218 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2022-04-28 12:23:15,218 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 210 transitions. [2022-04-28 12:23:15,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:23:15,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:23:15,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 89 states have internal predecessors, (102), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 158 states. [2022-04-28 12:23:15,219 INFO L87 Difference]: Start difference. First operand has 157 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 89 states have internal predecessors, (102), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 158 states. [2022-04-28 12:23:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:23:15,222 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2022-04-28 12:23:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 210 transitions. [2022-04-28 12:23:15,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:23:15,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:23:15,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:23:15,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:23:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 89 states have internal predecessors, (102), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 12:23:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 209 transitions. [2022-04-28 12:23:15,226 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 209 transitions. Word has length 91 [2022-04-28 12:23:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:23:15,226 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 209 transitions. [2022-04-28 12:23:15,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 12:23:15,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 209 transitions. [2022-04-28 12:23:15,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:23:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 209 transitions. [2022-04-28 12:23:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 12:23:15,539 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:23:15,539 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 6, 6, 6, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:23:15,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 12:23:15,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 12:23:15,756 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:23:15,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:23:15,756 INFO L85 PathProgramCache]: Analyzing trace with hash -663071842, now seen corresponding path program 7 times [2022-04-28 12:23:15,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:23:15,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1969369673] [2022-04-28 12:23:15,756 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:23:15,756 INFO L85 PathProgramCache]: Analyzing trace with hash -663071842, now seen corresponding path program 8 times [2022-04-28 12:23:15,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:23:15,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603340319] [2022-04-28 12:23:15,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:23:15,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:23:15,768 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:23:15,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339313777] [2022-04-28 12:23:15,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:23:15,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:23:15,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:23:15,769 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:23:15,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 12:23:15,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:23:15,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:23:15,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:23:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:23:15,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:23:16,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {9885#true} call ULTIMATE.init(); {9885#true} is VALID [2022-04-28 12:23:16,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {9885#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(11, 2);call #Ultimate.allocInit(12, 3); {9885#true} is VALID [2022-04-28 12:23:16,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {9885#true} assume true; {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9885#true} {9885#true} #103#return; {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {9885#true} call #t~ret6 := main(); {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {9885#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L272 TraceCheckUtils]: 6: Hoare triple {9885#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {9885#true} ~cond := #in~cond; {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {9885#true} assume !(0 == ~cond); {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {9885#true} assume true; {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9885#true} {9885#true} #79#return; {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {9885#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L272 TraceCheckUtils]: 12: Hoare triple {9885#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {9885#true} ~cond := #in~cond; {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {9885#true} assume !(0 == ~cond); {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {9885#true} assume true; {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9885#true} {9885#true} #81#return; {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L272 TraceCheckUtils]: 17: Hoare triple {9885#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {9885#true} ~cond := #in~cond; {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {9885#true} assume !(0 == ~cond); {9885#true} is VALID [2022-04-28 12:23:16,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {9885#true} assume true; {9885#true} is VALID [2022-04-28 12:23:16,041 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9885#true} {9885#true} #83#return; {9885#true} is VALID [2022-04-28 12:23:16,041 INFO L272 TraceCheckUtils]: 22: Hoare triple {9885#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9885#true} is VALID [2022-04-28 12:23:16,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {9885#true} ~cond := #in~cond; {9885#true} is VALID [2022-04-28 12:23:16,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {9885#true} assume !(0 == ~cond); {9885#true} is VALID [2022-04-28 12:23:16,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {9885#true} assume true; {9885#true} is VALID [2022-04-28 12:23:16,041 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9885#true} {9885#true} #85#return; {9885#true} is VALID [2022-04-28 12:23:16,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {9885#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {9885#true} is VALID [2022-04-28 12:23:16,041 INFO L272 TraceCheckUtils]: 28: Hoare triple {9885#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {9885#true} is VALID [2022-04-28 12:23:16,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {9885#true} ~cond := #in~cond; {9885#true} is VALID [2022-04-28 12:23:16,041 INFO L290 TraceCheckUtils]: 30: Hoare triple {9885#true} assume !(0 == ~cond); {9885#true} is VALID [2022-04-28 12:23:16,041 INFO L290 TraceCheckUtils]: 31: Hoare triple {9885#true} assume true; {9885#true} is VALID [2022-04-28 12:23:16,041 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9885#true} {9885#true} #87#return; {9885#true} is VALID [2022-04-28 12:23:16,041 INFO L272 TraceCheckUtils]: 33: Hoare triple {9885#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {9885#true} is VALID [2022-04-28 12:23:16,041 INFO L290 TraceCheckUtils]: 34: Hoare triple {9885#true} ~cond := #in~cond; {9885#true} is VALID [2022-04-28 12:23:16,041 INFO L290 TraceCheckUtils]: 35: Hoare triple {9885#true} assume !(0 == ~cond); {9885#true} is VALID [2022-04-28 12:23:16,041 INFO L290 TraceCheckUtils]: 36: Hoare triple {9885#true} assume true; {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9885#true} {9885#true} #89#return; {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L290 TraceCheckUtils]: 38: Hoare triple {9885#true} assume !false; {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {9885#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {9885#true} assume !false; {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L272 TraceCheckUtils]: 41: Hoare triple {9885#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {9885#true} ~cond := #in~cond; {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {9885#true} assume !(0 == ~cond); {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {9885#true} assume true; {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9885#true} {9885#true} #91#return; {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L272 TraceCheckUtils]: 46: Hoare triple {9885#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L290 TraceCheckUtils]: 47: Hoare triple {9885#true} ~cond := #in~cond; {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L290 TraceCheckUtils]: 48: Hoare triple {9885#true} assume !(0 == ~cond); {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L290 TraceCheckUtils]: 49: Hoare triple {9885#true} assume true; {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9885#true} {9885#true} #93#return; {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L272 TraceCheckUtils]: 51: Hoare triple {9885#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L290 TraceCheckUtils]: 52: Hoare triple {9885#true} ~cond := #in~cond; {9885#true} is VALID [2022-04-28 12:23:16,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {9885#true} assume !(0 == ~cond); {9885#true} is VALID [2022-04-28 12:23:16,043 INFO L290 TraceCheckUtils]: 54: Hoare triple {9885#true} assume true; {9885#true} is VALID [2022-04-28 12:23:16,043 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9885#true} {9885#true} #95#return; {9885#true} is VALID [2022-04-28 12:23:16,043 INFO L272 TraceCheckUtils]: 56: Hoare triple {9885#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {9885#true} is VALID [2022-04-28 12:23:16,043 INFO L290 TraceCheckUtils]: 57: Hoare triple {9885#true} ~cond := #in~cond; {9885#true} is VALID [2022-04-28 12:23:16,043 INFO L290 TraceCheckUtils]: 58: Hoare triple {9885#true} assume !(0 == ~cond); {9885#true} is VALID [2022-04-28 12:23:16,043 INFO L290 TraceCheckUtils]: 59: Hoare triple {9885#true} assume true; {9885#true} is VALID [2022-04-28 12:23:16,043 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9885#true} {9885#true} #97#return; {9885#true} is VALID [2022-04-28 12:23:16,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {9885#true} assume !(~c~0 >= ~b~0); {10073#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:23:16,044 INFO L290 TraceCheckUtils]: 62: Hoare triple {10073#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {10077#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:23:16,044 INFO L290 TraceCheckUtils]: 63: Hoare triple {10077#(< main_~b~0 main_~a~0)} assume !false; {10077#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:23:16,044 INFO L290 TraceCheckUtils]: 64: Hoare triple {10077#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10084#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:23:16,044 INFO L290 TraceCheckUtils]: 65: Hoare triple {10084#(< main_~b~0 main_~c~0)} assume !false; {10084#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:23:16,044 INFO L272 TraceCheckUtils]: 66: Hoare triple {10084#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9885#true} is VALID [2022-04-28 12:23:16,044 INFO L290 TraceCheckUtils]: 67: Hoare triple {9885#true} ~cond := #in~cond; {9885#true} is VALID [2022-04-28 12:23:16,045 INFO L290 TraceCheckUtils]: 68: Hoare triple {9885#true} assume !(0 == ~cond); {9885#true} is VALID [2022-04-28 12:23:16,045 INFO L290 TraceCheckUtils]: 69: Hoare triple {9885#true} assume true; {9885#true} is VALID [2022-04-28 12:23:16,045 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {9885#true} {10084#(< main_~b~0 main_~c~0)} #91#return; {10084#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:23:16,045 INFO L272 TraceCheckUtils]: 71: Hoare triple {10084#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9885#true} is VALID [2022-04-28 12:23:16,045 INFO L290 TraceCheckUtils]: 72: Hoare triple {9885#true} ~cond := #in~cond; {9885#true} is VALID [2022-04-28 12:23:16,045 INFO L290 TraceCheckUtils]: 73: Hoare triple {9885#true} assume !(0 == ~cond); {9885#true} is VALID [2022-04-28 12:23:16,045 INFO L290 TraceCheckUtils]: 74: Hoare triple {9885#true} assume true; {9885#true} is VALID [2022-04-28 12:23:16,046 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {9885#true} {10084#(< main_~b~0 main_~c~0)} #93#return; {10084#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:23:16,046 INFO L272 TraceCheckUtils]: 76: Hoare triple {10084#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9885#true} is VALID [2022-04-28 12:23:16,046 INFO L290 TraceCheckUtils]: 77: Hoare triple {9885#true} ~cond := #in~cond; {9885#true} is VALID [2022-04-28 12:23:16,046 INFO L290 TraceCheckUtils]: 78: Hoare triple {9885#true} assume !(0 == ~cond); {9885#true} is VALID [2022-04-28 12:23:16,046 INFO L290 TraceCheckUtils]: 79: Hoare triple {9885#true} assume true; {9885#true} is VALID [2022-04-28 12:23:16,047 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9885#true} {10084#(< main_~b~0 main_~c~0)} #95#return; {10084#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:23:16,047 INFO L272 TraceCheckUtils]: 81: Hoare triple {10084#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {9885#true} is VALID [2022-04-28 12:23:16,047 INFO L290 TraceCheckUtils]: 82: Hoare triple {9885#true} ~cond := #in~cond; {9885#true} is VALID [2022-04-28 12:23:16,047 INFO L290 TraceCheckUtils]: 83: Hoare triple {9885#true} assume !(0 == ~cond); {9885#true} is VALID [2022-04-28 12:23:16,047 INFO L290 TraceCheckUtils]: 84: Hoare triple {9885#true} assume true; {9885#true} is VALID [2022-04-28 12:23:16,050 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {9885#true} {10084#(< main_~b~0 main_~c~0)} #97#return; {10084#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:23:16,051 INFO L290 TraceCheckUtils]: 86: Hoare triple {10084#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {9886#false} is VALID [2022-04-28 12:23:16,051 INFO L290 TraceCheckUtils]: 87: Hoare triple {9886#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {9886#false} is VALID [2022-04-28 12:23:16,051 INFO L290 TraceCheckUtils]: 88: Hoare triple {9886#false} assume !false; {9886#false} is VALID [2022-04-28 12:23:16,051 INFO L290 TraceCheckUtils]: 89: Hoare triple {9886#false} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9886#false} is VALID [2022-04-28 12:23:16,051 INFO L290 TraceCheckUtils]: 90: Hoare triple {9886#false} assume !false; {9886#false} is VALID [2022-04-28 12:23:16,051 INFO L272 TraceCheckUtils]: 91: Hoare triple {9886#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9886#false} is VALID [2022-04-28 12:23:16,051 INFO L290 TraceCheckUtils]: 92: Hoare triple {9886#false} ~cond := #in~cond; {9886#false} is VALID [2022-04-28 12:23:16,051 INFO L290 TraceCheckUtils]: 93: Hoare triple {9886#false} assume !(0 == ~cond); {9886#false} is VALID [2022-04-28 12:23:16,051 INFO L290 TraceCheckUtils]: 94: Hoare triple {9886#false} assume true; {9886#false} is VALID [2022-04-28 12:23:16,051 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {9886#false} {9886#false} #91#return; {9886#false} is VALID [2022-04-28 12:23:16,051 INFO L272 TraceCheckUtils]: 96: Hoare triple {9886#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9886#false} is VALID [2022-04-28 12:23:16,051 INFO L290 TraceCheckUtils]: 97: Hoare triple {9886#false} ~cond := #in~cond; {9886#false} is VALID [2022-04-28 12:23:16,051 INFO L290 TraceCheckUtils]: 98: Hoare triple {9886#false} assume 0 == ~cond; {9886#false} is VALID [2022-04-28 12:23:16,051 INFO L290 TraceCheckUtils]: 99: Hoare triple {9886#false} assume !false; {9886#false} is VALID [2022-04-28 12:23:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-04-28 12:23:16,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:23:16,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:23:16,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603340319] [2022-04-28 12:23:16,052 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:23:16,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339313777] [2022-04-28 12:23:16,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339313777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:23:16,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:23:16,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:23:16,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:23:16,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1969369673] [2022-04-28 12:23:16,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1969369673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:23:16,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:23:16,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:23:16,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476371645] [2022-04-28 12:23:16,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:23:16,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 100 [2022-04-28 12:23:16,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:23:16,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-28 12:23:16,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:23:16,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:23:16,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:23:16,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:23:16,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:23:16,095 INFO L87 Difference]: Start difference. First operand 157 states and 209 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-28 12:23:16,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:23:16,625 INFO L93 Difference]: Finished difference Result 205 states and 283 transitions. [2022-04-28 12:23:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:23:16,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 100 [2022-04-28 12:23:16,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:23:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-28 12:23:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-04-28 12:23:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-28 12:23:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-04-28 12:23:16,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 94 transitions. [2022-04-28 12:23:16,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:23:16,707 INFO L225 Difference]: With dead ends: 205 [2022-04-28 12:23:16,707 INFO L226 Difference]: Without dead ends: 160 [2022-04-28 12:23:16,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 12:23:16,708 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:23:16,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 163 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:23:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-28 12:23:17,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2022-04-28 12:23:17,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:23:17,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 151 states, 81 states have (on average 1.123456790123457) internal successors, (91), 83 states have internal predecessors, (91), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 12:23:17,010 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 151 states, 81 states have (on average 1.123456790123457) internal successors, (91), 83 states have internal predecessors, (91), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 12:23:17,010 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 151 states, 81 states have (on average 1.123456790123457) internal successors, (91), 83 states have internal predecessors, (91), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 12:23:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:23:17,013 INFO L93 Difference]: Finished difference Result 160 states and 212 transitions. [2022-04-28 12:23:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 212 transitions. [2022-04-28 12:23:17,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:23:17,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:23:17,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 81 states have (on average 1.123456790123457) internal successors, (91), 83 states have internal predecessors, (91), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 160 states. [2022-04-28 12:23:17,014 INFO L87 Difference]: Start difference. First operand has 151 states, 81 states have (on average 1.123456790123457) internal successors, (91), 83 states have internal predecessors, (91), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 160 states. [2022-04-28 12:23:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:23:17,017 INFO L93 Difference]: Finished difference Result 160 states and 212 transitions. [2022-04-28 12:23:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 212 transitions. [2022-04-28 12:23:17,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:23:17,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:23:17,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:23:17,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:23:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 81 states have (on average 1.123456790123457) internal successors, (91), 83 states have internal predecessors, (91), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 12:23:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 198 transitions. [2022-04-28 12:23:17,021 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 198 transitions. Word has length 100 [2022-04-28 12:23:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:23:17,021 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 198 transitions. [2022-04-28 12:23:17,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-28 12:23:17,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 198 transitions. [2022-04-28 12:23:17,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:23:17,347 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 198 transitions. [2022-04-28 12:23:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 12:23:17,348 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:23:17,348 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:23:17,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 12:23:17,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 12:23:17,555 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:23:17,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:23:17,555 INFO L85 PathProgramCache]: Analyzing trace with hash -428114403, now seen corresponding path program 1 times [2022-04-28 12:23:17,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:23:17,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1919201767] [2022-04-28 12:23:17,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:23:17,556 INFO L85 PathProgramCache]: Analyzing trace with hash -428114403, now seen corresponding path program 2 times [2022-04-28 12:23:17,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:23:17,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041870479] [2022-04-28 12:23:17,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:23:17,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:23:17,573 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:23:17,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790808031] [2022-04-28 12:23:17,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:23:17,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:23:17,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:23:17,574 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:23:17,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 12:23:17,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:23:17,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:23:17,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-28 12:23:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:23:17,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:23:19,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {11225#true} call ULTIMATE.init(); {11225#true} is VALID [2022-04-28 12:23:19,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {11225#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(11, 2);call #Ultimate.allocInit(12, 3); {11225#true} is VALID [2022-04-28 12:23:19,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:23:19,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11225#true} {11225#true} #103#return; {11225#true} is VALID [2022-04-28 12:23:19,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {11225#true} call #t~ret6 := main(); {11225#true} is VALID [2022-04-28 12:23:19,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {11225#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11225#true} is VALID [2022-04-28 12:23:19,155 INFO L272 TraceCheckUtils]: 6: Hoare triple {11225#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:23:19,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:23:19,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:23:19,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:23:19,156 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11225#true} {11225#true} #79#return; {11225#true} is VALID [2022-04-28 12:23:19,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {11225#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11225#true} is VALID [2022-04-28 12:23:19,156 INFO L272 TraceCheckUtils]: 12: Hoare triple {11225#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:23:19,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:23:19,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:23:19,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:23:19,156 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11225#true} {11225#true} #81#return; {11225#true} is VALID [2022-04-28 12:23:19,156 INFO L272 TraceCheckUtils]: 17: Hoare triple {11225#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:23:19,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {11225#true} ~cond := #in~cond; {11284#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:23:19,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {11284#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {11288#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:23:19,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {11288#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {11288#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:23:19,157 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11288#(not (= |assume_abort_if_not_#in~cond| 0))} {11225#true} #83#return; {11295#(<= 1 main_~x~0)} is VALID [2022-04-28 12:23:19,157 INFO L272 TraceCheckUtils]: 22: Hoare triple {11295#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:23:19,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:23:19,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:23:19,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:23:19,158 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11225#true} {11295#(<= 1 main_~x~0)} #85#return; {11295#(<= 1 main_~x~0)} is VALID [2022-04-28 12:23:19,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {11295#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {11314#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,158 INFO L272 TraceCheckUtils]: 28: Hoare triple {11314#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:23:19,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:23:19,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:23:19,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:23:19,159 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11225#true} {11314#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {11314#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,159 INFO L272 TraceCheckUtils]: 33: Hoare triple {11314#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:23:19,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:23:19,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:23:19,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:23:19,160 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11225#true} {11314#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {11314#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {11314#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11314#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,161 INFO L290 TraceCheckUtils]: 39: Hoare triple {11314#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11351#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,161 INFO L290 TraceCheckUtils]: 40: Hoare triple {11351#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11351#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,162 INFO L272 TraceCheckUtils]: 41: Hoare triple {11351#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:23:19,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:23:19,162 INFO L290 TraceCheckUtils]: 43: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:23:19,162 INFO L290 TraceCheckUtils]: 44: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:23:19,163 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11225#true} {11351#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {11351#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,163 INFO L272 TraceCheckUtils]: 46: Hoare triple {11351#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~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)); {11225#true} is VALID [2022-04-28 12:23:19,163 INFO L290 TraceCheckUtils]: 47: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:23:19,163 INFO L290 TraceCheckUtils]: 48: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:23:19,163 INFO L290 TraceCheckUtils]: 49: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:23:19,164 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11225#true} {11351#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {11351#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,164 INFO L272 TraceCheckUtils]: 51: Hoare triple {11351#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~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)); {11225#true} is VALID [2022-04-28 12:23:19,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:23:19,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:23:19,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:23:19,165 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11225#true} {11351#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {11351#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,165 INFO L272 TraceCheckUtils]: 56: Hoare triple {11351#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:23:19,165 INFO L290 TraceCheckUtils]: 57: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:23:19,165 INFO L290 TraceCheckUtils]: 58: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:23:19,165 INFO L290 TraceCheckUtils]: 59: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:23:19,166 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11225#true} {11351#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {11351#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,167 INFO L290 TraceCheckUtils]: 61: Hoare triple {11351#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {11418#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,168 INFO L290 TraceCheckUtils]: 62: Hoare triple {11418#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11418#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,168 INFO L272 TraceCheckUtils]: 63: Hoare triple {11418#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:23:19,168 INFO L290 TraceCheckUtils]: 64: Hoare triple {11225#true} ~cond := #in~cond; {11428#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:23:19,168 INFO L290 TraceCheckUtils]: 65: Hoare triple {11428#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:23:19,168 INFO L290 TraceCheckUtils]: 66: Hoare triple {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:23:19,170 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} {11418#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {11439#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,170 INFO L272 TraceCheckUtils]: 68: Hoare triple {11439#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~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)); {11225#true} is VALID [2022-04-28 12:23:19,170 INFO L290 TraceCheckUtils]: 69: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:23:19,170 INFO L290 TraceCheckUtils]: 70: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:23:19,170 INFO L290 TraceCheckUtils]: 71: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:23:19,171 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {11225#true} {11439#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #93#return; {11439#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,171 INFO L272 TraceCheckUtils]: 73: Hoare triple {11439#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~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)); {11225#true} is VALID [2022-04-28 12:23:19,171 INFO L290 TraceCheckUtils]: 74: Hoare triple {11225#true} ~cond := #in~cond; {11428#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:23:19,172 INFO L290 TraceCheckUtils]: 75: Hoare triple {11428#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:23:19,172 INFO L290 TraceCheckUtils]: 76: Hoare triple {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:23:19,173 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} {11439#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #95#return; {11439#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,173 INFO L272 TraceCheckUtils]: 78: Hoare triple {11439#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:23:19,173 INFO L290 TraceCheckUtils]: 79: Hoare triple {11225#true} ~cond := #in~cond; {11428#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:23:19,173 INFO L290 TraceCheckUtils]: 80: Hoare triple {11428#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:23:19,174 INFO L290 TraceCheckUtils]: 81: Hoare triple {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:23:19,174 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} {11439#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #97#return; {11439#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,175 INFO L290 TraceCheckUtils]: 83: Hoare triple {11439#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {11488#(and (= main_~r~0 0) (<= main_~y~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (< main_~c~0 main_~y~0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-28 12:23:19,176 INFO L290 TraceCheckUtils]: 84: Hoare triple {11488#(and (= main_~r~0 0) (<= main_~y~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (< main_~c~0 main_~y~0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 12:23:19,176 INFO L290 TraceCheckUtils]: 85: Hoare triple {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !false; {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 12:23:19,177 INFO L290 TraceCheckUtils]: 86: Hoare triple {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 12:23:19,177 INFO L290 TraceCheckUtils]: 87: Hoare triple {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !false; {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 12:23:19,177 INFO L272 TraceCheckUtils]: 88: Hoare triple {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:23:19,177 INFO L290 TraceCheckUtils]: 89: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:23:19,178 INFO L290 TraceCheckUtils]: 90: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:23:19,178 INFO L290 TraceCheckUtils]: 91: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:23:19,178 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {11225#true} {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #91#return; {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 12:23:19,178 INFO L272 TraceCheckUtils]: 93: Hoare triple {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:23:19,178 INFO L290 TraceCheckUtils]: 94: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:23:19,178 INFO L290 TraceCheckUtils]: 95: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:23:19,179 INFO L290 TraceCheckUtils]: 96: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:23:19,179 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {11225#true} {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #93#return; {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 12:23:19,179 INFO L272 TraceCheckUtils]: 98: Hoare triple {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:23:19,191 INFO L290 TraceCheckUtils]: 99: Hoare triple {11225#true} ~cond := #in~cond; {11428#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:23:19,203 INFO L290 TraceCheckUtils]: 100: Hoare triple {11428#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:23:19,204 INFO L290 TraceCheckUtils]: 101: Hoare triple {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:23:19,204 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #95#return; {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 12:23:19,206 INFO L272 TraceCheckUtils]: 103: Hoare triple {11492#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11550#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:23:19,207 INFO L290 TraceCheckUtils]: 104: Hoare triple {11550#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11554#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:23:19,207 INFO L290 TraceCheckUtils]: 105: Hoare triple {11554#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11226#false} is VALID [2022-04-28 12:23:19,207 INFO L290 TraceCheckUtils]: 106: Hoare triple {11226#false} assume !false; {11226#false} is VALID [2022-04-28 12:23:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 87 proven. 52 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-04-28 12:23:19,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:25:36,121 INFO L290 TraceCheckUtils]: 106: Hoare triple {11226#false} assume !false; {11226#false} is VALID [2022-04-28 12:25:36,122 INFO L290 TraceCheckUtils]: 105: Hoare triple {11554#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11226#false} is VALID [2022-04-28 12:25:36,122 INFO L290 TraceCheckUtils]: 104: Hoare triple {11550#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11554#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:25:36,123 INFO L272 TraceCheckUtils]: 103: Hoare triple {11570#(= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11550#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:25:36,123 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} {11574#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #95#return; {11570#(= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))} is VALID [2022-04-28 12:25:36,124 INFO L290 TraceCheckUtils]: 101: Hoare triple {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:25:36,124 INFO L290 TraceCheckUtils]: 100: Hoare triple {11584#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:25:36,124 INFO L290 TraceCheckUtils]: 99: Hoare triple {11225#true} ~cond := #in~cond; {11584#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:25:36,124 INFO L272 TraceCheckUtils]: 98: Hoare triple {11574#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~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)); {11225#true} is VALID [2022-04-28 12:25:36,125 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {11225#true} {11574#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #93#return; {11574#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 12:25:36,125 INFO L290 TraceCheckUtils]: 96: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:25:36,125 INFO L290 TraceCheckUtils]: 95: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:25:36,125 INFO L290 TraceCheckUtils]: 94: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:25:36,125 INFO L272 TraceCheckUtils]: 93: Hoare triple {11574#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~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)); {11225#true} is VALID [2022-04-28 12:25:36,126 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {11225#true} {11574#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #91#return; {11574#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 12:25:36,126 INFO L290 TraceCheckUtils]: 91: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:25:36,126 INFO L290 TraceCheckUtils]: 90: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:25:36,126 INFO L290 TraceCheckUtils]: 89: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:25:36,126 INFO L272 TraceCheckUtils]: 88: Hoare triple {11574#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:25:36,127 INFO L290 TraceCheckUtils]: 87: Hoare triple {11574#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {11574#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 12:25:36,127 INFO L290 TraceCheckUtils]: 86: Hoare triple {11574#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11574#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 12:25:36,127 INFO L290 TraceCheckUtils]: 85: Hoare triple {11574#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {11574#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 12:25:38,129 WARN L290 TraceCheckUtils]: 84: Hoare triple {11630#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11574#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is UNKNOWN [2022-04-28 12:25:38,130 INFO L290 TraceCheckUtils]: 83: Hoare triple {11634#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} assume !(~c~0 >= ~b~0); {11630#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 12:25:38,131 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} {11638#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #97#return; {11634#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 12:25:38,131 INFO L290 TraceCheckUtils]: 81: Hoare triple {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:25:38,132 INFO L290 TraceCheckUtils]: 80: Hoare triple {11584#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:25:38,132 INFO L290 TraceCheckUtils]: 79: Hoare triple {11225#true} ~cond := #in~cond; {11584#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:25:38,132 INFO L272 TraceCheckUtils]: 78: Hoare triple {11638#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:25:38,133 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} {11654#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #95#return; {11638#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 12:25:38,133 INFO L290 TraceCheckUtils]: 76: Hoare triple {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:25:38,133 INFO L290 TraceCheckUtils]: 75: Hoare triple {11584#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:25:38,134 INFO L290 TraceCheckUtils]: 74: Hoare triple {11225#true} ~cond := #in~cond; {11584#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:25:38,134 INFO L272 TraceCheckUtils]: 73: Hoare triple {11654#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:25:38,135 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {11225#true} {11654#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #93#return; {11654#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 12:25:38,135 INFO L290 TraceCheckUtils]: 71: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:25:38,135 INFO L290 TraceCheckUtils]: 70: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:25:38,135 INFO L290 TraceCheckUtils]: 69: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:25:38,135 INFO L272 TraceCheckUtils]: 68: Hoare triple {11654#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:25:38,136 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} {11685#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} #91#return; {11654#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 12:25:38,136 INFO L290 TraceCheckUtils]: 66: Hoare triple {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:25:38,136 INFO L290 TraceCheckUtils]: 65: Hoare triple {11584#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:25:38,137 INFO L290 TraceCheckUtils]: 64: Hoare triple {11225#true} ~cond := #in~cond; {11584#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:25:38,137 INFO L272 TraceCheckUtils]: 63: Hoare triple {11685#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:25:38,137 INFO L290 TraceCheckUtils]: 62: Hoare triple {11685#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} assume !false; {11685#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-28 12:25:38,152 INFO L290 TraceCheckUtils]: 61: Hoare triple {11704#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {11685#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-28 12:25:38,153 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11225#true} {11704#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} #97#return; {11704#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 12:25:38,153 INFO L290 TraceCheckUtils]: 59: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:25:38,153 INFO L290 TraceCheckUtils]: 58: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:25:38,153 INFO L290 TraceCheckUtils]: 57: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:25:38,153 INFO L272 TraceCheckUtils]: 56: Hoare triple {11704#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:25:38,154 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11225#true} {11704#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} #95#return; {11704#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 12:25:38,154 INFO L290 TraceCheckUtils]: 54: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:25:38,154 INFO L290 TraceCheckUtils]: 53: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:25:38,154 INFO L290 TraceCheckUtils]: 52: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:25:38,154 INFO L272 TraceCheckUtils]: 51: Hoare triple {11704#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:25:38,155 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11225#true} {11704#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} #93#return; {11704#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 12:25:38,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:25:38,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:25:38,155 INFO L290 TraceCheckUtils]: 47: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:25:38,155 INFO L272 TraceCheckUtils]: 46: Hoare triple {11704#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:25:38,168 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11225#true} {11704#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} #91#return; {11704#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 12:25:38,168 INFO L290 TraceCheckUtils]: 44: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:25:38,168 INFO L290 TraceCheckUtils]: 43: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:25:38,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:25:38,168 INFO L272 TraceCheckUtils]: 41: Hoare triple {11704#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:25:38,169 INFO L290 TraceCheckUtils]: 40: Hoare triple {11704#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} assume !false; {11704#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 12:25:38,170 INFO L290 TraceCheckUtils]: 39: Hoare triple {11771#(or (not (<= main_~b~0 main_~a~0)) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~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)))))) (<= (* main_~b~0 2) main_~a~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11704#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 12:25:38,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {11771#(or (not (<= main_~b~0 main_~a~0)) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~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)))))) (<= (* main_~b~0 2) main_~a~0))} assume !false; {11771#(or (not (<= main_~b~0 main_~a~0)) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~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)))))) (<= (* main_~b~0 2) main_~a~0))} is VALID [2022-04-28 12:25:38,171 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11225#true} {11771#(or (not (<= main_~b~0 main_~a~0)) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~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)))))) (<= (* main_~b~0 2) main_~a~0))} #89#return; {11771#(or (not (<= main_~b~0 main_~a~0)) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~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)))))) (<= (* main_~b~0 2) main_~a~0))} is VALID [2022-04-28 12:25:38,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:25:38,171 INFO L290 TraceCheckUtils]: 35: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:25:38,172 INFO L290 TraceCheckUtils]: 34: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:25:38,172 INFO L272 TraceCheckUtils]: 33: Hoare triple {11771#(or (not (<= main_~b~0 main_~a~0)) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~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)))))) (<= (* main_~b~0 2) main_~a~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:25:38,172 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11225#true} {11771#(or (not (<= main_~b~0 main_~a~0)) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~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)))))) (<= (* main_~b~0 2) main_~a~0))} #87#return; {11771#(or (not (<= main_~b~0 main_~a~0)) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~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)))))) (<= (* main_~b~0 2) main_~a~0))} is VALID [2022-04-28 12:25:38,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:25:38,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:25:38,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:25:38,172 INFO L272 TraceCheckUtils]: 28: Hoare triple {11771#(or (not (<= main_~b~0 main_~a~0)) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~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)))))) (<= (* main_~b~0 2) main_~a~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:25:38,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {11225#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {11771#(or (not (<= main_~b~0 main_~a~0)) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~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)))))) (<= (* main_~b~0 2) main_~a~0))} is VALID [2022-04-28 12:25:38,174 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11225#true} {11225#true} #85#return; {11225#true} is VALID [2022-04-28 12:25:38,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:25:38,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:25:38,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:25:38,174 INFO L272 TraceCheckUtils]: 22: Hoare triple {11225#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:25:38,174 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11225#true} {11225#true} #83#return; {11225#true} is VALID [2022-04-28 12:25:38,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:25:38,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:25:38,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:25:38,174 INFO L272 TraceCheckUtils]: 17: Hoare triple {11225#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:25:38,174 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11225#true} {11225#true} #81#return; {11225#true} is VALID [2022-04-28 12:25:38,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:25:38,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:25:38,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:25:38,175 INFO L272 TraceCheckUtils]: 12: Hoare triple {11225#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:25:38,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {11225#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11225#true} is VALID [2022-04-28 12:25:38,175 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11225#true} {11225#true} #79#return; {11225#true} is VALID [2022-04-28 12:25:38,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:25:38,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {11225#true} assume !(0 == ~cond); {11225#true} is VALID [2022-04-28 12:25:38,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {11225#true} ~cond := #in~cond; {11225#true} is VALID [2022-04-28 12:25:38,175 INFO L272 TraceCheckUtils]: 6: Hoare triple {11225#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {11225#true} is VALID [2022-04-28 12:25:38,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {11225#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11225#true} is VALID [2022-04-28 12:25:38,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {11225#true} call #t~ret6 := main(); {11225#true} is VALID [2022-04-28 12:25:38,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11225#true} {11225#true} #103#return; {11225#true} is VALID [2022-04-28 12:25:38,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {11225#true} assume true; {11225#true} is VALID [2022-04-28 12:25:38,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {11225#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(11, 2);call #Ultimate.allocInit(12, 3); {11225#true} is VALID [2022-04-28 12:25:38,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {11225#true} call ULTIMATE.init(); {11225#true} is VALID [2022-04-28 12:25:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 81 proven. 43 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-28 12:25:38,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:25:38,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041870479] [2022-04-28 12:25:38,176 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:25:38,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790808031] [2022-04-28 12:25:38,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790808031] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:25:38,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:25:38,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-04-28 12:25:38,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:25:38,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1919201767] [2022-04-28 12:25:38,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1919201767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:25:38,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:25:38,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 12:25:38,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638723214] [2022-04-28 12:25:38,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:25:38,177 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) Word has length 107 [2022-04-28 12:25:38,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:25:38,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 12:25:38,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:25:38,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 12:25:38,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:25:38,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 12:25:38,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2022-04-28 12:25:38,247 INFO L87 Difference]: Start difference. First operand 151 states and 198 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 12:25:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:25:41,503 INFO L93 Difference]: Finished difference Result 158 states and 204 transitions. [2022-04-28 12:25:41,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 12:25:41,503 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) Word has length 107 [2022-04-28 12:25:41,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:25:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 12:25:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 103 transitions. [2022-04-28 12:25:41,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 12:25:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 103 transitions. [2022-04-28 12:25:41,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 103 transitions. [2022-04-28 12:25:41,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:25:41,649 INFO L225 Difference]: With dead ends: 158 [2022-04-28 12:25:41,649 INFO L226 Difference]: Without dead ends: 156 [2022-04-28 12:25:41,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 188 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2022-04-28 12:25:41,650 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 41 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 12:25:41,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 170 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 12:25:41,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-28 12:25:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2022-04-28 12:25:41,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:25:41,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 12:25:41,984 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 12:25:41,985 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 12:25:41,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:25:41,987 INFO L93 Difference]: Finished difference Result 156 states and 202 transitions. [2022-04-28 12:25:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 202 transitions. [2022-04-28 12:25:41,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:25:41,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:25:41,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 156 states. [2022-04-28 12:25:41,988 INFO L87 Difference]: Start difference. First operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 156 states. [2022-04-28 12:25:41,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:25:41,991 INFO L93 Difference]: Finished difference Result 156 states and 202 transitions. [2022-04-28 12:25:41,991 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 202 transitions. [2022-04-28 12:25:41,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:25:41,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:25:41,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:25:41,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:25:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 12:25:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 201 transitions. [2022-04-28 12:25:41,995 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 201 transitions. Word has length 107 [2022-04-28 12:25:41,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:25:41,995 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 201 transitions. [2022-04-28 12:25:41,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 12:25:41,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 201 transitions. [2022-04-28 12:25:42,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:25:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 201 transitions. [2022-04-28 12:25:42,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 12:25:42,343 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:25:42,343 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:25:42,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 12:25:42,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 12:25:42,547 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:25:42,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:25:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1185765869, now seen corresponding path program 3 times [2022-04-28 12:25:42,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:25:42,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [913537475] [2022-04-28 12:25:42,547 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:25:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1185765869, now seen corresponding path program 4 times [2022-04-28 12:25:42,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:25:42,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344798757] [2022-04-28 12:25:42,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:25:42,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:25:42,558 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:25:42,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352552751] [2022-04-28 12:25:42,558 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:25:42,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:25:42,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:25:42,559 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:25:42,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 12:25:42,609 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:25:42,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:25:42,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-28 12:25:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:25:42,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:25:50,397 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:25:52,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {12837#true} call ULTIMATE.init(); {12837#true} is VALID [2022-04-28 12:25:52,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {12837#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(11, 2);call #Ultimate.allocInit(12, 3); {12837#true} is VALID [2022-04-28 12:25:52,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:25:52,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12837#true} {12837#true} #103#return; {12837#true} is VALID [2022-04-28 12:25:52,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {12837#true} call #t~ret6 := main(); {12837#true} is VALID [2022-04-28 12:25:52,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {12837#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {12837#true} is VALID [2022-04-28 12:25:52,147 INFO L272 TraceCheckUtils]: 6: Hoare triple {12837#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:25:52,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:25:52,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:25:52,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:25:52,148 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12837#true} {12837#true} #79#return; {12837#true} is VALID [2022-04-28 12:25:52,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {12837#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12837#true} is VALID [2022-04-28 12:25:52,148 INFO L272 TraceCheckUtils]: 12: Hoare triple {12837#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:25:52,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:25:52,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:25:52,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:25:52,148 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12837#true} {12837#true} #81#return; {12837#true} is VALID [2022-04-28 12:25:52,148 INFO L272 TraceCheckUtils]: 17: Hoare triple {12837#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:25:52,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {12837#true} ~cond := #in~cond; {12896#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:25:52,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {12896#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {12900#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:25:52,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {12900#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {12900#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:25:52,150 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12900#(not (= |assume_abort_if_not_#in~cond| 0))} {12837#true} #83#return; {12907#(<= 1 main_~x~0)} is VALID [2022-04-28 12:25:52,150 INFO L272 TraceCheckUtils]: 22: Hoare triple {12907#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:25:52,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:25:52,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:25:52,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:25:52,153 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12837#true} {12907#(<= 1 main_~x~0)} #85#return; {12907#(<= 1 main_~x~0)} is VALID [2022-04-28 12:25:52,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {12907#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {12926#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,154 INFO L272 TraceCheckUtils]: 28: Hoare triple {12926#(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 assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:25:52,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:25:52,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:25:52,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:25:52,155 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12837#true} {12926#(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))} #87#return; {12926#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,155 INFO L272 TraceCheckUtils]: 33: Hoare triple {12926#(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 assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:25:52,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:25:52,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:25:52,155 INFO L290 TraceCheckUtils]: 36: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:25:52,155 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12837#true} {12926#(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))} #89#return; {12926#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {12926#(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; {12926#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {12926#(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 !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {12963#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {12963#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~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; {12963#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,157 INFO L272 TraceCheckUtils]: 41: Hoare triple {12963#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~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 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:25:52,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:25:52,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:25:52,157 INFO L290 TraceCheckUtils]: 44: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:25:52,158 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12837#true} {12963#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~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))} #91#return; {12963#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,158 INFO L272 TraceCheckUtils]: 46: Hoare triple {12963#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~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)); {12837#true} is VALID [2022-04-28 12:25:52,158 INFO L290 TraceCheckUtils]: 47: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:25:52,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:25:52,158 INFO L290 TraceCheckUtils]: 49: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:25:52,159 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12837#true} {12963#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~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))} #93#return; {12963#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,159 INFO L272 TraceCheckUtils]: 51: Hoare triple {12963#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~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)); {12837#true} is VALID [2022-04-28 12:25:52,159 INFO L290 TraceCheckUtils]: 52: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:25:52,159 INFO L290 TraceCheckUtils]: 53: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:25:52,159 INFO L290 TraceCheckUtils]: 54: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:25:52,159 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12837#true} {12963#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~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))} #95#return; {12963#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,160 INFO L272 TraceCheckUtils]: 56: Hoare triple {12963#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~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 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:25:52,160 INFO L290 TraceCheckUtils]: 57: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:25:52,160 INFO L290 TraceCheckUtils]: 58: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:25:52,160 INFO L290 TraceCheckUtils]: 59: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:25:52,163 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12837#true} {12963#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~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))} #97#return; {12963#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,175 INFO L290 TraceCheckUtils]: 61: Hoare triple {12963#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~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 !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13030#(and (= main_~r~0 0) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,176 INFO L290 TraceCheckUtils]: 62: Hoare triple {13030#(and (= main_~r~0 0) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {13030#(and (= main_~r~0 0) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,176 INFO L272 TraceCheckUtils]: 63: Hoare triple {13030#(and (= main_~r~0 0) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~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 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:25:52,176 INFO L290 TraceCheckUtils]: 64: Hoare triple {12837#true} ~cond := #in~cond; {13040#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:25:52,176 INFO L290 TraceCheckUtils]: 65: Hoare triple {13040#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13044#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:25:52,176 INFO L290 TraceCheckUtils]: 66: Hoare triple {13044#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13044#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:25:52,177 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {13044#(not (= |__VERIFIER_assert_#in~cond| 0))} {13030#(and (= main_~r~0 0) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {13051#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,177 INFO L272 TraceCheckUtils]: 68: Hoare triple {13051#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~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)); {12837#true} is VALID [2022-04-28 12:25:52,177 INFO L290 TraceCheckUtils]: 69: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:25:52,178 INFO L290 TraceCheckUtils]: 70: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:25:52,178 INFO L290 TraceCheckUtils]: 71: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:25:52,178 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12837#true} {13051#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {13051#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,178 INFO L272 TraceCheckUtils]: 73: Hoare triple {13051#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~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)); {12837#true} is VALID [2022-04-28 12:25:52,178 INFO L290 TraceCheckUtils]: 74: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:25:52,178 INFO L290 TraceCheckUtils]: 75: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:25:52,178 INFO L290 TraceCheckUtils]: 76: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:25:52,179 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {12837#true} {13051#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {13051#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,179 INFO L272 TraceCheckUtils]: 78: Hoare triple {13051#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~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 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:25:52,179 INFO L290 TraceCheckUtils]: 79: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:25:52,179 INFO L290 TraceCheckUtils]: 80: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:25:52,179 INFO L290 TraceCheckUtils]: 81: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:25:52,180 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12837#true} {13051#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {13051#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,181 INFO L290 TraceCheckUtils]: 83: Hoare triple {13051#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13100#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,181 INFO L290 TraceCheckUtils]: 84: Hoare triple {13100#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {13100#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,181 INFO L272 TraceCheckUtils]: 85: Hoare triple {13100#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:25:52,182 INFO L290 TraceCheckUtils]: 86: Hoare triple {12837#true} ~cond := #in~cond; {13040#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:25:52,182 INFO L290 TraceCheckUtils]: 87: Hoare triple {13040#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13044#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:25:52,182 INFO L290 TraceCheckUtils]: 88: Hoare triple {13044#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13044#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:25:52,183 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {13044#(not (= |__VERIFIER_assert_#in~cond| 0))} {13100#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {13119#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,184 INFO L272 TraceCheckUtils]: 90: Hoare triple {13119#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:25:52,184 INFO L290 TraceCheckUtils]: 91: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:25:52,184 INFO L290 TraceCheckUtils]: 92: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:25:52,184 INFO L290 TraceCheckUtils]: 93: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:25:52,184 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {12837#true} {13119#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} #93#return; {13119#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,184 INFO L272 TraceCheckUtils]: 95: Hoare triple {13119#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:25:52,185 INFO L290 TraceCheckUtils]: 96: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:25:52,185 INFO L290 TraceCheckUtils]: 97: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:25:52,185 INFO L290 TraceCheckUtils]: 98: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:25:52,185 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {12837#true} {13119#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} #95#return; {13119#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,185 INFO L272 TraceCheckUtils]: 100: Hoare triple {13119#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:25:52,185 INFO L290 TraceCheckUtils]: 101: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:25:52,185 INFO L290 TraceCheckUtils]: 102: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:25:52,186 INFO L290 TraceCheckUtils]: 103: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:25:52,186 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {12837#true} {13119#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} #97#return; {13119#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,187 INFO L290 TraceCheckUtils]: 105: Hoare triple {13119#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ main_~c~0 (* main_~b~0 2)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {13168#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (< main_~c~0 main_~b~0) (= main_~p~0 1))} is VALID [2022-04-28 12:25:52,188 INFO L290 TraceCheckUtils]: 106: Hoare triple {13168#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (< main_~c~0 main_~b~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {13172#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~q~0 1))} is VALID [2022-04-28 12:25:52,189 INFO L290 TraceCheckUtils]: 107: Hoare triple {13172#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~q~0 1))} assume !false; {13172#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~q~0 1))} is VALID [2022-04-28 12:25:52,189 INFO L290 TraceCheckUtils]: 108: Hoare triple {13172#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~q~0 1))} assume !(0 != ~b~0); {13179#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= (+ (* main_~y~0 2) (* main_~y~0 main_~s~0)) 0) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-28 12:25:52,190 INFO L272 TraceCheckUtils]: 109: Hoare triple {13179#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= (+ (* main_~y~0 2) (* main_~y~0 main_~s~0)) 0) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {13183#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:25:52,190 INFO L290 TraceCheckUtils]: 110: Hoare triple {13183#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13187#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:25:52,191 INFO L290 TraceCheckUtils]: 111: Hoare triple {13187#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12838#false} is VALID [2022-04-28 12:25:52,191 INFO L290 TraceCheckUtils]: 112: Hoare triple {12838#false} assume !false; {12838#false} is VALID [2022-04-28 12:25:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 61 proven. 58 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-04-28 12:25:52,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:27:09,410 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:27:57,237 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:28:04,661 INFO L290 TraceCheckUtils]: 112: Hoare triple {12838#false} assume !false; {12838#false} is VALID [2022-04-28 12:28:04,661 INFO L290 TraceCheckUtils]: 111: Hoare triple {13187#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12838#false} is VALID [2022-04-28 12:28:04,661 INFO L290 TraceCheckUtils]: 110: Hoare triple {13183#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13187#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:28:04,662 INFO L272 TraceCheckUtils]: 109: Hoare triple {13203#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {13183#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:28:04,662 INFO L290 TraceCheckUtils]: 108: Hoare triple {13207#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {13203#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-28 12:28:04,663 INFO L290 TraceCheckUtils]: 107: Hoare triple {13207#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !false; {13207#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-28 12:28:06,665 WARN L290 TraceCheckUtils]: 106: Hoare triple {13214#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {13207#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is UNKNOWN [2022-04-28 12:28:06,665 INFO L290 TraceCheckUtils]: 105: Hoare triple {13218#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {13214#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:28:06,666 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {12837#true} {13218#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0))} #97#return; {13218#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:06,666 INFO L290 TraceCheckUtils]: 103: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,666 INFO L290 TraceCheckUtils]: 102: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:28:06,666 INFO L290 TraceCheckUtils]: 101: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:28:06,666 INFO L272 TraceCheckUtils]: 100: Hoare triple {13218#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:28:06,667 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {12837#true} {13218#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0))} #95#return; {13218#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:06,667 INFO L290 TraceCheckUtils]: 98: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,667 INFO L290 TraceCheckUtils]: 97: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:28:06,667 INFO L290 TraceCheckUtils]: 96: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:28:06,667 INFO L272 TraceCheckUtils]: 95: Hoare triple {13218#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:28:06,668 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {12837#true} {13218#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0))} #93#return; {13218#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:06,668 INFO L290 TraceCheckUtils]: 93: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,668 INFO L290 TraceCheckUtils]: 92: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:28:06,668 INFO L290 TraceCheckUtils]: 91: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:28:06,668 INFO L272 TraceCheckUtils]: 90: Hoare triple {13218#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:28:06,669 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {13044#(not (= |__VERIFIER_assert_#in~cond| 0))} {13267#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} #91#return; {13218#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:06,669 INFO L290 TraceCheckUtils]: 88: Hoare triple {13044#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13044#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:28:06,669 INFO L290 TraceCheckUtils]: 87: Hoare triple {13277#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13044#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:28:06,669 INFO L290 TraceCheckUtils]: 86: Hoare triple {12837#true} ~cond := #in~cond; {13277#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:28:06,669 INFO L272 TraceCheckUtils]: 85: Hoare triple {13267#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:28:06,670 INFO L290 TraceCheckUtils]: 84: Hoare triple {13267#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} assume !false; {13267#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-28 12:28:06,730 INFO L290 TraceCheckUtils]: 83: Hoare triple {13287#(or (not (= (mod main_~a~0 main_~b~0) 0)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (< (div main_~a~0 main_~b~0) (+ main_~k~0 1)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13267#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-28 12:28:06,731 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12837#true} {13287#(or (not (= (mod main_~a~0 main_~b~0) 0)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (< (div main_~a~0 main_~b~0) (+ main_~k~0 1)))} #97#return; {13287#(or (not (= (mod main_~a~0 main_~b~0) 0)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (< (div main_~a~0 main_~b~0) (+ main_~k~0 1)))} is VALID [2022-04-28 12:28:06,731 INFO L290 TraceCheckUtils]: 81: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,731 INFO L290 TraceCheckUtils]: 80: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:28:06,731 INFO L290 TraceCheckUtils]: 79: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:28:06,731 INFO L272 TraceCheckUtils]: 78: Hoare triple {13287#(or (not (= (mod main_~a~0 main_~b~0) 0)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (< (div main_~a~0 main_~b~0) (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:28:06,732 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {12837#true} {13287#(or (not (= (mod main_~a~0 main_~b~0) 0)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (< (div main_~a~0 main_~b~0) (+ main_~k~0 1)))} #95#return; {13287#(or (not (= (mod main_~a~0 main_~b~0) 0)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (< (div main_~a~0 main_~b~0) (+ main_~k~0 1)))} is VALID [2022-04-28 12:28:06,732 INFO L290 TraceCheckUtils]: 76: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,732 INFO L290 TraceCheckUtils]: 75: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:28:06,732 INFO L290 TraceCheckUtils]: 74: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:28:06,732 INFO L272 TraceCheckUtils]: 73: Hoare triple {13287#(or (not (= (mod main_~a~0 main_~b~0) 0)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (< (div main_~a~0 main_~b~0) (+ main_~k~0 1)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:28:06,733 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12837#true} {13287#(or (not (= (mod main_~a~0 main_~b~0) 0)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (< (div main_~a~0 main_~b~0) (+ main_~k~0 1)))} #93#return; {13287#(or (not (= (mod main_~a~0 main_~b~0) 0)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (< (div main_~a~0 main_~b~0) (+ main_~k~0 1)))} is VALID [2022-04-28 12:28:06,733 INFO L290 TraceCheckUtils]: 71: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,733 INFO L290 TraceCheckUtils]: 70: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:28:06,733 INFO L290 TraceCheckUtils]: 69: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:28:06,733 INFO L272 TraceCheckUtils]: 68: Hoare triple {13287#(or (not (= (mod main_~a~0 main_~b~0) 0)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (< (div main_~a~0 main_~b~0) (+ main_~k~0 1)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:28:06,734 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {13044#(not (= |__VERIFIER_assert_#in~cond| 0))} {13336#(or (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~c~0 main_~b~0)))} #91#return; {13287#(or (not (= (mod main_~a~0 main_~b~0) 0)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (< (div main_~a~0 main_~b~0) (+ main_~k~0 1)))} is VALID [2022-04-28 12:28:06,734 INFO L290 TraceCheckUtils]: 66: Hoare triple {13044#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13044#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:28:06,734 INFO L290 TraceCheckUtils]: 65: Hoare triple {13277#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13044#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:28:06,735 INFO L290 TraceCheckUtils]: 64: Hoare triple {12837#true} ~cond := #in~cond; {13277#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:28:06,735 INFO L272 TraceCheckUtils]: 63: Hoare triple {13336#(or (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:28:06,735 INFO L290 TraceCheckUtils]: 62: Hoare triple {13336#(or (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~c~0 main_~b~0)))} assume !false; {13336#(or (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-28 12:28:06,737 INFO L290 TraceCheckUtils]: 61: Hoare triple {13355#(or (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (< (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) (+ main_~k~0 1)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13336#(or (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-28 12:28:06,738 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12837#true} {13355#(or (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (< (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) (+ main_~k~0 1)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #97#return; {13355#(or (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (< (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) (+ main_~k~0 1)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:28:06,738 INFO L290 TraceCheckUtils]: 59: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,738 INFO L290 TraceCheckUtils]: 58: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:28:06,738 INFO L290 TraceCheckUtils]: 57: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:28:06,738 INFO L272 TraceCheckUtils]: 56: Hoare triple {13355#(or (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (< (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) (+ main_~k~0 1)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:28:06,739 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12837#true} {13355#(or (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (< (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) (+ main_~k~0 1)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #95#return; {13355#(or (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (< (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) (+ main_~k~0 1)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:28:06,739 INFO L290 TraceCheckUtils]: 54: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,739 INFO L290 TraceCheckUtils]: 53: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:28:06,739 INFO L290 TraceCheckUtils]: 52: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:28:06,739 INFO L272 TraceCheckUtils]: 51: Hoare triple {13355#(or (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (< (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) (+ main_~k~0 1)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~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)); {12837#true} is VALID [2022-04-28 12:28:06,740 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12837#true} {13355#(or (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (< (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) (+ main_~k~0 1)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #93#return; {13355#(or (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (< (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) (+ main_~k~0 1)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:28:06,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:28:06,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:28:06,740 INFO L272 TraceCheckUtils]: 46: Hoare triple {13355#(or (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (< (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) (+ main_~k~0 1)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~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)); {12837#true} is VALID [2022-04-28 12:28:06,741 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12837#true} {13355#(or (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (< (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) (+ main_~k~0 1)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #91#return; {13355#(or (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (< (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) (+ main_~k~0 1)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:28:06,741 INFO L290 TraceCheckUtils]: 44: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,741 INFO L290 TraceCheckUtils]: 43: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:28:06,741 INFO L290 TraceCheckUtils]: 42: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:28:06,741 INFO L272 TraceCheckUtils]: 41: Hoare triple {13355#(or (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (< (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) (+ main_~k~0 1)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:28:06,741 INFO L290 TraceCheckUtils]: 40: Hoare triple {13355#(or (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (< (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) (+ main_~k~0 1)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {13355#(or (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (< (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) (+ main_~k~0 1)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:28:06,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {13422#(or (not (= main_~a~0 (* main_~b~0 2))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13355#(or (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (< (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) (+ main_~k~0 1)) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:28:06,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {13422#(or (not (= main_~a~0 (* main_~b~0 2))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {13422#(or (not (= main_~a~0 (* main_~b~0 2))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:28:06,743 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12837#true} {13422#(or (not (= main_~a~0 (* main_~b~0 2))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #89#return; {13422#(or (not (= main_~a~0 (* main_~b~0 2))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:28:06,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:28:06,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:28:06,743 INFO L272 TraceCheckUtils]: 33: Hoare triple {13422#(or (not (= main_~a~0 (* main_~b~0 2))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:28:06,744 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12837#true} {13422#(or (not (= main_~a~0 (* main_~b~0 2))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #87#return; {13422#(or (not (= main_~a~0 (* main_~b~0 2))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:28:06,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:28:06,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:28:06,744 INFO L272 TraceCheckUtils]: 28: Hoare triple {13422#(or (not (= main_~a~0 (* main_~b~0 2))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:28:06,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {12837#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {13422#(or (not (= main_~a~0 (* main_~b~0 2))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:28:06,745 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12837#true} {12837#true} #85#return; {12837#true} is VALID [2022-04-28 12:28:06,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L272 TraceCheckUtils]: 22: Hoare triple {12837#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12837#true} {12837#true} #83#return; {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L272 TraceCheckUtils]: 17: Hoare triple {12837#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12837#true} {12837#true} #81#return; {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L272 TraceCheckUtils]: 12: Hoare triple {12837#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {12837#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12837#true} {12837#true} #79#return; {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {12837#true} assume !(0 == ~cond); {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {12837#true} ~cond := #in~cond; {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L272 TraceCheckUtils]: 6: Hoare triple {12837#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {12837#true} is VALID [2022-04-28 12:28:06,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {12837#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {12837#true} is VALID [2022-04-28 12:28:06,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {12837#true} call #t~ret6 := main(); {12837#true} is VALID [2022-04-28 12:28:06,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12837#true} {12837#true} #103#return; {12837#true} is VALID [2022-04-28 12:28:06,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {12837#true} assume true; {12837#true} is VALID [2022-04-28 12:28:06,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {12837#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(11, 2);call #Ultimate.allocInit(12, 3); {12837#true} is VALID [2022-04-28 12:28:06,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {12837#true} call ULTIMATE.init(); {12837#true} is VALID [2022-04-28 12:28:06,747 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 55 proven. 45 refuted. 4 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 12:28:06,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:06,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344798757] [2022-04-28 12:28:06,747 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:28:06,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352552751] [2022-04-28 12:28:06,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352552751] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:28:06,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:28:06,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 28 [2022-04-28 12:28:06,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:06,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [913537475] [2022-04-28 12:28:06,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [913537475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:06,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:06,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 12:28:06,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117462240] [2022-04-28 12:28:06,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:06,748 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 9 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 8 states have call successors, (19) Word has length 113 [2022-04-28 12:28:06,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:06,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 9 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-28 12:28:06,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:06,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 12:28:06,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:06,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 12:28:06,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=627, Unknown=4, NotChecked=0, Total=756 [2022-04-28 12:28:06,818 INFO L87 Difference]: Start difference. First operand 155 states and 201 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 9 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-28 12:28:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:15,085 INFO L93 Difference]: Finished difference Result 188 states and 247 transitions. [2022-04-28 12:28:15,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 12:28:15,085 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 9 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 8 states have call successors, (19) Word has length 113 [2022-04-28 12:28:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:28:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 9 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-28 12:28:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 117 transitions. [2022-04-28 12:28:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 9 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-28 12:28:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 117 transitions. [2022-04-28 12:28:15,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 117 transitions. [2022-04-28 12:28:15,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:15,223 INFO L225 Difference]: With dead ends: 188 [2022-04-28 12:28:15,223 INFO L226 Difference]: Without dead ends: 185 [2022-04-28 12:28:15,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=185, Invalid=933, Unknown=4, NotChecked=0, Total=1122 [2022-04-28 12:28:15,224 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 42 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 12:28:15,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 285 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 12:28:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-28 12:28:15,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2022-04-28 12:28:15,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:28:15,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 184 states, 99 states have (on average 1.121212121212121) internal successors, (111), 101 states have internal predecessors, (111), 67 states have call successors, (67), 18 states have call predecessors, (67), 17 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-28 12:28:15,621 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 184 states, 99 states have (on average 1.121212121212121) internal successors, (111), 101 states have internal predecessors, (111), 67 states have call successors, (67), 18 states have call predecessors, (67), 17 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-28 12:28:15,622 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 184 states, 99 states have (on average 1.121212121212121) internal successors, (111), 101 states have internal predecessors, (111), 67 states have call successors, (67), 18 states have call predecessors, (67), 17 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-28 12:28:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:15,625 INFO L93 Difference]: Finished difference Result 185 states and 243 transitions. [2022-04-28 12:28:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 243 transitions. [2022-04-28 12:28:15,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:15,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:15,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 99 states have (on average 1.121212121212121) internal successors, (111), 101 states have internal predecessors, (111), 67 states have call successors, (67), 18 states have call predecessors, (67), 17 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) Second operand 185 states. [2022-04-28 12:28:15,626 INFO L87 Difference]: Start difference. First operand has 184 states, 99 states have (on average 1.121212121212121) internal successors, (111), 101 states have internal predecessors, (111), 67 states have call successors, (67), 18 states have call predecessors, (67), 17 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) Second operand 185 states. [2022-04-28 12:28:15,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:15,629 INFO L93 Difference]: Finished difference Result 185 states and 243 transitions. [2022-04-28 12:28:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 243 transitions. [2022-04-28 12:28:15,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:15,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:15,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:28:15,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:28:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 99 states have (on average 1.121212121212121) internal successors, (111), 101 states have internal predecessors, (111), 67 states have call successors, (67), 18 states have call predecessors, (67), 17 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-28 12:28:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 242 transitions. [2022-04-28 12:28:15,634 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 242 transitions. Word has length 113 [2022-04-28 12:28:15,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:28:15,634 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 242 transitions. [2022-04-28 12:28:15,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 9 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-28 12:28:15,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 184 states and 242 transitions. [2022-04-28 12:28:16,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:16,077 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 242 transitions. [2022-04-28 12:28:16,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 12:28:16,078 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:16,078 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:28:16,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 12:28:16,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:16,294 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:16,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:16,294 INFO L85 PathProgramCache]: Analyzing trace with hash 884638574, now seen corresponding path program 5 times [2022-04-28 12:28:16,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:16,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1632352867] [2022-04-28 12:28:16,295 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:16,295 INFO L85 PathProgramCache]: Analyzing trace with hash 884638574, now seen corresponding path program 6 times [2022-04-28 12:28:16,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:16,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39269055] [2022-04-28 12:28:16,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:16,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:16,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:28:16,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1192667270] [2022-04-28 12:28:16,304 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:28:16,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:16,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:16,305 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:28:16,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 12:28:16,363 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 12:28:16,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:28:16,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:28:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:16,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:28:16,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {14668#true} call ULTIMATE.init(); {14668#true} is VALID [2022-04-28 12:28:16,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {14668#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(11, 2);call #Ultimate.allocInit(12, 3); {14668#true} is VALID [2022-04-28 12:28:16,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14668#true} {14668#true} #103#return; {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {14668#true} call #t~ret6 := main(); {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {14668#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L272 TraceCheckUtils]: 6: Hoare triple {14668#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14668#true} {14668#true} #79#return; {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {14668#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L272 TraceCheckUtils]: 12: Hoare triple {14668#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14668#true} {14668#true} #81#return; {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L272 TraceCheckUtils]: 17: Hoare triple {14668#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14668#true} {14668#true} #83#return; {14668#true} is VALID [2022-04-28 12:28:16,634 INFO L272 TraceCheckUtils]: 22: Hoare triple {14668#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14668#true} {14668#true} #85#return; {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {14668#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L272 TraceCheckUtils]: 28: Hoare triple {14668#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14668#true} {14668#true} #87#return; {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L272 TraceCheckUtils]: 33: Hoare triple {14668#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14668#true} {14668#true} #89#return; {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {14668#true} assume !false; {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {14668#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {14668#true} assume !false; {14668#true} is VALID [2022-04-28 12:28:16,635 INFO L272 TraceCheckUtils]: 41: Hoare triple {14668#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L290 TraceCheckUtils]: 43: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14668#true} {14668#true} #91#return; {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L272 TraceCheckUtils]: 46: Hoare triple {14668#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L290 TraceCheckUtils]: 47: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L290 TraceCheckUtils]: 48: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14668#true} {14668#true} #93#return; {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L272 TraceCheckUtils]: 51: Hoare triple {14668#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L290 TraceCheckUtils]: 52: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L290 TraceCheckUtils]: 53: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L290 TraceCheckUtils]: 54: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14668#true} {14668#true} #95#return; {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L272 TraceCheckUtils]: 56: Hoare triple {14668#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L290 TraceCheckUtils]: 57: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L290 TraceCheckUtils]: 58: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L290 TraceCheckUtils]: 59: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,636 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14668#true} {14668#true} #97#return; {14668#true} is VALID [2022-04-28 12:28:16,637 INFO L290 TraceCheckUtils]: 61: Hoare triple {14668#true} assume !(~c~0 >= ~b~0); {14856#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:16,637 INFO L290 TraceCheckUtils]: 62: Hoare triple {14856#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {14860#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:28:16,637 INFO L290 TraceCheckUtils]: 63: Hoare triple {14860#(< main_~b~0 main_~a~0)} assume !false; {14860#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:28:16,638 INFO L290 TraceCheckUtils]: 64: Hoare triple {14860#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14867#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:28:16,638 INFO L290 TraceCheckUtils]: 65: Hoare triple {14867#(< main_~b~0 main_~c~0)} assume !false; {14867#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:28:16,638 INFO L272 TraceCheckUtils]: 66: Hoare triple {14867#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,638 INFO L290 TraceCheckUtils]: 67: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,638 INFO L290 TraceCheckUtils]: 68: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,638 INFO L290 TraceCheckUtils]: 69: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,639 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {14668#true} {14867#(< main_~b~0 main_~c~0)} #91#return; {14867#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:28:16,639 INFO L272 TraceCheckUtils]: 71: Hoare triple {14867#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,639 INFO L290 TraceCheckUtils]: 72: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,639 INFO L290 TraceCheckUtils]: 73: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,639 INFO L290 TraceCheckUtils]: 74: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,639 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {14668#true} {14867#(< main_~b~0 main_~c~0)} #93#return; {14867#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:28:16,639 INFO L272 TraceCheckUtils]: 76: Hoare triple {14867#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,639 INFO L290 TraceCheckUtils]: 77: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,639 INFO L290 TraceCheckUtils]: 78: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,640 INFO L290 TraceCheckUtils]: 79: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,640 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {14668#true} {14867#(< main_~b~0 main_~c~0)} #95#return; {14867#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:28:16,640 INFO L272 TraceCheckUtils]: 81: Hoare triple {14867#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,640 INFO L290 TraceCheckUtils]: 82: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,640 INFO L290 TraceCheckUtils]: 83: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,640 INFO L290 TraceCheckUtils]: 84: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,641 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {14668#true} {14867#(< main_~b~0 main_~c~0)} #97#return; {14867#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:28:16,642 INFO L290 TraceCheckUtils]: 86: Hoare triple {14867#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14934#(< 0 main_~c~0)} is VALID [2022-04-28 12:28:16,642 INFO L290 TraceCheckUtils]: 87: Hoare triple {14934#(< 0 main_~c~0)} assume !false; {14934#(< 0 main_~c~0)} is VALID [2022-04-28 12:28:16,642 INFO L272 TraceCheckUtils]: 88: Hoare triple {14934#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,642 INFO L290 TraceCheckUtils]: 89: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,642 INFO L290 TraceCheckUtils]: 90: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,642 INFO L290 TraceCheckUtils]: 91: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,642 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14668#true} {14934#(< 0 main_~c~0)} #91#return; {14934#(< 0 main_~c~0)} is VALID [2022-04-28 12:28:16,643 INFO L272 TraceCheckUtils]: 93: Hoare triple {14934#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,643 INFO L290 TraceCheckUtils]: 94: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,643 INFO L290 TraceCheckUtils]: 95: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,643 INFO L290 TraceCheckUtils]: 96: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,643 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {14668#true} {14934#(< 0 main_~c~0)} #93#return; {14934#(< 0 main_~c~0)} is VALID [2022-04-28 12:28:16,643 INFO L272 TraceCheckUtils]: 98: Hoare triple {14934#(< 0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,643 INFO L290 TraceCheckUtils]: 99: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,643 INFO L290 TraceCheckUtils]: 100: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,643 INFO L290 TraceCheckUtils]: 101: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,644 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {14668#true} {14934#(< 0 main_~c~0)} #95#return; {14934#(< 0 main_~c~0)} is VALID [2022-04-28 12:28:16,644 INFO L272 TraceCheckUtils]: 103: Hoare triple {14934#(< 0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,644 INFO L290 TraceCheckUtils]: 104: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,644 INFO L290 TraceCheckUtils]: 105: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,644 INFO L290 TraceCheckUtils]: 106: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,645 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {14668#true} {14934#(< 0 main_~c~0)} #97#return; {14934#(< 0 main_~c~0)} is VALID [2022-04-28 12:28:16,645 INFO L290 TraceCheckUtils]: 108: Hoare triple {14934#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {14934#(< 0 main_~c~0)} is VALID [2022-04-28 12:28:16,645 INFO L290 TraceCheckUtils]: 109: Hoare triple {14934#(< 0 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15004#(< 0 main_~b~0)} is VALID [2022-04-28 12:28:16,645 INFO L290 TraceCheckUtils]: 110: Hoare triple {15004#(< 0 main_~b~0)} assume !false; {15004#(< 0 main_~b~0)} is VALID [2022-04-28 12:28:16,646 INFO L290 TraceCheckUtils]: 111: Hoare triple {15004#(< 0 main_~b~0)} assume !(0 != ~b~0); {14669#false} is VALID [2022-04-28 12:28:16,646 INFO L272 TraceCheckUtils]: 112: Hoare triple {14669#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {14669#false} is VALID [2022-04-28 12:28:16,646 INFO L290 TraceCheckUtils]: 113: Hoare triple {14669#false} ~cond := #in~cond; {14669#false} is VALID [2022-04-28 12:28:16,646 INFO L290 TraceCheckUtils]: 114: Hoare triple {14669#false} assume 0 == ~cond; {14669#false} is VALID [2022-04-28 12:28:16,646 INFO L290 TraceCheckUtils]: 115: Hoare triple {14669#false} assume !false; {14669#false} is VALID [2022-04-28 12:28:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-04-28 12:28:16,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:28:16,925 INFO L290 TraceCheckUtils]: 115: Hoare triple {14669#false} assume !false; {14669#false} is VALID [2022-04-28 12:28:16,925 INFO L290 TraceCheckUtils]: 114: Hoare triple {14669#false} assume 0 == ~cond; {14669#false} is VALID [2022-04-28 12:28:16,925 INFO L290 TraceCheckUtils]: 113: Hoare triple {14669#false} ~cond := #in~cond; {14669#false} is VALID [2022-04-28 12:28:16,925 INFO L272 TraceCheckUtils]: 112: Hoare triple {14669#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {14669#false} is VALID [2022-04-28 12:28:16,925 INFO L290 TraceCheckUtils]: 111: Hoare triple {15004#(< 0 main_~b~0)} assume !(0 != ~b~0); {14669#false} is VALID [2022-04-28 12:28:16,926 INFO L290 TraceCheckUtils]: 110: Hoare triple {15004#(< 0 main_~b~0)} assume !false; {15004#(< 0 main_~b~0)} is VALID [2022-04-28 12:28:16,926 INFO L290 TraceCheckUtils]: 109: Hoare triple {14934#(< 0 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15004#(< 0 main_~b~0)} is VALID [2022-04-28 12:28:16,926 INFO L290 TraceCheckUtils]: 108: Hoare triple {14934#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {14934#(< 0 main_~c~0)} is VALID [2022-04-28 12:28:16,927 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {14668#true} {14934#(< 0 main_~c~0)} #97#return; {14934#(< 0 main_~c~0)} is VALID [2022-04-28 12:28:16,927 INFO L290 TraceCheckUtils]: 106: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,927 INFO L290 TraceCheckUtils]: 105: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,927 INFO L290 TraceCheckUtils]: 104: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,927 INFO L272 TraceCheckUtils]: 103: Hoare triple {14934#(< 0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,928 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {14668#true} {14934#(< 0 main_~c~0)} #95#return; {14934#(< 0 main_~c~0)} is VALID [2022-04-28 12:28:16,928 INFO L290 TraceCheckUtils]: 101: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,928 INFO L290 TraceCheckUtils]: 100: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,928 INFO L290 TraceCheckUtils]: 99: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,928 INFO L272 TraceCheckUtils]: 98: Hoare triple {14934#(< 0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,928 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {14668#true} {14934#(< 0 main_~c~0)} #93#return; {14934#(< 0 main_~c~0)} is VALID [2022-04-28 12:28:16,928 INFO L290 TraceCheckUtils]: 96: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,928 INFO L290 TraceCheckUtils]: 95: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,928 INFO L290 TraceCheckUtils]: 94: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,928 INFO L272 TraceCheckUtils]: 93: Hoare triple {14934#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,929 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14668#true} {14934#(< 0 main_~c~0)} #91#return; {14934#(< 0 main_~c~0)} is VALID [2022-04-28 12:28:16,929 INFO L290 TraceCheckUtils]: 91: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,929 INFO L290 TraceCheckUtils]: 90: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,929 INFO L290 TraceCheckUtils]: 89: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,929 INFO L272 TraceCheckUtils]: 88: Hoare triple {14934#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,929 INFO L290 TraceCheckUtils]: 87: Hoare triple {14934#(< 0 main_~c~0)} assume !false; {14934#(< 0 main_~c~0)} is VALID [2022-04-28 12:28:16,930 INFO L290 TraceCheckUtils]: 86: Hoare triple {14867#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14934#(< 0 main_~c~0)} is VALID [2022-04-28 12:28:16,931 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {14668#true} {14867#(< main_~b~0 main_~c~0)} #97#return; {14867#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:28:16,931 INFO L290 TraceCheckUtils]: 84: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,931 INFO L290 TraceCheckUtils]: 83: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,931 INFO L290 TraceCheckUtils]: 82: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,931 INFO L272 TraceCheckUtils]: 81: Hoare triple {14867#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,931 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {14668#true} {14867#(< main_~b~0 main_~c~0)} #95#return; {14867#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:28:16,932 INFO L290 TraceCheckUtils]: 79: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,932 INFO L290 TraceCheckUtils]: 78: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,932 INFO L290 TraceCheckUtils]: 77: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,932 INFO L272 TraceCheckUtils]: 76: Hoare triple {14867#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,932 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {14668#true} {14867#(< main_~b~0 main_~c~0)} #93#return; {14867#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:28:16,932 INFO L290 TraceCheckUtils]: 74: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,932 INFO L290 TraceCheckUtils]: 73: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,932 INFO L290 TraceCheckUtils]: 72: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,932 INFO L272 TraceCheckUtils]: 71: Hoare triple {14867#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,933 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {14668#true} {14867#(< main_~b~0 main_~c~0)} #91#return; {14867#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:28:16,933 INFO L290 TraceCheckUtils]: 69: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,933 INFO L290 TraceCheckUtils]: 68: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,933 INFO L290 TraceCheckUtils]: 67: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,933 INFO L272 TraceCheckUtils]: 66: Hoare triple {14867#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,933 INFO L290 TraceCheckUtils]: 65: Hoare triple {14867#(< main_~b~0 main_~c~0)} assume !false; {14867#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:28:16,934 INFO L290 TraceCheckUtils]: 64: Hoare triple {14860#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14867#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:28:16,934 INFO L290 TraceCheckUtils]: 63: Hoare triple {14860#(< main_~b~0 main_~a~0)} assume !false; {14860#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:28:16,934 INFO L290 TraceCheckUtils]: 62: Hoare triple {14856#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {14860#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:28:16,934 INFO L290 TraceCheckUtils]: 61: Hoare triple {14668#true} assume !(~c~0 >= ~b~0); {14856#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:16,934 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14668#true} {14668#true} #97#return; {14668#true} is VALID [2022-04-28 12:28:16,934 INFO L290 TraceCheckUtils]: 59: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L290 TraceCheckUtils]: 58: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L290 TraceCheckUtils]: 57: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L272 TraceCheckUtils]: 56: Hoare triple {14668#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14668#true} {14668#true} #95#return; {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L290 TraceCheckUtils]: 54: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L290 TraceCheckUtils]: 52: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L272 TraceCheckUtils]: 51: Hoare triple {14668#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14668#true} {14668#true} #93#return; {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L290 TraceCheckUtils]: 49: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L290 TraceCheckUtils]: 48: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L290 TraceCheckUtils]: 47: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L272 TraceCheckUtils]: 46: Hoare triple {14668#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14668#true} {14668#true} #91#return; {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L290 TraceCheckUtils]: 43: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L272 TraceCheckUtils]: 41: Hoare triple {14668#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L290 TraceCheckUtils]: 40: Hoare triple {14668#true} assume !false; {14668#true} is VALID [2022-04-28 12:28:16,935 INFO L290 TraceCheckUtils]: 39: Hoare triple {14668#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14668#true} is VALID [2022-04-28 12:28:16,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {14668#true} assume !false; {14668#true} is VALID [2022-04-28 12:28:16,941 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14668#true} {14668#true} #89#return; {14668#true} is VALID [2022-04-28 12:28:16,941 INFO L290 TraceCheckUtils]: 36: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,941 INFO L290 TraceCheckUtils]: 35: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,941 INFO L290 TraceCheckUtils]: 34: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,941 INFO L272 TraceCheckUtils]: 33: Hoare triple {14668#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,941 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14668#true} {14668#true} #87#return; {14668#true} is VALID [2022-04-28 12:28:16,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L272 TraceCheckUtils]: 28: Hoare triple {14668#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {14668#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14668#true} {14668#true} #85#return; {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L290 TraceCheckUtils]: 24: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L290 TraceCheckUtils]: 23: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L272 TraceCheckUtils]: 22: Hoare triple {14668#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14668#true} {14668#true} #83#return; {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L272 TraceCheckUtils]: 17: Hoare triple {14668#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14668#true} {14668#true} #81#return; {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L272 TraceCheckUtils]: 12: Hoare triple {14668#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {14668#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14668#true} {14668#true} #79#return; {14668#true} is VALID [2022-04-28 12:28:16,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {14668#true} assume !(0 == ~cond); {14668#true} is VALID [2022-04-28 12:28:16,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {14668#true} ~cond := #in~cond; {14668#true} is VALID [2022-04-28 12:28:16,943 INFO L272 TraceCheckUtils]: 6: Hoare triple {14668#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {14668#true} is VALID [2022-04-28 12:28:16,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {14668#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {14668#true} is VALID [2022-04-28 12:28:16,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {14668#true} call #t~ret6 := main(); {14668#true} is VALID [2022-04-28 12:28:16,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14668#true} {14668#true} #103#return; {14668#true} is VALID [2022-04-28 12:28:16,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {14668#true} assume true; {14668#true} is VALID [2022-04-28 12:28:16,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {14668#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(11, 2);call #Ultimate.allocInit(12, 3); {14668#true} is VALID [2022-04-28 12:28:16,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {14668#true} call ULTIMATE.init(); {14668#true} is VALID [2022-04-28 12:28:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-04-28 12:28:16,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:16,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39269055] [2022-04-28 12:28:16,943 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:28:16,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192667270] [2022-04-28 12:28:16,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192667270] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:28:16,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:28:16,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-04-28 12:28:16,944 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:16,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1632352867] [2022-04-28 12:28:16,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1632352867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:16,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:16,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:28:16,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406484590] [2022-04-28 12:28:16,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:16,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 116 [2022-04-28 12:28:16,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:16,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-04-28 12:28:16,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:16,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:28:16,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:16,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:28:16,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 12:28:16,993 INFO L87 Difference]: Start difference. First operand 184 states and 242 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-04-28 12:28:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:18,225 INFO L93 Difference]: Finished difference Result 244 states and 342 transitions. [2022-04-28 12:28:18,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 12:28:18,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 116 [2022-04-28 12:28:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:28:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-04-28 12:28:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-04-28 12:28:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-04-28 12:28:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-04-28 12:28:18,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 126 transitions. [2022-04-28 12:28:18,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:18,338 INFO L225 Difference]: With dead ends: 244 [2022-04-28 12:28:18,338 INFO L226 Difference]: Without dead ends: 236 [2022-04-28 12:28:18,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 227 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-04-28 12:28:18,339 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 14 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:28:18,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 280 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:28:18,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-04-28 12:28:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 217. [2022-04-28 12:28:18,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:28:18,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand has 217 states, 112 states have (on average 1.1517857142857142) internal successors, (129), 114 states have internal predecessors, (129), 87 states have call successors, (87), 18 states have call predecessors, (87), 17 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-28 12:28:18,843 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand has 217 states, 112 states have (on average 1.1517857142857142) internal successors, (129), 114 states have internal predecessors, (129), 87 states have call successors, (87), 18 states have call predecessors, (87), 17 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-28 12:28:18,843 INFO L87 Difference]: Start difference. First operand 236 states. Second operand has 217 states, 112 states have (on average 1.1517857142857142) internal successors, (129), 114 states have internal predecessors, (129), 87 states have call successors, (87), 18 states have call predecessors, (87), 17 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-28 12:28:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:18,849 INFO L93 Difference]: Finished difference Result 236 states and 333 transitions. [2022-04-28 12:28:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 333 transitions. [2022-04-28 12:28:18,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:18,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:18,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 112 states have (on average 1.1517857142857142) internal successors, (129), 114 states have internal predecessors, (129), 87 states have call successors, (87), 18 states have call predecessors, (87), 17 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) Second operand 236 states. [2022-04-28 12:28:18,850 INFO L87 Difference]: Start difference. First operand has 217 states, 112 states have (on average 1.1517857142857142) internal successors, (129), 114 states have internal predecessors, (129), 87 states have call successors, (87), 18 states have call predecessors, (87), 17 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) Second operand 236 states. [2022-04-28 12:28:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:18,855 INFO L93 Difference]: Finished difference Result 236 states and 333 transitions. [2022-04-28 12:28:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 333 transitions. [2022-04-28 12:28:18,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:18,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:18,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:28:18,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:28:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 112 states have (on average 1.1517857142857142) internal successors, (129), 114 states have internal predecessors, (129), 87 states have call successors, (87), 18 states have call predecessors, (87), 17 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-28 12:28:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 300 transitions. [2022-04-28 12:28:18,860 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 300 transitions. Word has length 116 [2022-04-28 12:28:18,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:28:18,861 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 300 transitions. [2022-04-28 12:28:18,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-04-28 12:28:18,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 217 states and 300 transitions. [2022-04-28 12:28:19,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:19,421 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 300 transitions. [2022-04-28 12:28:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 12:28:19,422 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:19,422 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:28:19,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 12:28:19,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 12:28:19,625 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:19,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash -743412771, now seen corresponding path program 3 times [2022-04-28 12:28:19,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:19,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [882784526] [2022-04-28 12:28:19,626 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash -743412771, now seen corresponding path program 4 times [2022-04-28 12:28:19,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:19,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4201791] [2022-04-28 12:28:19,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:19,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:19,635 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:28:19,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810971058] [2022-04-28 12:28:19,636 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:28:19,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:19,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:19,636 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:28:19,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 12:28:19,690 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:28:19,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:28:19,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 12:28:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:19,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:28:19,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {16783#true} call ULTIMATE.init(); {16783#true} is VALID [2022-04-28 12:28:19,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {16783#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(11, 2);call #Ultimate.allocInit(12, 3); {16783#true} is VALID [2022-04-28 12:28:19,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16783#true} {16783#true} #103#return; {16783#true} is VALID [2022-04-28 12:28:19,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {16783#true} call #t~ret6 := main(); {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {16783#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L272 TraceCheckUtils]: 6: Hoare triple {16783#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16783#true} {16783#true} #79#return; {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {16783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L272 TraceCheckUtils]: 12: Hoare triple {16783#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16783#true} {16783#true} #81#return; {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L272 TraceCheckUtils]: 17: Hoare triple {16783#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16783#true} {16783#true} #83#return; {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L272 TraceCheckUtils]: 22: Hoare triple {16783#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16783#true} {16783#true} #85#return; {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {16783#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L272 TraceCheckUtils]: 28: Hoare triple {16783#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16783#true} {16783#true} #87#return; {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L272 TraceCheckUtils]: 33: Hoare triple {16783#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16783#true} {16783#true} #89#return; {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {16783#true} assume !false; {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L290 TraceCheckUtils]: 39: Hoare triple {16783#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L290 TraceCheckUtils]: 40: Hoare triple {16783#true} assume !false; {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L272 TraceCheckUtils]: 41: Hoare triple {16783#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,935 INFO L290 TraceCheckUtils]: 43: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16783#true} {16783#true} #91#return; {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L272 TraceCheckUtils]: 46: Hoare triple {16783#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16783#true} {16783#true} #93#return; {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L272 TraceCheckUtils]: 51: Hoare triple {16783#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L290 TraceCheckUtils]: 52: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L290 TraceCheckUtils]: 53: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L290 TraceCheckUtils]: 54: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16783#true} {16783#true} #95#return; {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L272 TraceCheckUtils]: 56: Hoare triple {16783#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L290 TraceCheckUtils]: 58: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L290 TraceCheckUtils]: 59: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16783#true} {16783#true} #97#return; {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {16783#true} assume !(~c~0 >= ~b~0); {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L290 TraceCheckUtils]: 62: Hoare triple {16783#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16783#true} is VALID [2022-04-28 12:28:19,936 INFO L290 TraceCheckUtils]: 63: Hoare triple {16783#true} assume !false; {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L290 TraceCheckUtils]: 64: Hoare triple {16783#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L290 TraceCheckUtils]: 65: Hoare triple {16783#true} assume !false; {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L272 TraceCheckUtils]: 66: Hoare triple {16783#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L290 TraceCheckUtils]: 67: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L290 TraceCheckUtils]: 68: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L290 TraceCheckUtils]: 69: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {16783#true} {16783#true} #91#return; {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L272 TraceCheckUtils]: 71: Hoare triple {16783#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L290 TraceCheckUtils]: 72: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L290 TraceCheckUtils]: 73: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L290 TraceCheckUtils]: 74: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {16783#true} {16783#true} #93#return; {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L272 TraceCheckUtils]: 76: Hoare triple {16783#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L290 TraceCheckUtils]: 77: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L290 TraceCheckUtils]: 78: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L290 TraceCheckUtils]: 79: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16783#true} {16783#true} #95#return; {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L272 TraceCheckUtils]: 81: Hoare triple {16783#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,937 INFO L290 TraceCheckUtils]: 82: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,938 INFO L290 TraceCheckUtils]: 83: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,938 INFO L290 TraceCheckUtils]: 84: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,938 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {16783#true} {16783#true} #97#return; {16783#true} is VALID [2022-04-28 12:28:19,938 INFO L290 TraceCheckUtils]: 86: Hoare triple {16783#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16783#true} is VALID [2022-04-28 12:28:19,938 INFO L290 TraceCheckUtils]: 87: Hoare triple {16783#true} assume !false; {16783#true} is VALID [2022-04-28 12:28:19,938 INFO L272 TraceCheckUtils]: 88: Hoare triple {16783#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,938 INFO L290 TraceCheckUtils]: 89: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,938 INFO L290 TraceCheckUtils]: 90: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,938 INFO L290 TraceCheckUtils]: 91: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,938 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {16783#true} {16783#true} #91#return; {16783#true} is VALID [2022-04-28 12:28:19,938 INFO L272 TraceCheckUtils]: 93: Hoare triple {16783#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,938 INFO L290 TraceCheckUtils]: 94: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,938 INFO L290 TraceCheckUtils]: 95: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,938 INFO L290 TraceCheckUtils]: 96: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,938 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {16783#true} {16783#true} #93#return; {16783#true} is VALID [2022-04-28 12:28:19,938 INFO L272 TraceCheckUtils]: 98: Hoare triple {16783#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,939 INFO L290 TraceCheckUtils]: 99: Hoare triple {16783#true} ~cond := #in~cond; {17085#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:28:19,939 INFO L290 TraceCheckUtils]: 100: Hoare triple {17085#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17089#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:28:19,939 INFO L290 TraceCheckUtils]: 101: Hoare triple {17089#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17089#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:28:19,940 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {17089#(not (= |__VERIFIER_assert_#in~cond| 0))} {16783#true} #95#return; {17096#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:19,940 INFO L272 TraceCheckUtils]: 103: Hoare triple {17096#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,940 INFO L290 TraceCheckUtils]: 104: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,940 INFO L290 TraceCheckUtils]: 105: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,940 INFO L290 TraceCheckUtils]: 106: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,940 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {16783#true} {17096#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #97#return; {17096#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:19,941 INFO L290 TraceCheckUtils]: 108: Hoare triple {17096#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {17096#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:19,941 INFO L290 TraceCheckUtils]: 109: Hoare triple {17096#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:19,941 INFO L290 TraceCheckUtils]: 110: Hoare triple {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:19,942 INFO L290 TraceCheckUtils]: 111: Hoare triple {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:19,942 INFO L290 TraceCheckUtils]: 112: Hoare triple {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:19,942 INFO L272 TraceCheckUtils]: 113: Hoare triple {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:19,942 INFO L290 TraceCheckUtils]: 114: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:19,942 INFO L290 TraceCheckUtils]: 115: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:19,942 INFO L290 TraceCheckUtils]: 116: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:19,943 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {16783#true} {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #91#return; {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:19,943 INFO L272 TraceCheckUtils]: 118: Hoare triple {17118#(= 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)); {17146#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:28:19,943 INFO L290 TraceCheckUtils]: 119: Hoare triple {17146#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17150#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:28:19,944 INFO L290 TraceCheckUtils]: 120: Hoare triple {17150#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16784#false} is VALID [2022-04-28 12:28:19,944 INFO L290 TraceCheckUtils]: 121: Hoare triple {16784#false} assume !false; {16784#false} is VALID [2022-04-28 12:28:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 73 proven. 7 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-04-28 12:28:19,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:28:30,459 INFO L290 TraceCheckUtils]: 121: Hoare triple {16784#false} assume !false; {16784#false} is VALID [2022-04-28 12:28:30,460 INFO L290 TraceCheckUtils]: 120: Hoare triple {17150#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16784#false} is VALID [2022-04-28 12:28:30,460 INFO L290 TraceCheckUtils]: 119: Hoare triple {17146#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17150#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:28:30,461 INFO L272 TraceCheckUtils]: 118: Hoare triple {17118#(= 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)); {17146#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:28:30,461 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {16783#true} {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #91#return; {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:30,461 INFO L290 TraceCheckUtils]: 116: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,461 INFO L290 TraceCheckUtils]: 115: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,462 INFO L290 TraceCheckUtils]: 114: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,462 INFO L272 TraceCheckUtils]: 113: Hoare triple {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,462 INFO L290 TraceCheckUtils]: 112: Hoare triple {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:30,462 INFO L290 TraceCheckUtils]: 111: Hoare triple {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:30,462 INFO L290 TraceCheckUtils]: 110: Hoare triple {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:30,463 INFO L290 TraceCheckUtils]: 109: Hoare triple {17096#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {17118#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:30,463 INFO L290 TraceCheckUtils]: 108: Hoare triple {17096#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {17096#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:30,464 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {16783#true} {17096#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #97#return; {17096#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:30,464 INFO L290 TraceCheckUtils]: 106: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,464 INFO L290 TraceCheckUtils]: 105: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,464 INFO L290 TraceCheckUtils]: 104: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,464 INFO L272 TraceCheckUtils]: 103: Hoare triple {17096#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,465 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {17089#(not (= |__VERIFIER_assert_#in~cond| 0))} {16783#true} #95#return; {17096#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:30,465 INFO L290 TraceCheckUtils]: 101: Hoare triple {17089#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17089#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:28:30,465 INFO L290 TraceCheckUtils]: 100: Hoare triple {17223#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17089#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:28:30,465 INFO L290 TraceCheckUtils]: 99: Hoare triple {16783#true} ~cond := #in~cond; {17223#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:28:30,466 INFO L272 TraceCheckUtils]: 98: Hoare triple {16783#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {16783#true} {16783#true} #93#return; {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L290 TraceCheckUtils]: 96: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L290 TraceCheckUtils]: 95: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L290 TraceCheckUtils]: 94: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L272 TraceCheckUtils]: 93: Hoare triple {16783#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {16783#true} {16783#true} #91#return; {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L290 TraceCheckUtils]: 91: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L290 TraceCheckUtils]: 90: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L290 TraceCheckUtils]: 89: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L272 TraceCheckUtils]: 88: Hoare triple {16783#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L290 TraceCheckUtils]: 87: Hoare triple {16783#true} assume !false; {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L290 TraceCheckUtils]: 86: Hoare triple {16783#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {16783#true} {16783#true} #97#return; {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L290 TraceCheckUtils]: 84: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L290 TraceCheckUtils]: 83: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L290 TraceCheckUtils]: 82: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L272 TraceCheckUtils]: 81: Hoare triple {16783#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,466 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16783#true} {16783#true} #95#return; {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L290 TraceCheckUtils]: 79: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L290 TraceCheckUtils]: 78: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L290 TraceCheckUtils]: 77: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L272 TraceCheckUtils]: 76: Hoare triple {16783#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {16783#true} {16783#true} #93#return; {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L290 TraceCheckUtils]: 74: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L290 TraceCheckUtils]: 73: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L290 TraceCheckUtils]: 72: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L272 TraceCheckUtils]: 71: Hoare triple {16783#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {16783#true} {16783#true} #91#return; {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L290 TraceCheckUtils]: 69: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L290 TraceCheckUtils]: 68: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L290 TraceCheckUtils]: 67: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L272 TraceCheckUtils]: 66: Hoare triple {16783#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L290 TraceCheckUtils]: 65: Hoare triple {16783#true} assume !false; {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L290 TraceCheckUtils]: 64: Hoare triple {16783#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L290 TraceCheckUtils]: 63: Hoare triple {16783#true} assume !false; {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L290 TraceCheckUtils]: 62: Hoare triple {16783#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16783#true} is VALID [2022-04-28 12:28:30,467 INFO L290 TraceCheckUtils]: 61: Hoare triple {16783#true} assume !(~c~0 >= ~b~0); {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16783#true} {16783#true} #97#return; {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L290 TraceCheckUtils]: 59: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L290 TraceCheckUtils]: 58: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L290 TraceCheckUtils]: 57: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L272 TraceCheckUtils]: 56: Hoare triple {16783#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16783#true} {16783#true} #95#return; {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L290 TraceCheckUtils]: 54: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L290 TraceCheckUtils]: 53: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L290 TraceCheckUtils]: 52: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L272 TraceCheckUtils]: 51: Hoare triple {16783#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16783#true} {16783#true} #93#return; {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L290 TraceCheckUtils]: 49: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L290 TraceCheckUtils]: 48: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L290 TraceCheckUtils]: 47: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L272 TraceCheckUtils]: 46: Hoare triple {16783#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16783#true} {16783#true} #91#return; {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,468 INFO L272 TraceCheckUtils]: 41: Hoare triple {16783#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {16783#true} assume !false; {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L290 TraceCheckUtils]: 39: Hoare triple {16783#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {16783#true} assume !false; {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16783#true} {16783#true} #89#return; {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L272 TraceCheckUtils]: 33: Hoare triple {16783#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16783#true} {16783#true} #87#return; {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L290 TraceCheckUtils]: 29: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L272 TraceCheckUtils]: 28: Hoare triple {16783#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {16783#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16783#true} {16783#true} #85#return; {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,469 INFO L272 TraceCheckUtils]: 22: Hoare triple {16783#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16783#true} {16783#true} #83#return; {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L272 TraceCheckUtils]: 17: Hoare triple {16783#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16783#true} {16783#true} #81#return; {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L272 TraceCheckUtils]: 12: Hoare triple {16783#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {16783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16783#true} {16783#true} #79#return; {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {16783#true} assume !(0 == ~cond); {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {16783#true} ~cond := #in~cond; {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L272 TraceCheckUtils]: 6: Hoare triple {16783#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {16783#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {16783#true} call #t~ret6 := main(); {16783#true} is VALID [2022-04-28 12:28:30,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16783#true} {16783#true} #103#return; {16783#true} is VALID [2022-04-28 12:28:30,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {16783#true} assume true; {16783#true} is VALID [2022-04-28 12:28:30,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {16783#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(11, 2);call #Ultimate.allocInit(12, 3); {16783#true} is VALID [2022-04-28 12:28:30,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {16783#true} call ULTIMATE.init(); {16783#true} is VALID [2022-04-28 12:28:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 73 proven. 7 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-04-28 12:28:30,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:30,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4201791] [2022-04-28 12:28:30,471 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:28:30,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810971058] [2022-04-28 12:28:30,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810971058] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:28:30,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:28:30,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 12:28:30,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:30,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [882784526] [2022-04-28 12:28:30,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [882784526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:30,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:30,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:28:30,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661202437] [2022-04-28 12:28:30,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:30,472 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2022-04-28 12:28:30,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:30,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 12:28:30,516 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-28 12:28:30,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:28:30,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:30,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:28:30,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:28:30,517 INFO L87 Difference]: Start difference. First operand 217 states and 300 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 12:28:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:31,479 INFO L93 Difference]: Finished difference Result 235 states and 314 transitions. [2022-04-28 12:28:31,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:28:31,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2022-04-28 12:28:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:28:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 12:28:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-28 12:28:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 12:28:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-28 12:28:31,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-04-28 12:28:31,533 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-28 12:28:31,537 INFO L225 Difference]: With dead ends: 235 [2022-04-28 12:28:31,537 INFO L226 Difference]: Without dead ends: 232 [2022-04-28 12:28:31,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 12:28:31,537 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 17 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:28:31,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 156 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:28:31,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-04-28 12:28:32,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2022-04-28 12:28:32,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:28:32,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-28 12:28:32,047 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-28 12:28:32,047 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-28 12:28:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:32,053 INFO L93 Difference]: Finished difference Result 232 states and 310 transitions. [2022-04-28 12:28:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 310 transitions. [2022-04-28 12:28:32,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:32,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:32,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand 232 states. [2022-04-28 12:28:32,054 INFO L87 Difference]: Start difference. First operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand 232 states. [2022-04-28 12:28:32,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:32,060 INFO L93 Difference]: Finished difference Result 232 states and 310 transitions. [2022-04-28 12:28:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 310 transitions. [2022-04-28 12:28:32,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:32,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:32,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:28:32,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:28:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-28 12:28:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 309 transitions. [2022-04-28 12:28:32,067 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 309 transitions. Word has length 122 [2022-04-28 12:28:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:28:32,067 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 309 transitions. [2022-04-28 12:28:32,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 12:28:32,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 309 transitions. [2022-04-28 12:28:32,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 309 transitions. [2022-04-28 12:28:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-28 12:28:32,661 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:32,661 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:28:32,680 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-28 12:28:32,861 WARN L477 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-28 12:28:32,861 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:32,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:32,862 INFO L85 PathProgramCache]: Analyzing trace with hash 541794983, now seen corresponding path program 5 times [2022-04-28 12:28:32,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:32,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1154701819] [2022-04-28 12:28:32,862 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:32,863 INFO L85 PathProgramCache]: Analyzing trace with hash 541794983, now seen corresponding path program 6 times [2022-04-28 12:28:32,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:32,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013787221] [2022-04-28 12:28:32,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:32,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:32,873 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:28:32,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [861500823] [2022-04-28 12:28:32,873 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:28:32,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:32,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:32,874 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-28 12:28:32,875 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-28 12:28:32,950 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 12:28:32,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:28:32,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 12:28:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:32,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:28:34,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {18925#true} call ULTIMATE.init(); {18925#true} is VALID [2022-04-28 12:28:34,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {18925#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(11, 2);call #Ultimate.allocInit(12, 3); {18925#true} is VALID [2022-04-28 12:28:34,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18925#true} {18925#true} #103#return; {18925#true} is VALID [2022-04-28 12:28:34,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {18925#true} call #t~ret6 := main(); {18925#true} is VALID [2022-04-28 12:28:34,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {18925#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {18925#true} is VALID [2022-04-28 12:28:34,154 INFO L272 TraceCheckUtils]: 6: Hoare triple {18925#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18925#true} {18925#true} #79#return; {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {18925#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L272 TraceCheckUtils]: 12: Hoare triple {18925#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18925#true} {18925#true} #81#return; {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L272 TraceCheckUtils]: 17: Hoare triple {18925#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18925#true} {18925#true} #83#return; {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L272 TraceCheckUtils]: 22: Hoare triple {18925#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,155 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18925#true} {18925#true} #85#return; {18925#true} is VALID [2022-04-28 12:28:34,156 INFO L290 TraceCheckUtils]: 27: Hoare triple {18925#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {19011#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:34,156 INFO L272 TraceCheckUtils]: 28: Hoare triple {19011#(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 assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,157 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18925#true} {19011#(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))} #87#return; {19011#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:34,157 INFO L272 TraceCheckUtils]: 33: Hoare triple {19011#(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 assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,157 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {18925#true} {19011#(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))} #89#return; {19011#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:34,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {19011#(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; {19011#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:34,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {19011#(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 !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19048#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:34,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {19048#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {19048#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:34,159 INFO L272 TraceCheckUtils]: 41: Hoare triple {19048#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,159 INFO L290 TraceCheckUtils]: 43: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,159 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {18925#true} {19048#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #91#return; {19048#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:34,159 INFO L272 TraceCheckUtils]: 46: Hoare triple {19048#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~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)); {18925#true} is VALID [2022-04-28 12:28:34,159 INFO L290 TraceCheckUtils]: 47: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,160 INFO L290 TraceCheckUtils]: 49: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,160 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18925#true} {19048#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #93#return; {19048#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:34,160 INFO L272 TraceCheckUtils]: 51: Hoare triple {19048#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~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)); {18925#true} is VALID [2022-04-28 12:28:34,160 INFO L290 TraceCheckUtils]: 52: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,160 INFO L290 TraceCheckUtils]: 53: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,160 INFO L290 TraceCheckUtils]: 54: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,161 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18925#true} {19048#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #95#return; {19048#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:34,161 INFO L272 TraceCheckUtils]: 56: Hoare triple {19048#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,161 INFO L290 TraceCheckUtils]: 57: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,161 INFO L290 TraceCheckUtils]: 58: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,161 INFO L290 TraceCheckUtils]: 59: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,162 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18925#true} {19048#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #97#return; {19048#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:34,162 INFO L290 TraceCheckUtils]: 61: Hoare triple {19048#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {19115#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:34,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {19115#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19119#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 12:28:34,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {19119#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {19119#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 12:28:34,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {19119#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19126#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 12:28:34,164 INFO L290 TraceCheckUtils]: 65: Hoare triple {19126#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {19126#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 12:28:34,164 INFO L272 TraceCheckUtils]: 66: Hoare triple {19126#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,164 INFO L290 TraceCheckUtils]: 67: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,164 INFO L290 TraceCheckUtils]: 68: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,164 INFO L290 TraceCheckUtils]: 69: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,165 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {18925#true} {19126#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #91#return; {19126#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 12:28:34,165 INFO L272 TraceCheckUtils]: 71: Hoare triple {19126#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,165 INFO L290 TraceCheckUtils]: 72: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,165 INFO L290 TraceCheckUtils]: 73: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,165 INFO L290 TraceCheckUtils]: 74: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,165 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {18925#true} {19126#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #93#return; {19126#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 12:28:34,165 INFO L272 TraceCheckUtils]: 76: Hoare triple {19126#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,166 INFO L290 TraceCheckUtils]: 77: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,166 INFO L290 TraceCheckUtils]: 78: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,166 INFO L290 TraceCheckUtils]: 79: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,166 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18925#true} {19126#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #95#return; {19126#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 12:28:34,166 INFO L272 TraceCheckUtils]: 81: Hoare triple {19126#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,166 INFO L290 TraceCheckUtils]: 82: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,166 INFO L290 TraceCheckUtils]: 83: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,166 INFO L290 TraceCheckUtils]: 84: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,167 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18925#true} {19126#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #97#return; {19126#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 12:28:34,168 INFO L290 TraceCheckUtils]: 86: Hoare triple {19126#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {19193#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1))} is VALID [2022-04-28 12:28:34,168 INFO L290 TraceCheckUtils]: 87: Hoare triple {19193#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1))} assume !false; {19193#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1))} is VALID [2022-04-28 12:28:34,168 INFO L272 TraceCheckUtils]: 88: Hoare triple {19193#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,168 INFO L290 TraceCheckUtils]: 89: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,168 INFO L290 TraceCheckUtils]: 90: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,168 INFO L290 TraceCheckUtils]: 91: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,169 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {18925#true} {19193#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1))} #91#return; {19193#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1))} is VALID [2022-04-28 12:28:34,169 INFO L272 TraceCheckUtils]: 93: Hoare triple {19193#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,169 INFO L290 TraceCheckUtils]: 94: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,169 INFO L290 TraceCheckUtils]: 95: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,169 INFO L290 TraceCheckUtils]: 96: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,170 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {18925#true} {19193#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1))} #93#return; {19193#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1))} is VALID [2022-04-28 12:28:34,170 INFO L272 TraceCheckUtils]: 98: Hoare triple {19193#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,170 INFO L290 TraceCheckUtils]: 99: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,170 INFO L290 TraceCheckUtils]: 100: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,170 INFO L290 TraceCheckUtils]: 101: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,170 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {18925#true} {19193#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1))} #95#return; {19193#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1))} is VALID [2022-04-28 12:28:34,170 INFO L272 TraceCheckUtils]: 103: Hoare triple {19193#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,171 INFO L290 TraceCheckUtils]: 104: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,171 INFO L290 TraceCheckUtils]: 105: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,171 INFO L290 TraceCheckUtils]: 106: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,171 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {18925#true} {19193#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1))} #97#return; {19193#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1))} is VALID [2022-04-28 12:28:34,172 INFO L290 TraceCheckUtils]: 108: Hoare triple {19193#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {19260#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (not (<= main_~y~0 (* main_~c~0 2))) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} is VALID [2022-04-28 12:28:34,173 INFO L290 TraceCheckUtils]: 109: Hoare triple {19260#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (not (<= main_~y~0 (* main_~c~0 2))) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19264#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 12:28:34,174 INFO L290 TraceCheckUtils]: 110: Hoare triple {19264#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !false; {19264#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 12:28:34,174 INFO L290 TraceCheckUtils]: 111: Hoare triple {19264#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19264#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 12:28:34,174 INFO L290 TraceCheckUtils]: 112: Hoare triple {19264#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !false; {19264#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 12:28:34,174 INFO L272 TraceCheckUtils]: 113: Hoare triple {19264#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:34,174 INFO L290 TraceCheckUtils]: 114: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,174 INFO L290 TraceCheckUtils]: 115: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,175 INFO L290 TraceCheckUtils]: 116: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,175 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {18925#true} {19264#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} #91#return; {19264#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 12:28:34,175 INFO L272 TraceCheckUtils]: 118: Hoare triple {19264#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) 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)); {18925#true} is VALID [2022-04-28 12:28:34,175 INFO L290 TraceCheckUtils]: 119: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:34,175 INFO L290 TraceCheckUtils]: 120: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:34,175 INFO L290 TraceCheckUtils]: 121: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:34,176 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {18925#true} {19264#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} #93#return; {19264#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 12:28:34,176 INFO L272 TraceCheckUtils]: 123: Hoare triple {19264#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) 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)); {19307#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:28:34,177 INFO L290 TraceCheckUtils]: 124: Hoare triple {19307#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19311#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:28:34,177 INFO L290 TraceCheckUtils]: 125: Hoare triple {19311#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18926#false} is VALID [2022-04-28 12:28:34,177 INFO L290 TraceCheckUtils]: 126: Hoare triple {18926#false} assume !false; {18926#false} is VALID [2022-04-28 12:28:34,177 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 28 proven. 37 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-28 12:28:34,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:28:35,674 INFO L290 TraceCheckUtils]: 126: Hoare triple {18926#false} assume !false; {18926#false} is VALID [2022-04-28 12:28:35,674 INFO L290 TraceCheckUtils]: 125: Hoare triple {19311#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18926#false} is VALID [2022-04-28 12:28:35,675 INFO L290 TraceCheckUtils]: 124: Hoare triple {19307#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19311#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:28:35,675 INFO L272 TraceCheckUtils]: 123: Hoare triple {19327#(= 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)); {19307#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:28:35,676 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {18925#true} {19327#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #93#return; {19327#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:35,676 INFO L290 TraceCheckUtils]: 121: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:35,676 INFO L290 TraceCheckUtils]: 120: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:35,676 INFO L290 TraceCheckUtils]: 119: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:35,676 INFO L272 TraceCheckUtils]: 118: Hoare triple {19327#(= 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)); {18925#true} is VALID [2022-04-28 12:28:35,677 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {18925#true} {19327#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #91#return; {19327#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:35,677 INFO L290 TraceCheckUtils]: 116: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:35,677 INFO L290 TraceCheckUtils]: 115: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:35,677 INFO L290 TraceCheckUtils]: 114: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:35,677 INFO L272 TraceCheckUtils]: 113: Hoare triple {19327#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:35,677 INFO L290 TraceCheckUtils]: 112: Hoare triple {19327#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {19327#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:35,677 INFO L290 TraceCheckUtils]: 111: Hoare triple {19327#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19327#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:35,678 INFO L290 TraceCheckUtils]: 110: Hoare triple {19327#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {19327#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:37,679 WARN L290 TraceCheckUtils]: 109: Hoare triple {19370#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19327#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-28 12:28:37,680 INFO L290 TraceCheckUtils]: 108: Hoare triple {19374#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {19370#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-28 12:28:37,681 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {18925#true} {19374#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} #97#return; {19374#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:37,681 INFO L290 TraceCheckUtils]: 106: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,681 INFO L290 TraceCheckUtils]: 105: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,681 INFO L290 TraceCheckUtils]: 104: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,681 INFO L272 TraceCheckUtils]: 103: Hoare triple {19374#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,682 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {18925#true} {19374#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} #95#return; {19374#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:37,682 INFO L290 TraceCheckUtils]: 101: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,682 INFO L290 TraceCheckUtils]: 100: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,682 INFO L290 TraceCheckUtils]: 99: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,682 INFO L272 TraceCheckUtils]: 98: Hoare triple {19374#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,682 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {18925#true} {19374#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} #93#return; {19374#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:37,683 INFO L290 TraceCheckUtils]: 96: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,683 INFO L290 TraceCheckUtils]: 95: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,683 INFO L290 TraceCheckUtils]: 94: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,683 INFO L272 TraceCheckUtils]: 93: Hoare triple {19374#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,683 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {18925#true} {19374#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} #91#return; {19374#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:37,683 INFO L290 TraceCheckUtils]: 91: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,683 INFO L290 TraceCheckUtils]: 90: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,683 INFO L290 TraceCheckUtils]: 89: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,684 INFO L272 TraceCheckUtils]: 88: Hoare triple {19374#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,684 INFO L290 TraceCheckUtils]: 87: Hoare triple {19374#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} assume !false; {19374#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:37,825 INFO L290 TraceCheckUtils]: 86: Hoare triple {19441#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {19374#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:37,826 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18925#true} {19441#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} #97#return; {19441#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-28 12:28:37,826 INFO L290 TraceCheckUtils]: 84: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,826 INFO L290 TraceCheckUtils]: 83: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,826 INFO L290 TraceCheckUtils]: 82: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,826 INFO L272 TraceCheckUtils]: 81: Hoare triple {19441#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,827 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18925#true} {19441#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} #95#return; {19441#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-28 12:28:37,827 INFO L290 TraceCheckUtils]: 79: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,827 INFO L290 TraceCheckUtils]: 78: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,827 INFO L290 TraceCheckUtils]: 77: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,827 INFO L272 TraceCheckUtils]: 76: Hoare triple {19441#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,828 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {18925#true} {19441#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} #93#return; {19441#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-28 12:28:37,828 INFO L290 TraceCheckUtils]: 74: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,828 INFO L290 TraceCheckUtils]: 73: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,828 INFO L290 TraceCheckUtils]: 72: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,828 INFO L272 TraceCheckUtils]: 71: Hoare triple {19441#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,828 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {18925#true} {19441#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} #91#return; {19441#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-28 12:28:37,829 INFO L290 TraceCheckUtils]: 69: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,829 INFO L290 TraceCheckUtils]: 68: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,829 INFO L290 TraceCheckUtils]: 67: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,829 INFO L272 TraceCheckUtils]: 66: Hoare triple {19441#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,829 INFO L290 TraceCheckUtils]: 65: Hoare triple {19441#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} assume !false; {19441#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-28 12:28:37,830 INFO L290 TraceCheckUtils]: 64: Hoare triple {19508#(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))))) (<= (* main_~b~0 2) main_~a~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19441#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-28 12:28:37,830 INFO L290 TraceCheckUtils]: 63: Hoare triple {19508#(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))))) (<= (* main_~b~0 2) main_~a~0))} assume !false; {19508#(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))))) (<= (* main_~b~0 2) main_~a~0))} is VALID [2022-04-28 12:28:37,878 INFO L290 TraceCheckUtils]: 62: Hoare triple {19515#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19508#(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))))) (<= (* main_~b~0 2) main_~a~0))} is VALID [2022-04-28 12:28:37,878 INFO L290 TraceCheckUtils]: 61: Hoare triple {19519#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {19515#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)))} is VALID [2022-04-28 12:28:37,879 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18925#true} {19519#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} #97#return; {19519#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:37,879 INFO L290 TraceCheckUtils]: 59: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,879 INFO L290 TraceCheckUtils]: 58: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,879 INFO L290 TraceCheckUtils]: 57: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,879 INFO L272 TraceCheckUtils]: 56: Hoare triple {19519#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,880 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18925#true} {19519#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} #95#return; {19519#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:37,880 INFO L290 TraceCheckUtils]: 54: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,880 INFO L290 TraceCheckUtils]: 53: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,880 INFO L290 TraceCheckUtils]: 52: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,880 INFO L272 TraceCheckUtils]: 51: Hoare triple {19519#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,881 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18925#true} {19519#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} #93#return; {19519#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:37,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,881 INFO L290 TraceCheckUtils]: 47: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,881 INFO L272 TraceCheckUtils]: 46: Hoare triple {19519#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,881 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {18925#true} {19519#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} #91#return; {19519#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:37,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,882 INFO L290 TraceCheckUtils]: 43: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,882 INFO L272 TraceCheckUtils]: 41: Hoare triple {19519#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,882 INFO L290 TraceCheckUtils]: 40: Hoare triple {19519#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} assume !false; {19519#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:37,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {19586#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~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 !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19519#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:37,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {19586#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~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; {19586#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-28 12:28:37,884 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {18925#true} {19586#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~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)))} #89#return; {19586#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-28 12:28:37,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,884 INFO L272 TraceCheckUtils]: 33: Hoare triple {19586#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~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 assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,885 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18925#true} {19586#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~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)))} #87#return; {19586#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-28 12:28:37,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,885 INFO L272 TraceCheckUtils]: 28: Hoare triple {19586#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~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 assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {18925#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {19586#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-28 12:28:37,885 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18925#true} {18925#true} #85#return; {18925#true} is VALID [2022-04-28 12:28:37,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L272 TraceCheckUtils]: 22: Hoare triple {18925#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18925#true} {18925#true} #83#return; {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L272 TraceCheckUtils]: 17: Hoare triple {18925#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18925#true} {18925#true} #81#return; {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L272 TraceCheckUtils]: 12: Hoare triple {18925#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {18925#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18925#true} {18925#true} #79#return; {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {18925#true} assume !(0 == ~cond); {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {18925#true} ~cond := #in~cond; {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L272 TraceCheckUtils]: 6: Hoare triple {18925#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {18925#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {18925#true} call #t~ret6 := main(); {18925#true} is VALID [2022-04-28 12:28:37,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18925#true} {18925#true} #103#return; {18925#true} is VALID [2022-04-28 12:28:37,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {18925#true} assume true; {18925#true} is VALID [2022-04-28 12:28:37,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {18925#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(11, 2);call #Ultimate.allocInit(12, 3); {18925#true} is VALID [2022-04-28 12:28:37,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {18925#true} call ULTIMATE.init(); {18925#true} is VALID [2022-04-28 12:28:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 36 proven. 29 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-28 12:28:37,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:37,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013787221] [2022-04-28 12:28:37,887 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:28:37,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861500823] [2022-04-28 12:28:37,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861500823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:28:37,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:28:37,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2022-04-28 12:28:37,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:37,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1154701819] [2022-04-28 12:28:37,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1154701819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:37,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:37,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 12:28:37,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069672032] [2022-04-28 12:28:37,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:37,888 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), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) Word has length 127 [2022-04-28 12:28:37,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:37,889 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), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 12:28:37,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:37,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 12:28:37,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:37,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 12:28:37,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-28 12:28:37,957 INFO L87 Difference]: Start difference. First operand 231 states and 309 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 12:28:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:41,050 INFO L93 Difference]: Finished difference Result 269 states and 358 transitions. [2022-04-28 12:28:41,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 12:28:41,050 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), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) Word has length 127 [2022-04-28 12:28:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:28:41,050 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), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 12:28:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 125 transitions. [2022-04-28 12:28:41,052 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), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 12:28:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 125 transitions. [2022-04-28 12:28:41,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 125 transitions. [2022-04-28 12:28:41,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:41,200 INFO L225 Difference]: With dead ends: 269 [2022-04-28 12:28:41,200 INFO L226 Difference]: Without dead ends: 267 [2022-04-28 12:28:41,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2022-04-28 12:28:41,201 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 22 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:28:41,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 351 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 12:28:41,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-28 12:28:41,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 264. [2022-04-28 12:28:41,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:28:41,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2022-04-28 12:28:41,840 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2022-04-28 12:28:41,840 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2022-04-28 12:28:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:41,846 INFO L93 Difference]: Finished difference Result 267 states and 356 transitions. [2022-04-28 12:28:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 356 transitions. [2022-04-28 12:28:41,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:41,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:41,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) Second operand 267 states. [2022-04-28 12:28:41,847 INFO L87 Difference]: Start difference. First operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) Second operand 267 states. [2022-04-28 12:28:41,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:41,851 INFO L93 Difference]: Finished difference Result 267 states and 356 transitions. [2022-04-28 12:28:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 356 transitions. [2022-04-28 12:28:41,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:41,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:41,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:28:41,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:28:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2022-04-28 12:28:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 353 transitions. [2022-04-28 12:28:41,858 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 353 transitions. Word has length 127 [2022-04-28 12:28:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:28:41,858 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 353 transitions. [2022-04-28 12:28:41,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 12:28:41,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 353 transitions. [2022-04-28 12:28:42,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 353 transitions. [2022-04-28 12:28:42,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-28 12:28:42,540 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:42,540 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2022-04-28 12:28:42,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 12:28:42,770 WARN L477 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-28 12:28:42,770 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:42,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:42,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2138166692, now seen corresponding path program 7 times [2022-04-28 12:28:42,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:42,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [376215829] [2022-04-28 12:28:42,771 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:42,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2138166692, now seen corresponding path program 8 times [2022-04-28 12:28:42,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:42,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136333628] [2022-04-28 12:28:42,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:42,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:42,781 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:28:42,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1833136860] [2022-04-28 12:28:42,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:28:42,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:42,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:42,782 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-28 12:28:42,783 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-28 12:28:42,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:28:42,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:28:42,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 12:28:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:42,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:28:43,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {21318#true} call ULTIMATE.init(); {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {21318#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(11, 2);call #Ultimate.allocInit(12, 3); {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21318#true} {21318#true} #103#return; {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {21318#true} call #t~ret6 := main(); {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {21318#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L272 TraceCheckUtils]: 6: Hoare triple {21318#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21318#true} {21318#true} #79#return; {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {21318#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L272 TraceCheckUtils]: 12: Hoare triple {21318#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21318#true} {21318#true} #81#return; {21318#true} is VALID [2022-04-28 12:28:43,834 INFO L272 TraceCheckUtils]: 17: Hoare triple {21318#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {21318#true} is VALID [2022-04-28 12:28:43,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,835 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21318#true} {21318#true} #83#return; {21318#true} is VALID [2022-04-28 12:28:43,835 INFO L272 TraceCheckUtils]: 22: Hoare triple {21318#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {21318#true} is VALID [2022-04-28 12:28:43,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,835 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21318#true} {21318#true} #85#return; {21318#true} is VALID [2022-04-28 12:28:43,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {21318#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,835 INFO L272 TraceCheckUtils]: 28: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {21318#true} is VALID [2022-04-28 12:28:43,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,836 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21318#true} {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,836 INFO L272 TraceCheckUtils]: 33: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {21318#true} is VALID [2022-04-28 12:28:43,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,836 INFO L290 TraceCheckUtils]: 36: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,837 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {21318#true} {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,837 INFO L290 TraceCheckUtils]: 38: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,838 INFO L290 TraceCheckUtils]: 39: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,838 INFO L272 TraceCheckUtils]: 41: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21318#true} is VALID [2022-04-28 12:28:43,838 INFO L290 TraceCheckUtils]: 42: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,838 INFO L290 TraceCheckUtils]: 43: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,838 INFO L290 TraceCheckUtils]: 44: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,839 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {21318#true} {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,839 INFO L272 TraceCheckUtils]: 46: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~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)); {21318#true} is VALID [2022-04-28 12:28:43,839 INFO L290 TraceCheckUtils]: 47: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,839 INFO L290 TraceCheckUtils]: 48: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,839 INFO L290 TraceCheckUtils]: 49: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,840 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21318#true} {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,840 INFO L272 TraceCheckUtils]: 51: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~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)); {21318#true} is VALID [2022-04-28 12:28:43,840 INFO L290 TraceCheckUtils]: 52: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,840 INFO L290 TraceCheckUtils]: 53: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,840 INFO L290 TraceCheckUtils]: 54: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,841 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21318#true} {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,841 INFO L272 TraceCheckUtils]: 56: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21318#true} is VALID [2022-04-28 12:28:43,841 INFO L290 TraceCheckUtils]: 57: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,841 INFO L290 TraceCheckUtils]: 58: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,841 INFO L290 TraceCheckUtils]: 59: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,842 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {21318#true} {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,842 INFO L290 TraceCheckUtils]: 61: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,842 INFO L290 TraceCheckUtils]: 62: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,843 INFO L272 TraceCheckUtils]: 63: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21318#true} is VALID [2022-04-28 12:28:43,843 INFO L290 TraceCheckUtils]: 64: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,843 INFO L290 TraceCheckUtils]: 65: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,843 INFO L290 TraceCheckUtils]: 66: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,843 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {21318#true} {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,843 INFO L272 TraceCheckUtils]: 68: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~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)); {21318#true} is VALID [2022-04-28 12:28:43,844 INFO L290 TraceCheckUtils]: 69: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,844 INFO L290 TraceCheckUtils]: 70: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,844 INFO L290 TraceCheckUtils]: 71: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,844 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21318#true} {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,844 INFO L272 TraceCheckUtils]: 73: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~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)); {21318#true} is VALID [2022-04-28 12:28:43,844 INFO L290 TraceCheckUtils]: 74: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,844 INFO L290 TraceCheckUtils]: 75: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,844 INFO L290 TraceCheckUtils]: 76: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,845 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {21318#true} {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,845 INFO L272 TraceCheckUtils]: 78: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21318#true} is VALID [2022-04-28 12:28:43,845 INFO L290 TraceCheckUtils]: 79: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,845 INFO L290 TraceCheckUtils]: 80: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,845 INFO L290 TraceCheckUtils]: 81: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,846 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {21318#true} {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,846 INFO L290 TraceCheckUtils]: 83: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,847 INFO L290 TraceCheckUtils]: 84: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,847 INFO L272 TraceCheckUtils]: 85: Hoare triple {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21318#true} is VALID [2022-04-28 12:28:43,847 INFO L290 TraceCheckUtils]: 86: Hoare triple {21318#true} ~cond := #in~cond; {21582#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:28:43,847 INFO L290 TraceCheckUtils]: 87: Hoare triple {21582#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21586#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:28:43,847 INFO L290 TraceCheckUtils]: 88: Hoare triple {21586#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21586#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:28:43,848 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {21586#(not (= |__VERIFIER_assert_#in~cond| 0))} {21404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {21593#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,848 INFO L272 TraceCheckUtils]: 90: Hoare triple {21593#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~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)); {21318#true} is VALID [2022-04-28 12:28:43,849 INFO L290 TraceCheckUtils]: 91: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,849 INFO L290 TraceCheckUtils]: 92: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,849 INFO L290 TraceCheckUtils]: 93: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,849 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21318#true} {21593#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #93#return; {21593#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,849 INFO L272 TraceCheckUtils]: 95: Hoare triple {21593#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~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)); {21318#true} is VALID [2022-04-28 12:28:43,849 INFO L290 TraceCheckUtils]: 96: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,849 INFO L290 TraceCheckUtils]: 97: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,850 INFO L290 TraceCheckUtils]: 98: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,850 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {21318#true} {21593#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #95#return; {21593#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,850 INFO L272 TraceCheckUtils]: 100: Hoare triple {21593#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21318#true} is VALID [2022-04-28 12:28:43,850 INFO L290 TraceCheckUtils]: 101: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,850 INFO L290 TraceCheckUtils]: 102: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,850 INFO L290 TraceCheckUtils]: 103: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,851 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {21318#true} {21593#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #97#return; {21593#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,851 INFO L290 TraceCheckUtils]: 105: Hoare triple {21593#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {21593#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 12:28:43,853 INFO L290 TraceCheckUtils]: 106: Hoare triple {21593#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:28:43,853 INFO L290 TraceCheckUtils]: 107: Hoare triple {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:28:43,854 INFO L290 TraceCheckUtils]: 108: Hoare triple {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:28:43,854 INFO L290 TraceCheckUtils]: 109: Hoare triple {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:28:43,854 INFO L272 TraceCheckUtils]: 110: Hoare triple {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21318#true} is VALID [2022-04-28 12:28:43,854 INFO L290 TraceCheckUtils]: 111: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,854 INFO L290 TraceCheckUtils]: 112: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,854 INFO L290 TraceCheckUtils]: 113: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,855 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {21318#true} {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:28:43,855 INFO L272 TraceCheckUtils]: 115: Hoare triple {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21318#true} is VALID [2022-04-28 12:28:43,855 INFO L290 TraceCheckUtils]: 116: Hoare triple {21318#true} ~cond := #in~cond; {21318#true} is VALID [2022-04-28 12:28:43,855 INFO L290 TraceCheckUtils]: 117: Hoare triple {21318#true} assume !(0 == ~cond); {21318#true} is VALID [2022-04-28 12:28:43,855 INFO L290 TraceCheckUtils]: 118: Hoare triple {21318#true} assume true; {21318#true} is VALID [2022-04-28 12:28:43,856 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {21318#true} {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:28:43,856 INFO L272 TraceCheckUtils]: 120: Hoare triple {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21318#true} is VALID [2022-04-28 12:28:43,856 INFO L290 TraceCheckUtils]: 121: Hoare triple {21318#true} ~cond := #in~cond; {21582#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:28:43,856 INFO L290 TraceCheckUtils]: 122: Hoare triple {21582#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21586#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:28:43,857 INFO L290 TraceCheckUtils]: 123: Hoare triple {21586#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21586#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:28:43,857 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {21586#(not (= |__VERIFIER_assert_#in~cond| 0))} {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:28:43,860 INFO L272 TraceCheckUtils]: 125: Hoare triple {21645#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21703#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:28:43,861 INFO L290 TraceCheckUtils]: 126: Hoare triple {21703#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21707#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:28:43,861 INFO L290 TraceCheckUtils]: 127: Hoare triple {21707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21319#false} is VALID [2022-04-28 12:28:43,861 INFO L290 TraceCheckUtils]: 128: Hoare triple {21319#false} assume !false; {21319#false} is VALID [2022-04-28 12:28:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 91 proven. 42 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2022-04-28 12:28:43,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:29:33,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:33,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136333628] [2022-04-28 12:29:33,050 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:33,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833136860] [2022-04-28 12:29:33,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833136860] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 12:29:33,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:29:33,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 12:29:33,051 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:33,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [376215829] [2022-04-28 12:29:33,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [376215829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:33,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:33,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:29:33,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979040567] [2022-04-28 12:29:33,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:33,051 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 129 [2022-04-28 12:29:33,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:33,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-28 12:29:33,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:33,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:29:33,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:33,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:29:33,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:29:33,159 INFO L87 Difference]: Start difference. First operand 264 states and 353 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-28 12:29:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:35,483 INFO L93 Difference]: Finished difference Result 281 states and 367 transitions. [2022-04-28 12:29:35,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:29:35,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 129 [2022-04-28 12:29:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-28 12:29:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-28 12:29:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-28 12:29:35,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-28 12:29:35,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2022-04-28 12:29:35,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:35,592 INFO L225 Difference]: With dead ends: 281 [2022-04-28 12:29:35,593 INFO L226 Difference]: Without dead ends: 279 [2022-04-28 12:29:35,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-04-28 12:29:35,593 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:35,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 172 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 12:29:35,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-04-28 12:29:36,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2022-04-28 12:29:36,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:36,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 279 states. Second operand has 258 states, 143 states have (on average 1.118881118881119) internal successors, (160), 145 states have internal predecessors, (160), 88 states have call successors, (88), 27 states have call predecessors, (88), 26 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2022-04-28 12:29:36,187 INFO L74 IsIncluded]: Start isIncluded. First operand 279 states. Second operand has 258 states, 143 states have (on average 1.118881118881119) internal successors, (160), 145 states have internal predecessors, (160), 88 states have call successors, (88), 27 states have call predecessors, (88), 26 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2022-04-28 12:29:36,187 INFO L87 Difference]: Start difference. First operand 279 states. Second operand has 258 states, 143 states have (on average 1.118881118881119) internal successors, (160), 145 states have internal predecessors, (160), 88 states have call successors, (88), 27 states have call predecessors, (88), 26 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2022-04-28 12:29:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:36,191 INFO L93 Difference]: Finished difference Result 279 states and 365 transitions. [2022-04-28 12:29:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 365 transitions. [2022-04-28 12:29:36,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:36,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:36,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 143 states have (on average 1.118881118881119) internal successors, (160), 145 states have internal predecessors, (160), 88 states have call successors, (88), 27 states have call predecessors, (88), 26 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) Second operand 279 states. [2022-04-28 12:29:36,193 INFO L87 Difference]: Start difference. First operand has 258 states, 143 states have (on average 1.118881118881119) internal successors, (160), 145 states have internal predecessors, (160), 88 states have call successors, (88), 27 states have call predecessors, (88), 26 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) Second operand 279 states. [2022-04-28 12:29:36,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:36,204 INFO L93 Difference]: Finished difference Result 279 states and 365 transitions. [2022-04-28 12:29:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 365 transitions. [2022-04-28 12:29:36,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:36,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:36,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:36,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 143 states have (on average 1.118881118881119) internal successors, (160), 145 states have internal predecessors, (160), 88 states have call successors, (88), 27 states have call predecessors, (88), 26 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2022-04-28 12:29:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 334 transitions. [2022-04-28 12:29:36,210 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 334 transitions. Word has length 129 [2022-04-28 12:29:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:36,210 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 334 transitions. [2022-04-28 12:29:36,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-28 12:29:36,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 258 states and 334 transitions. [2022-04-28 12:29:36,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:36,875 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 334 transitions. [2022-04-28 12:29:36,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 12:29:36,876 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:36,876 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:29:36,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-28 12:29:37,087 WARN L477 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-28 12:29:37,088 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:37,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:37,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1899875875, now seen corresponding path program 9 times [2022-04-28 12:29:37,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:37,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [430054888] [2022-04-28 12:29:37,088 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:37,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1899875875, now seen corresponding path program 10 times [2022-04-28 12:29:37,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:37,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74475910] [2022-04-28 12:29:37,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:37,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:37,098 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:37,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2075425244] [2022-04-28 12:29:37,098 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:29:37,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:37,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:37,099 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-28 12:29:37,102 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-28 12:29:37,165 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:29:37,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:37,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-28 12:29:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:37,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:30:04,256 WARN L232 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 12:30:04,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {23480#true} call ULTIMATE.init(); {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {23480#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(11, 2);call #Ultimate.allocInit(12, 3); {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23480#true} {23480#true} #103#return; {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {23480#true} call #t~ret6 := main(); {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {23480#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {23480#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {23480#true} ~cond := #in~cond; {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {23480#true} assume !(0 == ~cond); {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23480#true} {23480#true} #79#return; {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {23480#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L272 TraceCheckUtils]: 12: Hoare triple {23480#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {23480#true} ~cond := #in~cond; {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {23480#true} assume !(0 == ~cond); {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23480#true} {23480#true} #81#return; {23480#true} is VALID [2022-04-28 12:30:04,339 INFO L272 TraceCheckUtils]: 17: Hoare triple {23480#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:04,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {23480#true} ~cond := #in~cond; {23480#true} is VALID [2022-04-28 12:30:04,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {23480#true} assume !(0 == ~cond); {23480#true} is VALID [2022-04-28 12:30:04,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:04,340 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {23480#true} {23480#true} #83#return; {23480#true} is VALID [2022-04-28 12:30:04,340 INFO L272 TraceCheckUtils]: 22: Hoare triple {23480#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:04,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {23480#true} ~cond := #in~cond; {23480#true} is VALID [2022-04-28 12:30:04,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {23480#true} assume !(0 == ~cond); {23480#true} is VALID [2022-04-28 12:30:04,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:04,340 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23480#true} {23480#true} #85#return; {23480#true} is VALID [2022-04-28 12:30:04,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {23480#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {23566#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:04,340 INFO L272 TraceCheckUtils]: 28: Hoare triple {23566#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:04,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {23480#true} ~cond := #in~cond; {23480#true} is VALID [2022-04-28 12:30:04,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {23480#true} assume !(0 == ~cond); {23480#true} is VALID [2022-04-28 12:30:04,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:04,341 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23480#true} {23566#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {23566#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:04,341 INFO L272 TraceCheckUtils]: 33: Hoare triple {23566#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:04,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {23480#true} ~cond := #in~cond; {23480#true} is VALID [2022-04-28 12:30:04,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {23480#true} assume !(0 == ~cond); {23480#true} is VALID [2022-04-28 12:30:04,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:04,342 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23480#true} {23566#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {23566#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:04,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {23566#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {23566#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:04,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {23566#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {23603#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:04,343 INFO L290 TraceCheckUtils]: 40: Hoare triple {23603#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {23603#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:04,343 INFO L272 TraceCheckUtils]: 41: Hoare triple {23603#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:04,343 INFO L290 TraceCheckUtils]: 42: Hoare triple {23480#true} ~cond := #in~cond; {23480#true} is VALID [2022-04-28 12:30:04,343 INFO L290 TraceCheckUtils]: 43: Hoare triple {23480#true} assume !(0 == ~cond); {23480#true} is VALID [2022-04-28 12:30:04,343 INFO L290 TraceCheckUtils]: 44: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:04,344 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {23480#true} {23603#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {23603#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:04,344 INFO L272 TraceCheckUtils]: 46: Hoare triple {23603#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~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)); {23480#true} is VALID [2022-04-28 12:30:04,344 INFO L290 TraceCheckUtils]: 47: Hoare triple {23480#true} ~cond := #in~cond; {23628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:04,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {23628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:04,345 INFO L290 TraceCheckUtils]: 49: Hoare triple {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:04,346 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} {23603#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {23639#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:04,346 INFO L272 TraceCheckUtils]: 51: Hoare triple {23639#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~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)); {23480#true} is VALID [2022-04-28 12:30:04,346 INFO L290 TraceCheckUtils]: 52: Hoare triple {23480#true} ~cond := #in~cond; {23480#true} is VALID [2022-04-28 12:30:04,346 INFO L290 TraceCheckUtils]: 53: Hoare triple {23480#true} assume !(0 == ~cond); {23480#true} is VALID [2022-04-28 12:30:04,346 INFO L290 TraceCheckUtils]: 54: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:04,347 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23480#true} {23639#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #95#return; {23639#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:04,347 INFO L272 TraceCheckUtils]: 56: Hoare triple {23639#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:04,347 INFO L290 TraceCheckUtils]: 57: Hoare triple {23480#true} ~cond := #in~cond; {23480#true} is VALID [2022-04-28 12:30:04,347 INFO L290 TraceCheckUtils]: 58: Hoare triple {23480#true} assume !(0 == ~cond); {23480#true} is VALID [2022-04-28 12:30:04,347 INFO L290 TraceCheckUtils]: 59: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:04,348 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {23480#true} {23639#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #97#return; {23639#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:04,348 INFO L290 TraceCheckUtils]: 61: Hoare triple {23639#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {23639#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:04,349 INFO L290 TraceCheckUtils]: 62: Hoare triple {23639#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:04,349 INFO L290 TraceCheckUtils]: 63: Hoare triple {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:04,349 INFO L290 TraceCheckUtils]: 64: Hoare triple {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:04,350 INFO L290 TraceCheckUtils]: 65: Hoare triple {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:04,350 INFO L272 TraceCheckUtils]: 66: Hoare triple {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:04,350 INFO L290 TraceCheckUtils]: 67: Hoare triple {23480#true} ~cond := #in~cond; {23480#true} is VALID [2022-04-28 12:30:04,350 INFO L290 TraceCheckUtils]: 68: Hoare triple {23480#true} assume !(0 == ~cond); {23480#true} is VALID [2022-04-28 12:30:04,350 INFO L290 TraceCheckUtils]: 69: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:04,351 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {23480#true} {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:04,351 INFO L272 TraceCheckUtils]: 71: Hoare triple {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:04,351 INFO L290 TraceCheckUtils]: 72: Hoare triple {23480#true} ~cond := #in~cond; {23480#true} is VALID [2022-04-28 12:30:04,351 INFO L290 TraceCheckUtils]: 73: Hoare triple {23480#true} assume !(0 == ~cond); {23480#true} is VALID [2022-04-28 12:30:04,351 INFO L290 TraceCheckUtils]: 74: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:04,352 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {23480#true} {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:04,352 INFO L272 TraceCheckUtils]: 76: Hoare triple {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:04,352 INFO L290 TraceCheckUtils]: 77: Hoare triple {23480#true} ~cond := #in~cond; {23480#true} is VALID [2022-04-28 12:30:04,352 INFO L290 TraceCheckUtils]: 78: Hoare triple {23480#true} assume !(0 == ~cond); {23480#true} is VALID [2022-04-28 12:30:04,352 INFO L290 TraceCheckUtils]: 79: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:04,352 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {23480#true} {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:04,352 INFO L272 TraceCheckUtils]: 81: Hoare triple {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:04,352 INFO L290 TraceCheckUtils]: 82: Hoare triple {23480#true} ~cond := #in~cond; {23480#true} is VALID [2022-04-28 12:30:04,353 INFO L290 TraceCheckUtils]: 83: Hoare triple {23480#true} assume !(0 == ~cond); {23480#true} is VALID [2022-04-28 12:30:04,353 INFO L290 TraceCheckUtils]: 84: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:04,353 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {23480#true} {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #97#return; {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:04,354 INFO L290 TraceCheckUtils]: 86: Hoare triple {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:04,354 INFO L290 TraceCheckUtils]: 87: Hoare triple {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:04,354 INFO L272 TraceCheckUtils]: 88: Hoare triple {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:04,354 INFO L290 TraceCheckUtils]: 89: Hoare triple {23480#true} ~cond := #in~cond; {23628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:04,355 INFO L290 TraceCheckUtils]: 90: Hoare triple {23628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:04,355 INFO L290 TraceCheckUtils]: 91: Hoare triple {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:04,356 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} {23676#(and (= main_~s~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {23767#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:04,356 INFO L272 TraceCheckUtils]: 93: Hoare triple {23767#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:04,356 INFO L290 TraceCheckUtils]: 94: Hoare triple {23480#true} ~cond := #in~cond; {23480#true} is VALID [2022-04-28 12:30:04,356 INFO L290 TraceCheckUtils]: 95: Hoare triple {23480#true} assume !(0 == ~cond); {23480#true} is VALID [2022-04-28 12:30:04,356 INFO L290 TraceCheckUtils]: 96: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:04,357 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {23480#true} {23767#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {23767#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:04,357 INFO L272 TraceCheckUtils]: 98: Hoare triple {23767#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:04,357 INFO L290 TraceCheckUtils]: 99: Hoare triple {23480#true} ~cond := #in~cond; {23628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:04,357 INFO L290 TraceCheckUtils]: 100: Hoare triple {23628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:04,357 INFO L290 TraceCheckUtils]: 101: Hoare triple {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:04,358 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} {23767#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {23767#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:04,358 INFO L272 TraceCheckUtils]: 103: Hoare triple {23767#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:04,358 INFO L290 TraceCheckUtils]: 104: Hoare triple {23480#true} ~cond := #in~cond; {23480#true} is VALID [2022-04-28 12:30:04,358 INFO L290 TraceCheckUtils]: 105: Hoare triple {23480#true} assume !(0 == ~cond); {23480#true} is VALID [2022-04-28 12:30:04,358 INFO L290 TraceCheckUtils]: 106: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:04,359 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {23480#true} {23767#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #97#return; {23767#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:04,359 INFO L290 TraceCheckUtils]: 108: Hoare triple {23767#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {23767#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:06,361 WARN L290 TraceCheckUtils]: 109: Hoare triple {23767#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23819#(and (= main_~r~0 0) (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (and (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0) (not (= main_~x~0 0)))) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is UNKNOWN [2022-04-28 12:30:06,362 INFO L290 TraceCheckUtils]: 110: Hoare triple {23819#(and (= main_~r~0 0) (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (and (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0) (not (= main_~x~0 0)))) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {23819#(and (= main_~r~0 0) (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (and (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0) (not (= main_~x~0 0)))) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:06,363 INFO L290 TraceCheckUtils]: 111: Hoare triple {23819#(and (= main_~r~0 0) (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (and (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0) (not (= main_~x~0 0)))) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {23819#(and (= main_~r~0 0) (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (and (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0) (not (= main_~x~0 0)))) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:06,363 INFO L290 TraceCheckUtils]: 112: Hoare triple {23819#(and (= main_~r~0 0) (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (and (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0) (not (= main_~x~0 0)))) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {23819#(and (= main_~r~0 0) (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (and (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0) (not (= main_~x~0 0)))) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:06,363 INFO L272 TraceCheckUtils]: 113: Hoare triple {23819#(and (= main_~r~0 0) (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (and (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0) (not (= main_~x~0 0)))) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:06,363 INFO L290 TraceCheckUtils]: 114: Hoare triple {23480#true} ~cond := #in~cond; {23480#true} is VALID [2022-04-28 12:30:06,363 INFO L290 TraceCheckUtils]: 115: Hoare triple {23480#true} assume !(0 == ~cond); {23480#true} is VALID [2022-04-28 12:30:06,363 INFO L290 TraceCheckUtils]: 116: Hoare triple {23480#true} assume true; {23480#true} is VALID [2022-04-28 12:30:06,364 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {23480#true} {23819#(and (= main_~r~0 0) (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (and (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0) (not (= main_~x~0 0)))) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {23819#(and (= main_~r~0 0) (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (and (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0) (not (= main_~x~0 0)))) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:06,364 INFO L272 TraceCheckUtils]: 118: Hoare triple {23819#(and (= main_~r~0 0) (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (and (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0) (not (= main_~x~0 0)))) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~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)); {23480#true} is VALID [2022-04-28 12:30:06,364 INFO L290 TraceCheckUtils]: 119: Hoare triple {23480#true} ~cond := #in~cond; {23628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:06,365 INFO L290 TraceCheckUtils]: 120: Hoare triple {23628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:06,365 INFO L290 TraceCheckUtils]: 121: Hoare triple {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:06,366 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} {23819#(and (= main_~r~0 0) (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (and (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0) (not (= main_~x~0 0)))) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {23859#(and (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (and (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0) (not (= main_~x~0 0)))) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:06,366 INFO L272 TraceCheckUtils]: 123: Hoare triple {23859#(and (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (and (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0) (not (= main_~x~0 0)))) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23480#true} is VALID [2022-04-28 12:30:06,366 INFO L290 TraceCheckUtils]: 124: Hoare triple {23480#true} ~cond := #in~cond; {23628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:06,366 INFO L290 TraceCheckUtils]: 125: Hoare triple {23628#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:06,366 INFO L290 TraceCheckUtils]: 126: Hoare triple {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:06,368 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {23632#(not (= |__VERIFIER_assert_#in~cond| 0))} {23859#(and (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (and (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0) (not (= main_~x~0 0)))) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {23875#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:30:06,384 INFO L272 TraceCheckUtils]: 128: Hoare triple {23875#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (or (= (+ main_~y~0 (* (- 1) main_~b~0)) 0) (= (mod (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) 0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {23879#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:30:06,385 INFO L290 TraceCheckUtils]: 129: Hoare triple {23879#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23883#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:06,385 INFO L290 TraceCheckUtils]: 130: Hoare triple {23883#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23481#false} is VALID [2022-04-28 12:30:06,385 INFO L290 TraceCheckUtils]: 131: Hoare triple {23481#false} assume !false; {23481#false} is VALID [2022-04-28 12:30:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 133 proven. 85 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2022-04-28 12:30:06,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:30:15,112 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:30:15,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:30:15,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74475910] [2022-04-28 12:30:15,287 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:30:15,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075425244] [2022-04-28 12:30:15,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075425244] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 12:30:15,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:30:15,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 12:30:15,287 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:30:15,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [430054888] [2022-04-28 12:30:15,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [430054888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:30:15,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:30:15,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 12:30:15,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000658557] [2022-04-28 12:30:15,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:30:15,288 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) Word has length 132 [2022-04-28 12:30:15,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:30:15,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-04-28 12:30:17,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:17,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 12:30:17,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:17,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 12:30:17,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-28 12:30:17,408 INFO L87 Difference]: Start difference. First operand 258 states and 334 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-04-28 12:30:21,968 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-28 12:30:36,313 WARN L232 SmtUtils]: Spent 14.06s on a formula simplification. DAG size of input: 36 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 12:30:37,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:37,262 INFO L93 Difference]: Finished difference Result 296 states and 384 transitions. [2022-04-28 12:30:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 12:30:37,262 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) Word has length 132 [2022-04-28 12:30:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:30:37,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-04-28 12:30:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2022-04-28 12:30:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-04-28 12:30:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2022-04-28 12:30:37,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 112 transitions. [2022-04-28 12:30:39,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 111 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:39,462 INFO L225 Difference]: With dead ends: 296 [2022-04-28 12:30:39,462 INFO L226 Difference]: Without dead ends: 294 [2022-04-28 12:30:39,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-04-28 12:30:39,463 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 35 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 12:30:39,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 207 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 415 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-04-28 12:30:39,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-04-28 12:30:40,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2022-04-28 12:30:40,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:30:40,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand has 291 states, 161 states have (on average 1.124223602484472) internal successors, (181), 163 states have internal predecessors, (181), 100 states have call successors, (100), 30 states have call predecessors, (100), 29 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) [2022-04-28 12:30:40,170 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand has 291 states, 161 states have (on average 1.124223602484472) internal successors, (181), 163 states have internal predecessors, (181), 100 states have call successors, (100), 30 states have call predecessors, (100), 29 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) [2022-04-28 12:30:40,170 INFO L87 Difference]: Start difference. First operand 294 states. Second operand has 291 states, 161 states have (on average 1.124223602484472) internal successors, (181), 163 states have internal predecessors, (181), 100 states have call successors, (100), 30 states have call predecessors, (100), 29 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) [2022-04-28 12:30:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:40,175 INFO L93 Difference]: Finished difference Result 294 states and 382 transitions. [2022-04-28 12:30:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 382 transitions. [2022-04-28 12:30:40,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:40,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:40,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 291 states, 161 states have (on average 1.124223602484472) internal successors, (181), 163 states have internal predecessors, (181), 100 states have call successors, (100), 30 states have call predecessors, (100), 29 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) Second operand 294 states. [2022-04-28 12:30:40,176 INFO L87 Difference]: Start difference. First operand has 291 states, 161 states have (on average 1.124223602484472) internal successors, (181), 163 states have internal predecessors, (181), 100 states have call successors, (100), 30 states have call predecessors, (100), 29 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) Second operand 294 states. [2022-04-28 12:30:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:40,181 INFO L93 Difference]: Finished difference Result 294 states and 382 transitions. [2022-04-28 12:30:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 382 transitions. [2022-04-28 12:30:40,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:40,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:40,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:30:40,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:30:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 161 states have (on average 1.124223602484472) internal successors, (181), 163 states have internal predecessors, (181), 100 states have call successors, (100), 30 states have call predecessors, (100), 29 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) [2022-04-28 12:30:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 379 transitions. [2022-04-28 12:30:40,188 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 379 transitions. Word has length 132 [2022-04-28 12:30:40,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:30:40,188 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 379 transitions. [2022-04-28 12:30:40,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-04-28 12:30:40,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 291 states and 379 transitions. [2022-04-28 12:30:43,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 379 transitions. [2022-04-28 12:30:43,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 12:30:43,100 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:30:43,100 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:30:43,119 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-28 12:30:43,319 WARN L477 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-28 12:30:43,319 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:30:43,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:30:43,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1068997356, now seen corresponding path program 7 times [2022-04-28 12:30:43,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:43,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [546244856] [2022-04-28 12:30:43,320 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:30:43,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1068997356, now seen corresponding path program 8 times [2022-04-28 12:30:43,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:30:43,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719040384] [2022-04-28 12:30:43,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:30:43,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:30:43,329 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:30:43,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [808333699] [2022-04-28 12:30:43,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:30:43,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:30:43,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:30:43,330 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-28 12:30:43,339 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-28 12:30:43,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:30:43,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:30:43,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-28 12:30:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:43,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:30:44,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {25676#true} call ULTIMATE.init(); {25676#true} is VALID [2022-04-28 12:30:44,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {25676#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(11, 2);call #Ultimate.allocInit(12, 3); {25676#true} is VALID [2022-04-28 12:30:44,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25676#true} {25676#true} #103#return; {25676#true} is VALID [2022-04-28 12:30:44,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {25676#true} call #t~ret6 := main(); {25676#true} is VALID [2022-04-28 12:30:44,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {25676#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {25676#true} is VALID [2022-04-28 12:30:44,895 INFO L272 TraceCheckUtils]: 6: Hoare triple {25676#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:30:44,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,895 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25676#true} {25676#true} #79#return; {25676#true} is VALID [2022-04-28 12:30:44,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {25676#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {25676#true} is VALID [2022-04-28 12:30:44,895 INFO L272 TraceCheckUtils]: 12: Hoare triple {25676#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:30:44,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,896 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25676#true} {25676#true} #81#return; {25676#true} is VALID [2022-04-28 12:30:44,896 INFO L272 TraceCheckUtils]: 17: Hoare triple {25676#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:30:44,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,896 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {25676#true} {25676#true} #83#return; {25676#true} is VALID [2022-04-28 12:30:44,896 INFO L272 TraceCheckUtils]: 22: Hoare triple {25676#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:30:44,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,896 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {25676#true} {25676#true} #85#return; {25676#true} is VALID [2022-04-28 12:30:44,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {25676#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {25762#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,897 INFO L272 TraceCheckUtils]: 28: Hoare triple {25762#(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 assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:30:44,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,897 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25676#true} {25762#(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))} #87#return; {25762#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,897 INFO L272 TraceCheckUtils]: 33: Hoare triple {25762#(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 assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:30:44,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,897 INFO L290 TraceCheckUtils]: 35: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,898 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25676#true} {25762#(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))} #89#return; {25762#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {25762#(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; {25762#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {25762#(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 !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {25799#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,899 INFO L290 TraceCheckUtils]: 40: Hoare triple {25799#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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; {25799#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,899 INFO L272 TraceCheckUtils]: 41: Hoare triple {25799#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:30:44,899 INFO L290 TraceCheckUtils]: 42: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,900 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25676#true} {25799#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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))} #91#return; {25799#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,900 INFO L272 TraceCheckUtils]: 46: Hoare triple {25799#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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)); {25676#true} is VALID [2022-04-28 12:30:44,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,900 INFO L290 TraceCheckUtils]: 49: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,901 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25676#true} {25799#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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))} #93#return; {25799#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,901 INFO L272 TraceCheckUtils]: 51: Hoare triple {25799#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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)); {25676#true} is VALID [2022-04-28 12:30:44,901 INFO L290 TraceCheckUtils]: 52: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,901 INFO L290 TraceCheckUtils]: 53: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,901 INFO L290 TraceCheckUtils]: 54: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,902 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25676#true} {25799#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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))} #95#return; {25799#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,902 INFO L272 TraceCheckUtils]: 56: Hoare triple {25799#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:30:44,902 INFO L290 TraceCheckUtils]: 57: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,902 INFO L290 TraceCheckUtils]: 58: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,902 INFO L290 TraceCheckUtils]: 59: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,902 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25676#true} {25799#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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))} #97#return; {25799#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,904 INFO L290 TraceCheckUtils]: 61: Hoare triple {25799#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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 !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {25866#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,904 INFO L290 TraceCheckUtils]: 62: Hoare triple {25866#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {25866#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,904 INFO L272 TraceCheckUtils]: 63: Hoare triple {25866#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~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 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:30:44,904 INFO L290 TraceCheckUtils]: 64: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,904 INFO L290 TraceCheckUtils]: 65: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,904 INFO L290 TraceCheckUtils]: 66: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,905 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {25676#true} {25866#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {25866#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,905 INFO L272 TraceCheckUtils]: 68: Hoare triple {25866#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~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)); {25676#true} is VALID [2022-04-28 12:30:44,905 INFO L290 TraceCheckUtils]: 69: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,905 INFO L290 TraceCheckUtils]: 70: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,905 INFO L290 TraceCheckUtils]: 71: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,906 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {25676#true} {25866#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {25866#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,906 INFO L272 TraceCheckUtils]: 73: Hoare triple {25866#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~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)); {25676#true} is VALID [2022-04-28 12:30:44,906 INFO L290 TraceCheckUtils]: 74: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,906 INFO L290 TraceCheckUtils]: 75: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,906 INFO L290 TraceCheckUtils]: 76: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,907 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {25676#true} {25866#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {25866#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,907 INFO L272 TraceCheckUtils]: 78: Hoare triple {25866#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~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 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:30:44,907 INFO L290 TraceCheckUtils]: 79: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,907 INFO L290 TraceCheckUtils]: 80: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,907 INFO L290 TraceCheckUtils]: 81: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,908 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {25676#true} {25866#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {25866#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,909 INFO L290 TraceCheckUtils]: 83: Hoare triple {25866#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {25933#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,909 INFO L290 TraceCheckUtils]: 84: Hoare triple {25933#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {25933#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,909 INFO L272 TraceCheckUtils]: 85: Hoare triple {25933#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:30:44,909 INFO L290 TraceCheckUtils]: 86: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,909 INFO L290 TraceCheckUtils]: 87: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,909 INFO L290 TraceCheckUtils]: 88: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,910 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {25676#true} {25933#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {25933#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,910 INFO L272 TraceCheckUtils]: 90: Hoare triple {25933#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= 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)); {25676#true} is VALID [2022-04-28 12:30:44,910 INFO L290 TraceCheckUtils]: 91: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,910 INFO L290 TraceCheckUtils]: 92: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,910 INFO L290 TraceCheckUtils]: 93: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,911 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25676#true} {25933#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {25933#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,911 INFO L272 TraceCheckUtils]: 95: Hoare triple {25933#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= 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)); {25676#true} is VALID [2022-04-28 12:30:44,911 INFO L290 TraceCheckUtils]: 96: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,911 INFO L290 TraceCheckUtils]: 97: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,911 INFO L290 TraceCheckUtils]: 98: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,912 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25676#true} {25933#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {25933#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,912 INFO L272 TraceCheckUtils]: 100: Hoare triple {25933#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:30:44,912 INFO L290 TraceCheckUtils]: 101: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,912 INFO L290 TraceCheckUtils]: 102: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,912 INFO L290 TraceCheckUtils]: 103: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,912 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {25676#true} {25933#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {25933#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,913 INFO L290 TraceCheckUtils]: 105: Hoare triple {25933#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {26000#(and (= (+ (- 1) main_~k~0) 2) (= main_~r~0 0) (= main_~s~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) (+ main_~c~0 main_~b~0)) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,914 INFO L290 TraceCheckUtils]: 106: Hoare triple {26000#(and (= (+ (- 1) main_~k~0) 2) (= main_~r~0 0) (= main_~s~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) (+ main_~c~0 main_~b~0)) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {26000#(and (= (+ (- 1) main_~k~0) 2) (= main_~r~0 0) (= main_~s~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) (+ main_~c~0 main_~b~0)) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,914 INFO L272 TraceCheckUtils]: 107: Hoare triple {26000#(and (= (+ (- 1) main_~k~0) 2) (= main_~r~0 0) (= main_~s~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) (+ main_~c~0 main_~b~0)) (<= 0 main_~c~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 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:30:44,914 INFO L290 TraceCheckUtils]: 108: Hoare triple {25676#true} ~cond := #in~cond; {26010#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:44,914 INFO L290 TraceCheckUtils]: 109: Hoare triple {26010#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26014#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:44,915 INFO L290 TraceCheckUtils]: 110: Hoare triple {26014#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26014#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:44,915 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {26014#(not (= |__VERIFIER_assert_#in~cond| 0))} {26000#(and (= (+ (- 1) main_~k~0) 2) (= main_~r~0 0) (= main_~s~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) (+ main_~c~0 main_~b~0)) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {26000#(and (= (+ (- 1) main_~k~0) 2) (= main_~r~0 0) (= main_~s~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) (+ main_~c~0 main_~b~0)) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,915 INFO L272 TraceCheckUtils]: 112: Hoare triple {26000#(and (= (+ (- 1) main_~k~0) 2) (= main_~r~0 0) (= main_~s~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) (+ main_~c~0 main_~b~0)) (<= 0 main_~c~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)); {25676#true} is VALID [2022-04-28 12:30:44,916 INFO L290 TraceCheckUtils]: 113: Hoare triple {25676#true} ~cond := #in~cond; {26010#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:44,916 INFO L290 TraceCheckUtils]: 114: Hoare triple {26010#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26014#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:44,916 INFO L290 TraceCheckUtils]: 115: Hoare triple {26014#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26014#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:44,917 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {26014#(not (= |__VERIFIER_assert_#in~cond| 0))} {26000#(and (= (+ (- 1) main_~k~0) 2) (= main_~r~0 0) (= main_~s~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) (+ main_~c~0 main_~b~0)) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {26036#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~k~0 3) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,917 INFO L272 TraceCheckUtils]: 117: Hoare triple {26036#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~k~0 3) (<= 0 main_~c~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)); {25676#true} is VALID [2022-04-28 12:30:44,917 INFO L290 TraceCheckUtils]: 118: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,917 INFO L290 TraceCheckUtils]: 119: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,917 INFO L290 TraceCheckUtils]: 120: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,918 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {25676#true} {26036#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~k~0 3) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #95#return; {26036#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~k~0 3) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,918 INFO L272 TraceCheckUtils]: 122: Hoare triple {26036#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~k~0 3) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:30:44,918 INFO L290 TraceCheckUtils]: 123: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:30:44,918 INFO L290 TraceCheckUtils]: 124: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:30:44,928 INFO L290 TraceCheckUtils]: 125: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:30:44,930 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {25676#true} {26036#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~k~0 3) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #97#return; {26036#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~k~0 3) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,930 INFO L290 TraceCheckUtils]: 127: Hoare triple {26036#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~k~0 3) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {26070#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~y~0 3)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~k~0 3) (not (<= main_~y~0 main_~c~0)) (<= 0 main_~c~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:44,932 INFO L290 TraceCheckUtils]: 128: Hoare triple {26070#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~y~0 3)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~k~0 3) (not (<= main_~y~0 main_~c~0)) (<= 0 main_~c~0) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {26074#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~y~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~s~0 3) 0) (= main_~q~0 1))} is VALID [2022-04-28 12:30:44,932 INFO L290 TraceCheckUtils]: 129: Hoare triple {26074#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~y~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~s~0 3) 0) (= main_~q~0 1))} assume !false; {26074#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~y~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~s~0 3) 0) (= main_~q~0 1))} is VALID [2022-04-28 12:30:44,933 INFO L290 TraceCheckUtils]: 130: Hoare triple {26074#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~y~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~s~0 3) 0) (= main_~q~0 1))} assume !(0 != ~b~0); {26081#(and (< (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~s~0 3) 0) (= main_~q~0 1) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-28 12:30:44,933 INFO L272 TraceCheckUtils]: 131: Hoare triple {26081#(and (< (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~s~0 3) 0) (= main_~q~0 1) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {26085#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:30:44,933 INFO L290 TraceCheckUtils]: 132: Hoare triple {26085#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26089#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:44,934 INFO L290 TraceCheckUtils]: 133: Hoare triple {26089#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25677#false} is VALID [2022-04-28 12:30:44,934 INFO L290 TraceCheckUtils]: 134: Hoare triple {25677#false} assume !false; {25677#false} is VALID [2022-04-28 12:30:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 102 proven. 52 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2022-04-28 12:30:44,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:32:23,050 INFO L290 TraceCheckUtils]: 134: Hoare triple {25677#false} assume !false; {25677#false} is VALID [2022-04-28 12:32:23,051 INFO L290 TraceCheckUtils]: 133: Hoare triple {26089#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25677#false} is VALID [2022-04-28 12:32:23,051 INFO L290 TraceCheckUtils]: 132: Hoare triple {26085#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26089#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:23,052 INFO L272 TraceCheckUtils]: 131: Hoare triple {26105#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {26085#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:32:23,052 INFO L290 TraceCheckUtils]: 130: Hoare triple {26109#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {26105#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-28 12:32:23,053 INFO L290 TraceCheckUtils]: 129: Hoare triple {26109#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !false; {26109#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-28 12:32:23,959 INFO L290 TraceCheckUtils]: 128: Hoare triple {26116#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {26109#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-28 12:32:23,959 INFO L290 TraceCheckUtils]: 127: Hoare triple {26120#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !(~c~0 >= ~b~0); {26116#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 12:32:23,960 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {25676#true} {26120#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #97#return; {26120#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 12:32:23,960 INFO L290 TraceCheckUtils]: 125: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:23,960 INFO L290 TraceCheckUtils]: 124: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:23,960 INFO L290 TraceCheckUtils]: 123: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:23,960 INFO L272 TraceCheckUtils]: 122: Hoare triple {26120#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:23,961 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {25676#true} {26120#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #95#return; {26120#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 12:32:23,961 INFO L290 TraceCheckUtils]: 120: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:23,961 INFO L290 TraceCheckUtils]: 119: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:23,961 INFO L290 TraceCheckUtils]: 118: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:23,961 INFO L272 TraceCheckUtils]: 117: Hoare triple {26120#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:23,962 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {26014#(not (= |__VERIFIER_assert_#in~cond| 0))} {26154#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #93#return; {26120#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 12:32:23,962 INFO L290 TraceCheckUtils]: 115: Hoare triple {26014#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26014#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:23,963 INFO L290 TraceCheckUtils]: 114: Hoare triple {26164#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {26014#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:23,963 INFO L290 TraceCheckUtils]: 113: Hoare triple {25676#true} ~cond := #in~cond; {26164#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:32:23,963 INFO L272 TraceCheckUtils]: 112: Hoare triple {26154#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:23,964 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {26014#(not (= |__VERIFIER_assert_#in~cond| 0))} {26171#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #91#return; {26154#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 12:32:23,964 INFO L290 TraceCheckUtils]: 110: Hoare triple {26014#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26014#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:23,965 INFO L290 TraceCheckUtils]: 109: Hoare triple {26164#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {26014#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:23,965 INFO L290 TraceCheckUtils]: 108: Hoare triple {25676#true} ~cond := #in~cond; {26164#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:32:23,965 INFO L272 TraceCheckUtils]: 107: Hoare triple {26171#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:23,965 INFO L290 TraceCheckUtils]: 106: Hoare triple {26171#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !false; {26171#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 12:32:24,278 INFO L290 TraceCheckUtils]: 105: Hoare triple {26190#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {26171#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 12:32:24,279 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {25676#true} {26190#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} #97#return; {26190#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-28 12:32:24,279 INFO L290 TraceCheckUtils]: 103: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:24,280 INFO L290 TraceCheckUtils]: 102: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:24,280 INFO L290 TraceCheckUtils]: 101: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:24,280 INFO L272 TraceCheckUtils]: 100: Hoare triple {26190#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:24,280 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25676#true} {26190#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} #95#return; {26190#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-28 12:32:24,280 INFO L290 TraceCheckUtils]: 98: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:24,280 INFO L290 TraceCheckUtils]: 97: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:24,280 INFO L290 TraceCheckUtils]: 96: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:24,281 INFO L272 TraceCheckUtils]: 95: Hoare triple {26190#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:24,281 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25676#true} {26190#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} #93#return; {26190#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-28 12:32:24,281 INFO L290 TraceCheckUtils]: 93: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:24,281 INFO L290 TraceCheckUtils]: 92: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:24,281 INFO L290 TraceCheckUtils]: 91: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:24,281 INFO L272 TraceCheckUtils]: 90: Hoare triple {26190#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:24,282 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {25676#true} {26190#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} #91#return; {26190#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-28 12:32:24,282 INFO L290 TraceCheckUtils]: 88: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:24,282 INFO L290 TraceCheckUtils]: 87: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:24,282 INFO L290 TraceCheckUtils]: 86: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:24,282 INFO L272 TraceCheckUtils]: 85: Hoare triple {26190#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:24,283 INFO L290 TraceCheckUtils]: 84: Hoare triple {26190#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} assume !false; {26190#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-28 12:32:24,449 INFO L290 TraceCheckUtils]: 83: Hoare triple {26257#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {26190#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-28 12:32:24,450 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {25676#true} {26257#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #97#return; {26257#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:32:24,450 INFO L290 TraceCheckUtils]: 81: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:24,450 INFO L290 TraceCheckUtils]: 80: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:24,450 INFO L290 TraceCheckUtils]: 79: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:24,450 INFO L272 TraceCheckUtils]: 78: Hoare triple {26257#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:24,451 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {25676#true} {26257#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #95#return; {26257#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:32:24,451 INFO L290 TraceCheckUtils]: 76: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:24,451 INFO L290 TraceCheckUtils]: 75: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:24,451 INFO L290 TraceCheckUtils]: 74: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:24,451 INFO L272 TraceCheckUtils]: 73: Hoare triple {26257#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~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)); {25676#true} is VALID [2022-04-28 12:32:24,452 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {25676#true} {26257#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #93#return; {26257#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:32:24,452 INFO L290 TraceCheckUtils]: 71: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:24,452 INFO L290 TraceCheckUtils]: 70: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:24,452 INFO L290 TraceCheckUtils]: 69: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:24,452 INFO L272 TraceCheckUtils]: 68: Hoare triple {26257#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~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)); {25676#true} is VALID [2022-04-28 12:32:24,453 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {25676#true} {26257#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #91#return; {26257#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:32:24,453 INFO L290 TraceCheckUtils]: 66: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:24,453 INFO L290 TraceCheckUtils]: 65: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:24,453 INFO L290 TraceCheckUtils]: 64: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:24,453 INFO L272 TraceCheckUtils]: 63: Hoare triple {26257#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:24,453 INFO L290 TraceCheckUtils]: 62: Hoare triple {26257#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {26257#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:32:26,455 WARN L290 TraceCheckUtils]: 61: Hoare triple {26324#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {26257#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is UNKNOWN [2022-04-28 12:32:26,456 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25676#true} {26324#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #97#return; {26324#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:32:26,457 INFO L290 TraceCheckUtils]: 59: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:26,457 INFO L290 TraceCheckUtils]: 58: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:26,457 INFO L290 TraceCheckUtils]: 57: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:26,457 INFO L272 TraceCheckUtils]: 56: Hoare triple {26324#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:26,458 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25676#true} {26324#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #95#return; {26324#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:32:26,458 INFO L290 TraceCheckUtils]: 54: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:26,458 INFO L290 TraceCheckUtils]: 53: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:26,458 INFO L290 TraceCheckUtils]: 52: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:26,458 INFO L272 TraceCheckUtils]: 51: Hoare triple {26324#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~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)); {25676#true} is VALID [2022-04-28 12:32:26,459 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25676#true} {26324#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #93#return; {26324#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:32:26,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:26,459 INFO L290 TraceCheckUtils]: 48: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:26,459 INFO L290 TraceCheckUtils]: 47: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:26,459 INFO L272 TraceCheckUtils]: 46: Hoare triple {26324#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~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)); {25676#true} is VALID [2022-04-28 12:32:26,460 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25676#true} {26324#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #91#return; {26324#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:32:26,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:26,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:26,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:26,460 INFO L272 TraceCheckUtils]: 41: Hoare triple {26324#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:26,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {26324#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {26324#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:32:26,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {26391#(or (not (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0)) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {26324#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:32:26,462 INFO L290 TraceCheckUtils]: 38: Hoare triple {26391#(or (not (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0)) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0))} assume !false; {26391#(or (not (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0)) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0))} is VALID [2022-04-28 12:32:26,463 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25676#true} {26391#(or (not (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0)) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0))} #89#return; {26391#(or (not (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0)) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0))} is VALID [2022-04-28 12:32:26,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:26,463 INFO L290 TraceCheckUtils]: 35: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:26,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:26,463 INFO L272 TraceCheckUtils]: 33: Hoare triple {26391#(or (not (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0)) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:26,464 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25676#true} {26391#(or (not (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0)) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0))} #87#return; {26391#(or (not (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0)) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0))} is VALID [2022-04-28 12:32:26,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:26,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:26,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:26,464 INFO L272 TraceCheckUtils]: 28: Hoare triple {26391#(or (not (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0)) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {25676#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {26391#(or (not (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0)) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 0))} is VALID [2022-04-28 12:32:26,465 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {25676#true} {25676#true} #85#return; {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L272 TraceCheckUtils]: 22: Hoare triple {25676#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {25676#true} {25676#true} #83#return; {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L272 TraceCheckUtils]: 17: Hoare triple {25676#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25676#true} {25676#true} #81#return; {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L272 TraceCheckUtils]: 12: Hoare triple {25676#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {25676#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {25676#true} is VALID [2022-04-28 12:32:26,465 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25676#true} {25676#true} #79#return; {25676#true} is VALID [2022-04-28 12:32:26,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:26,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {25676#true} assume !(0 == ~cond); {25676#true} is VALID [2022-04-28 12:32:26,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {25676#true} ~cond := #in~cond; {25676#true} is VALID [2022-04-28 12:32:26,466 INFO L272 TraceCheckUtils]: 6: Hoare triple {25676#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {25676#true} is VALID [2022-04-28 12:32:26,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {25676#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {25676#true} is VALID [2022-04-28 12:32:26,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {25676#true} call #t~ret6 := main(); {25676#true} is VALID [2022-04-28 12:32:26,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25676#true} {25676#true} #103#return; {25676#true} is VALID [2022-04-28 12:32:26,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {25676#true} assume true; {25676#true} is VALID [2022-04-28 12:32:26,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {25676#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(11, 2);call #Ultimate.allocInit(12, 3); {25676#true} is VALID [2022-04-28 12:32:26,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {25676#true} call ULTIMATE.init(); {25676#true} is VALID [2022-04-28 12:32:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 102 proven. 52 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2022-04-28 12:32:26,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:32:26,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719040384] [2022-04-28 12:32:26,467 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:32:26,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808333699] [2022-04-28 12:32:26,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808333699] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:32:26,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:32:26,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 26 [2022-04-28 12:32:26,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:32:26,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [546244856] [2022-04-28 12:32:26,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [546244856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:32:26,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:32:26,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 12:32:26,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080621689] [2022-04-28 12:32:26,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:32:26,468 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 135 [2022-04-28 12:32:26,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:32:26,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-28 12:32:26,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:26,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 12:32:26,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:26,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 12:32:26,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2022-04-28 12:32:26,549 INFO L87 Difference]: Start difference. First operand 291 states and 379 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-28 12:32:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:33,016 INFO L93 Difference]: Finished difference Result 339 states and 443 transitions. [2022-04-28 12:32:33,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 12:32:33,016 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 135 [2022-04-28 12:32:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:32:33,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-28 12:32:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2022-04-28 12:32:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-28 12:32:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2022-04-28 12:32:33,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 127 transitions. [2022-04-28 12:32:33,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:33,196 INFO L225 Difference]: With dead ends: 339 [2022-04-28 12:32:33,196 INFO L226 Difference]: Without dead ends: 332 [2022-04-28 12:32:33,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2022-04-28 12:32:33,197 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 30 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:32:33,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 352 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 12:32:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-04-28 12:32:33,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 301. [2022-04-28 12:32:33,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:32:33,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 332 states. Second operand has 301 states, 166 states have (on average 1.1265060240963856) internal successors, (187), 168 states have internal predecessors, (187), 104 states have call successors, (104), 31 states have call predecessors, (104), 30 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-28 12:32:33,904 INFO L74 IsIncluded]: Start isIncluded. First operand 332 states. Second operand has 301 states, 166 states have (on average 1.1265060240963856) internal successors, (187), 168 states have internal predecessors, (187), 104 states have call successors, (104), 31 states have call predecessors, (104), 30 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-28 12:32:33,904 INFO L87 Difference]: Start difference. First operand 332 states. Second operand has 301 states, 166 states have (on average 1.1265060240963856) internal successors, (187), 168 states have internal predecessors, (187), 104 states have call successors, (104), 31 states have call predecessors, (104), 30 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-28 12:32:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:33,910 INFO L93 Difference]: Finished difference Result 332 states and 436 transitions. [2022-04-28 12:32:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 436 transitions. [2022-04-28 12:32:33,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:33,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:33,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 301 states, 166 states have (on average 1.1265060240963856) internal successors, (187), 168 states have internal predecessors, (187), 104 states have call successors, (104), 31 states have call predecessors, (104), 30 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) Second operand 332 states. [2022-04-28 12:32:33,911 INFO L87 Difference]: Start difference. First operand has 301 states, 166 states have (on average 1.1265060240963856) internal successors, (187), 168 states have internal predecessors, (187), 104 states have call successors, (104), 31 states have call predecessors, (104), 30 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) Second operand 332 states. [2022-04-28 12:32:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:33,917 INFO L93 Difference]: Finished difference Result 332 states and 436 transitions. [2022-04-28 12:32:33,917 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 436 transitions. [2022-04-28 12:32:33,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:33,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:33,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:32:33,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:32:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 166 states have (on average 1.1265060240963856) internal successors, (187), 168 states have internal predecessors, (187), 104 states have call successors, (104), 31 states have call predecessors, (104), 30 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-28 12:32:33,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 393 transitions. [2022-04-28 12:32:33,923 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 393 transitions. Word has length 135 [2022-04-28 12:32:33,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:32:33,924 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 393 transitions. [2022-04-28 12:32:33,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-28 12:32:33,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 301 states and 393 transitions. [2022-04-28 12:32:36,917 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-28 12:32:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 393 transitions. [2022-04-28 12:32:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-28 12:32:36,918 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:32:36,918 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:32:36,934 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-28 12:32:37,118 WARN L477 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-28 12:32:37,119 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:32:37,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:32:37,119 INFO L85 PathProgramCache]: Analyzing trace with hash -896647763, now seen corresponding path program 9 times [2022-04-28 12:32:37,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:37,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [801803316] [2022-04-28 12:32:37,120 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:32:37,120 INFO L85 PathProgramCache]: Analyzing trace with hash -896647763, now seen corresponding path program 10 times [2022-04-28 12:32:37,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:32:37,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571673307] [2022-04-28 12:32:37,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:32:37,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:32:37,131 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:32:37,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [862385823] [2022-04-28 12:32:37,132 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:32:37,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:32:37,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:32:37,132 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-28 12:32:37,133 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-28 12:32:37,196 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:32:37,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:32:37,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-28 12:32:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:32:37,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:32:58,864 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:33:01,152 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:33:04,420 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:33:31,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {28463#true} call ULTIMATE.init(); {28463#true} is VALID [2022-04-28 12:33:31,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {28463#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(11, 2);call #Ultimate.allocInit(12, 3); {28463#true} is VALID [2022-04-28 12:33:31,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28463#true} {28463#true} #103#return; {28463#true} is VALID [2022-04-28 12:33:31,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {28463#true} call #t~ret6 := main(); {28463#true} is VALID [2022-04-28 12:33:31,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {28463#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {28463#true} is VALID [2022-04-28 12:33:31,409 INFO L272 TraceCheckUtils]: 6: Hoare triple {28463#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,409 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28463#true} {28463#true} #79#return; {28463#true} is VALID [2022-04-28 12:33:31,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {28463#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {28463#true} is VALID [2022-04-28 12:33:31,409 INFO L272 TraceCheckUtils]: 12: Hoare triple {28463#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {28463#true} ~cond := #in~cond; {28507#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:33:31,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {28507#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {28511#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:33:31,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {28511#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {28511#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:33:31,411 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28511#(not (= |assume_abort_if_not_#in~cond| 0))} {28463#true} #81#return; {28518#(and (<= 0 main_~y~0) (<= main_~y~0 10))} is VALID [2022-04-28 12:33:31,411 INFO L272 TraceCheckUtils]: 17: Hoare triple {28518#(and (<= 0 main_~y~0) (<= main_~y~0 10))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,411 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {28463#true} {28518#(and (<= 0 main_~y~0) (<= main_~y~0 10))} #83#return; {28518#(and (<= 0 main_~y~0) (<= main_~y~0 10))} is VALID [2022-04-28 12:33:31,411 INFO L272 TraceCheckUtils]: 22: Hoare triple {28518#(and (<= 0 main_~y~0) (<= main_~y~0 10))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,412 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {28463#true} {28518#(and (<= 0 main_~y~0) (<= main_~y~0 10))} #85#return; {28518#(and (<= 0 main_~y~0) (<= main_~y~0 10))} is VALID [2022-04-28 12:33:31,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {28518#(and (<= 0 main_~y~0) (<= main_~y~0 10))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {28552#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:33:31,412 INFO L272 TraceCheckUtils]: 28: Hoare triple {28552#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,413 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {28463#true} {28552#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #87#return; {28552#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:33:31,413 INFO L272 TraceCheckUtils]: 33: Hoare triple {28552#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,413 INFO L290 TraceCheckUtils]: 36: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,414 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {28463#true} {28552#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #89#return; {28552#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:33:31,414 INFO L290 TraceCheckUtils]: 38: Hoare triple {28552#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !false; {28552#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:33:31,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {28552#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {28589#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:33:31,415 INFO L290 TraceCheckUtils]: 40: Hoare triple {28589#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} assume !false; {28589#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:33:31,415 INFO L272 TraceCheckUtils]: 41: Hoare triple {28589#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,415 INFO L290 TraceCheckUtils]: 42: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,415 INFO L290 TraceCheckUtils]: 43: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,415 INFO L290 TraceCheckUtils]: 44: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,416 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {28463#true} {28589#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #91#return; {28589#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:33:31,416 INFO L272 TraceCheckUtils]: 46: Hoare triple {28589#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,416 INFO L290 TraceCheckUtils]: 47: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,416 INFO L290 TraceCheckUtils]: 48: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,416 INFO L290 TraceCheckUtils]: 49: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,417 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {28463#true} {28589#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #93#return; {28589#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:33:31,417 INFO L272 TraceCheckUtils]: 51: Hoare triple {28589#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,417 INFO L290 TraceCheckUtils]: 52: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,417 INFO L290 TraceCheckUtils]: 54: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,418 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28463#true} {28589#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #95#return; {28589#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:33:31,418 INFO L272 TraceCheckUtils]: 56: Hoare triple {28589#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,418 INFO L290 TraceCheckUtils]: 57: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,418 INFO L290 TraceCheckUtils]: 58: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,418 INFO L290 TraceCheckUtils]: 59: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,418 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {28463#true} {28589#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #97#return; {28589#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:33:31,419 INFO L290 TraceCheckUtils]: 61: Hoare triple {28589#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {28656#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:33:31,419 INFO L290 TraceCheckUtils]: 62: Hoare triple {28656#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 10) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {28660#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,420 INFO L290 TraceCheckUtils]: 63: Hoare triple {28660#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {28660#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,420 INFO L290 TraceCheckUtils]: 64: Hoare triple {28660#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {28667#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,421 INFO L290 TraceCheckUtils]: 65: Hoare triple {28667#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {28667#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,421 INFO L272 TraceCheckUtils]: 66: Hoare triple {28667#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,421 INFO L290 TraceCheckUtils]: 67: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,421 INFO L290 TraceCheckUtils]: 68: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,421 INFO L290 TraceCheckUtils]: 69: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,422 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {28463#true} {28667#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {28667#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,422 INFO L272 TraceCheckUtils]: 71: Hoare triple {28667#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,422 INFO L290 TraceCheckUtils]: 72: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,422 INFO L290 TraceCheckUtils]: 73: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,422 INFO L290 TraceCheckUtils]: 74: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,423 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {28463#true} {28667#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {28667#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,423 INFO L272 TraceCheckUtils]: 76: Hoare triple {28667#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,423 INFO L290 TraceCheckUtils]: 77: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,423 INFO L290 TraceCheckUtils]: 78: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,423 INFO L290 TraceCheckUtils]: 79: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,423 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {28463#true} {28667#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {28667#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,424 INFO L272 TraceCheckUtils]: 81: Hoare triple {28667#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,424 INFO L290 TraceCheckUtils]: 82: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,424 INFO L290 TraceCheckUtils]: 83: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,424 INFO L290 TraceCheckUtils]: 84: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,424 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {28463#true} {28667#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #97#return; {28667#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,426 INFO L290 TraceCheckUtils]: 86: Hoare triple {28667#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {28734#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,427 INFO L290 TraceCheckUtils]: 87: Hoare triple {28734#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {28734#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,427 INFO L272 TraceCheckUtils]: 88: Hoare triple {28734#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,427 INFO L290 TraceCheckUtils]: 89: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,427 INFO L290 TraceCheckUtils]: 90: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,427 INFO L290 TraceCheckUtils]: 91: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,427 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {28463#true} {28734#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {28734#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,428 INFO L272 TraceCheckUtils]: 93: Hoare triple {28734#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,428 INFO L290 TraceCheckUtils]: 94: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,428 INFO L290 TraceCheckUtils]: 95: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,428 INFO L290 TraceCheckUtils]: 96: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,429 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {28463#true} {28734#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {28734#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,429 INFO L272 TraceCheckUtils]: 98: Hoare triple {28734#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,429 INFO L290 TraceCheckUtils]: 99: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,429 INFO L290 TraceCheckUtils]: 100: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,429 INFO L290 TraceCheckUtils]: 101: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,430 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {28463#true} {28734#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {28734#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,430 INFO L272 TraceCheckUtils]: 103: Hoare triple {28734#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,430 INFO L290 TraceCheckUtils]: 104: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,430 INFO L290 TraceCheckUtils]: 105: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,430 INFO L290 TraceCheckUtils]: 106: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,431 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {28463#true} {28734#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #97#return; {28734#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,433 INFO L290 TraceCheckUtils]: 108: Hoare triple {28734#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {28801#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ (- 2) main_~k~0) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,433 INFO L290 TraceCheckUtils]: 109: Hoare triple {28801#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ (- 2) main_~k~0) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {28801#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ (- 2) main_~k~0) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,433 INFO L272 TraceCheckUtils]: 110: Hoare triple {28801#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ (- 2) main_~k~0) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,433 INFO L290 TraceCheckUtils]: 111: Hoare triple {28463#true} ~cond := #in~cond; {28463#true} is VALID [2022-04-28 12:33:31,433 INFO L290 TraceCheckUtils]: 112: Hoare triple {28463#true} assume !(0 == ~cond); {28463#true} is VALID [2022-04-28 12:33:31,434 INFO L290 TraceCheckUtils]: 113: Hoare triple {28463#true} assume true; {28463#true} is VALID [2022-04-28 12:33:31,434 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {28463#true} {28801#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ (- 2) main_~k~0) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {28801#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ (- 2) main_~k~0) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 12:33:31,434 INFO L272 TraceCheckUtils]: 115: Hoare triple {28801#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ (- 2) main_~k~0) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,435 INFO L290 TraceCheckUtils]: 116: Hoare triple {28463#true} ~cond := #in~cond; {28826#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:33:31,435 INFO L290 TraceCheckUtils]: 117: Hoare triple {28826#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28830#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:31,435 INFO L290 TraceCheckUtils]: 118: Hoare triple {28830#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28830#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:31,437 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {28830#(not (= |__VERIFIER_assert_#in~cond| 0))} {28801#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ (- 2) main_~k~0) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {28837#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:33:31,437 INFO L272 TraceCheckUtils]: 120: Hoare triple {28837#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* 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)); {28463#true} is VALID [2022-04-28 12:33:31,437 INFO L290 TraceCheckUtils]: 121: Hoare triple {28463#true} ~cond := #in~cond; {28826#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:33:31,437 INFO L290 TraceCheckUtils]: 122: Hoare triple {28826#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28830#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:31,437 INFO L290 TraceCheckUtils]: 123: Hoare triple {28830#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28830#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:31,438 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {28830#(not (= |__VERIFIER_assert_#in~cond| 0))} {28837#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 10) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #95#return; {28853#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 10) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:33:31,438 INFO L272 TraceCheckUtils]: 125: Hoare triple {28853#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 10) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {28463#true} is VALID [2022-04-28 12:33:31,439 INFO L290 TraceCheckUtils]: 126: Hoare triple {28463#true} ~cond := #in~cond; {28826#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:33:31,439 INFO L290 TraceCheckUtils]: 127: Hoare triple {28826#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28830#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:31,439 INFO L290 TraceCheckUtils]: 128: Hoare triple {28830#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28830#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:31,440 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {28830#(not (= |__VERIFIER_assert_#in~cond| 0))} {28853#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 10) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #97#return; {28869#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 10) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:33:31,442 INFO L290 TraceCheckUtils]: 130: Hoare triple {28869#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 10) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= ~b~0); {28873#(and (< main_~c~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (<= main_~y~0 10) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~c~0)) (= main_~k~0 2))} is VALID [2022-04-28 12:33:31,445 INFO L290 TraceCheckUtils]: 131: Hoare triple {28873#(and (< main_~c~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (<= main_~y~0 10) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~c~0)) (= main_~k~0 2))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {28877#(and (= (* main_~x~0 (div (div (+ main_~b~0 (* (- 1) main_~y~0)) (- 2)) main_~x~0)) main_~x~0) (<= main_~y~0 10) (= (mod (div (+ main_~b~0 (* (- 1) main_~y~0)) (- 2)) main_~x~0) 0) (= main_~s~0 1) (< main_~x~0 main_~y~0) (< main_~b~0 (* main_~x~0 (div (div (+ main_~b~0 (* (- 1) main_~y~0)) (- 2)) main_~x~0))) (= (+ main_~q~0 (* 2 (div (div (+ main_~b~0 (* (- 1) main_~y~0)) (- 2)) main_~x~0))) 0) (= (mod (+ main_~b~0 main_~y~0) 2) 0) (not (= main_~x~0 0)))} is VALID [2022-04-28 12:33:31,446 INFO L290 TraceCheckUtils]: 132: Hoare triple {28877#(and (= (* main_~x~0 (div (div (+ main_~b~0 (* (- 1) main_~y~0)) (- 2)) main_~x~0)) main_~x~0) (<= main_~y~0 10) (= (mod (div (+ main_~b~0 (* (- 1) main_~y~0)) (- 2)) main_~x~0) 0) (= main_~s~0 1) (< main_~x~0 main_~y~0) (< main_~b~0 (* main_~x~0 (div (div (+ main_~b~0 (* (- 1) main_~y~0)) (- 2)) main_~x~0))) (= (+ main_~q~0 (* 2 (div (div (+ main_~b~0 (* (- 1) main_~y~0)) (- 2)) main_~x~0))) 0) (= (mod (+ main_~b~0 main_~y~0) 2) 0) (not (= main_~x~0 0)))} assume !false; {28877#(and (= (* main_~x~0 (div (div (+ main_~b~0 (* (- 1) main_~y~0)) (- 2)) main_~x~0)) main_~x~0) (<= main_~y~0 10) (= (mod (div (+ main_~b~0 (* (- 1) main_~y~0)) (- 2)) main_~x~0) 0) (= main_~s~0 1) (< main_~x~0 main_~y~0) (< main_~b~0 (* main_~x~0 (div (div (+ main_~b~0 (* (- 1) main_~y~0)) (- 2)) main_~x~0))) (= (+ main_~q~0 (* 2 (div (div (+ main_~b~0 (* (- 1) main_~y~0)) (- 2)) main_~x~0))) 0) (= (mod (+ main_~b~0 main_~y~0) 2) 0) (not (= main_~x~0 0)))} is VALID [2022-04-28 12:33:31,450 INFO L290 TraceCheckUtils]: 133: Hoare triple {28877#(and (= (* main_~x~0 (div (div (+ main_~b~0 (* (- 1) main_~y~0)) (- 2)) main_~x~0)) main_~x~0) (<= main_~y~0 10) (= (mod (div (+ main_~b~0 (* (- 1) main_~y~0)) (- 2)) main_~x~0) 0) (= main_~s~0 1) (< main_~x~0 main_~y~0) (< main_~b~0 (* main_~x~0 (div (div (+ main_~b~0 (* (- 1) main_~y~0)) (- 2)) main_~x~0))) (= (+ main_~q~0 (* 2 (div (div (+ main_~b~0 (* (- 1) main_~y~0)) (- 2)) main_~x~0))) 0) (= (mod (+ main_~b~0 main_~y~0) 2) 0) (not (= main_~x~0 0)))} assume !(0 != ~b~0); {28884#(and (<= main_~y~0 10) (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (div (div (* (- 1) main_~y~0) (- 2)) main_~x~0))) (= (+ (* 2 (div (div (* (- 1) main_~y~0) (- 2)) main_~x~0)) main_~q~0) 0) (= (mod main_~y~0 2) 0) (= (mod (div (* (- 1) main_~y~0) (- 2)) main_~x~0) 0) (< 0 (* main_~x~0 (div (div (* (- 1) main_~y~0) (- 2)) main_~x~0))))} is VALID [2022-04-28 12:33:31,454 INFO L272 TraceCheckUtils]: 134: Hoare triple {28884#(and (<= main_~y~0 10) (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (div (div (* (- 1) main_~y~0) (- 2)) main_~x~0))) (= (+ (* 2 (div (div (* (- 1) main_~y~0) (- 2)) main_~x~0)) main_~q~0) 0) (= (mod main_~y~0 2) 0) (= (mod (div (* (- 1) main_~y~0) (- 2)) main_~x~0) 0) (< 0 (* main_~x~0 (div (div (* (- 1) main_~y~0) (- 2)) main_~x~0))))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {28888#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:33:31,455 INFO L290 TraceCheckUtils]: 135: Hoare triple {28888#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28892#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:33:31,455 INFO L290 TraceCheckUtils]: 136: Hoare triple {28892#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28464#false} is VALID [2022-04-28 12:33:31,455 INFO L290 TraceCheckUtils]: 137: Hoare triple {28464#false} assume !false; {28464#false} is VALID [2022-04-28 12:33:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 149 proven. 58 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2022-04-28 12:33:31,456 INFO L328 TraceCheckSpWp]: Computing backward predicates...