/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 05:37:06,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 05:37:06,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 05:37:07,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 05:37:07,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 05:37:07,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 05:37:07,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 05:37:07,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 05:37:07,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 05:37:07,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 05:37:07,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 05:37:07,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 05:37:07,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 05:37:07,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 05:37:07,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 05:37:07,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 05:37:07,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 05:37:07,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 05:37:07,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 05:37:07,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 05:37:07,032 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 05:37:07,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 05:37:07,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 05:37:07,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 05:37:07,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 05:37:07,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 05:37:07,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 05:37:07,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 05:37:07,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 05:37:07,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 05:37:07,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 05:37:07,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 05:37:07,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 05:37:07,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 05:37:07,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 05:37:07,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 05:37:07,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 05:37:07,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 05:37:07,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 05:37:07,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 05:37:07,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 05:37:07,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 05:37:07,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 05:37:07,056 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 05:37:07,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 05:37:07,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 05:37:07,057 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 05:37:07,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 05:37:07,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 05:37:07,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 05:37:07,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 05:37:07,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 05:37:07,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 05:37:07,058 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 05:37:07,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 05:37:07,058 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 05:37:07,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 05:37:07,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 05:37:07,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 05:37:07,059 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 05:37:07,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 05:37:07,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:37:07,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 05:37:07,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 05:37:07,059 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 05:37:07,059 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 05:37:07,059 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 05:37:07,060 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 05:37:07,060 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 05:37:07,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 05:37:07,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 05:37:07,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 05:37:07,243 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 05:37:07,245 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 05:37:07,246 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound10.c [2022-04-28 05:37:07,288 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2246b4a4/7521a9c5201c4cf1b028ea148e792ed4/FLAG5bc5373d6 [2022-04-28 05:37:07,652 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 05:37:07,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound10.c [2022-04-28 05:37:07,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2246b4a4/7521a9c5201c4cf1b028ea148e792ed4/FLAG5bc5373d6 [2022-04-28 05:37:07,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2246b4a4/7521a9c5201c4cf1b028ea148e792ed4 [2022-04-28 05:37:07,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 05:37:07,668 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 05:37:07,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 05:37:07,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 05:37:07,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 05:37:07,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:37:07" (1/1) ... [2022-04-28 05:37:07,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7e5bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:07, skipping insertion in model container [2022-04-28 05:37:07,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:37:07" (1/1) ... [2022-04-28 05:37:07,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 05:37:07,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 05:37:07,790 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_unwindbound10.c[490,503] [2022-04-28 05:37:07,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:37:07,810 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 05:37:07,817 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_unwindbound10.c[490,503] [2022-04-28 05:37:07,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:37:07,833 INFO L208 MainTranslator]: Completed translation [2022-04-28 05:37:07,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:07 WrapperNode [2022-04-28 05:37:07,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 05:37:07,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 05:37:07,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 05:37:07,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 05:37:07,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:07" (1/1) ... [2022-04-28 05:37:07,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:07" (1/1) ... [2022-04-28 05:37:07,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:07" (1/1) ... [2022-04-28 05:37:07,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:07" (1/1) ... [2022-04-28 05:37:07,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:07" (1/1) ... [2022-04-28 05:37:07,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:07" (1/1) ... [2022-04-28 05:37:07,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:07" (1/1) ... [2022-04-28 05:37:07,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 05:37:07,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 05:37:07,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 05:37:07,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 05:37:07,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:07" (1/1) ... [2022-04-28 05:37:07,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:37:07,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:37:07,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 05:37:07,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 05:37:07,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 05:37:07,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 05:37:07,901 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 05:37:07,901 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 05:37:07,901 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 05:37:07,901 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 05:37:07,901 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 05:37:07,901 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 05:37:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 05:37:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 05:37:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 05:37:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 05:37:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 05:37:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 05:37:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 05:37:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 05:37:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 05:37:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 05:37:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 05:37:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 05:37:07,943 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 05:37:07,944 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 05:37:08,129 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 05:37:08,137 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 05:37:08,137 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 05:37:08,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:37:08 BoogieIcfgContainer [2022-04-28 05:37:08,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 05:37:08,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 05:37:08,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 05:37:08,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 05:37:08,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 05:37:07" (1/3) ... [2022-04-28 05:37:08,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e61a4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:37:08, skipping insertion in model container [2022-04-28 05:37:08,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:07" (2/3) ... [2022-04-28 05:37:08,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e61a4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:37:08, skipping insertion in model container [2022-04-28 05:37:08,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:37:08" (3/3) ... [2022-04-28 05:37:08,147 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound10.c [2022-04-28 05:37:08,155 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 05:37:08,156 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 05:37:08,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 05:37:08,194 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@37586a94, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2444f14c [2022-04-28 05:37:08,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 05:37:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:37:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 05:37:08,203 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:37:08,204 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:37:08,204 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:37:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:37:08,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 1 times [2022-04-28 05:37:08,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:08,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1213380764] [2022-04-28 05:37:08,218 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:37:08,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 2 times [2022-04-28 05:37:08,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:37:08,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092879252] [2022-04-28 05:37:08,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:37:08,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:37:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:08,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 05:37:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:08,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {42#true} is VALID [2022-04-28 05:37:08,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 05:37:08,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-28 05:37:08,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 05:37:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:08,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 05:37:08,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 05:37:08,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 05:37:08,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-28 05:37:08,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 05:37:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:08,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 05:37:08,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 05:37:08,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 05:37:08,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-28 05:37:08,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 05:37:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:08,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 05:37:08,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 05:37:08,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 05:37:08,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-28 05:37:08,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-28 05:37:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:08,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 05:37:08,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 05:37:08,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 05:37:08,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-28 05:37:08,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 05:37:08,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {42#true} is VALID [2022-04-28 05:37:08,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 05:37:08,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-28 05:37:08,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret8 := main(); {42#true} is VALID [2022-04-28 05:37:08,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {42#true} is VALID [2022-04-28 05:37:08,438 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-28 05:37:08,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 05:37:08,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 05:37:08,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 05:37:08,439 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-28 05:37:08,439 INFO L272 TraceCheckUtils]: 11: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-28 05:37:08,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 05:37:08,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 05:37:08,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 05:37:08,440 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-28 05:37:08,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#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; {43#false} is VALID [2022-04-28 05:37:08,441 INFO L272 TraceCheckUtils]: 17: Hoare triple {43#false} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-28 05:37:08,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 05:37:08,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 05:37:08,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 05:37:08,442 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-28 05:37:08,442 INFO L272 TraceCheckUtils]: 22: Hoare triple {43#false} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-28 05:37:08,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 05:37:08,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 05:37:08,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 05:37:08,444 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-28 05:37:08,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-28 05:37:08,445 INFO L272 TraceCheckUtils]: 28: Hoare triple {43#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {43#false} is VALID [2022-04-28 05:37:08,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-28 05:37:08,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-28 05:37:08,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-28 05:37:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 05:37:08,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:37:08,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092879252] [2022-04-28 05:37:08,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092879252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:08,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:08,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:37:08,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:37:08,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1213380764] [2022-04-28 05:37:08,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1213380764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:08,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:08,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:37:08,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326767010] [2022-04-28 05:37:08,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:37:08,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 05:37:08,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:37:08,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:08,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:08,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 05:37:08,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:08,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 05:37:08,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 05:37:08,520 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:08,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:08,714 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-04-28 05:37:08,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 05:37:08,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 05:37:08,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:37:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-28 05:37:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-28 05:37:08,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-04-28 05:37:08,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:08,851 INFO L225 Difference]: With dead ends: 72 [2022-04-28 05:37:08,851 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 05:37:08,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 05:37:08,857 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:37:08,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:37:08,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 05:37:08,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-28 05:37:08,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:37:08,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:08,889 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:08,889 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:08,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:08,894 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-28 05:37:08,894 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-28 05:37:08,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:08,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:08,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-28 05:37:08,897 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-28 05:37:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:08,903 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-28 05:37:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-28 05:37:08,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:08,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:08,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:37:08,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:37:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-28 05:37:08,909 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-28 05:37:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:37:08,910 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-28 05:37:08,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:08,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-28 05:37:08,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 05:37:08,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 05:37:08,951 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:37:08,952 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:37:08,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 05:37:08,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:37:08,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:37:08,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 1 times [2022-04-28 05:37:08,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:08,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1748101557] [2022-04-28 05:37:08,955 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:37:08,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 2 times [2022-04-28 05:37:08,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:37:08,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690932896] [2022-04-28 05:37:08,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:37:08,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:37:08,997 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:37:08,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516875568] [2022-04-28 05:37:08,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:37:08,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:08,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:37:09,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:37:09,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 05:37:09,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:37:09,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:37:09,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 05:37:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:09,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:37:09,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-28 05:37:09,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#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);~counter~0 := 0; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {356#(<= ~counter~0 0)} {348#true} #98#return; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {356#(<= ~counter~0 0)} call #t~ret8 := main(); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {356#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,286 INFO L272 TraceCheckUtils]: 6: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,288 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #78#return; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,289 INFO L272 TraceCheckUtils]: 11: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,290 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #80#return; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {356#(<= ~counter~0 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; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,291 INFO L272 TraceCheckUtils]: 17: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,292 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #82#return; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,293 INFO L272 TraceCheckUtils]: 22: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,294 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #84#return; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:09,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {356#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {435#(<= |main_#t~post6| 0)} is VALID [2022-04-28 05:37:09,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {349#false} is VALID [2022-04-28 05:37:09,295 INFO L272 TraceCheckUtils]: 29: Hoare triple {349#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {349#false} is VALID [2022-04-28 05:37:09,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {349#false} ~cond := #in~cond; {349#false} is VALID [2022-04-28 05:37:09,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {349#false} assume 0 == ~cond; {349#false} is VALID [2022-04-28 05:37:09,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-28 05:37:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 05:37:09,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:37:09,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:37:09,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690932896] [2022-04-28 05:37:09,297 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:37:09,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516875568] [2022-04-28 05:37:09,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516875568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:09,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:09,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:37:09,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:37:09,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1748101557] [2022-04-28 05:37:09,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1748101557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:09,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:09,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:37:09,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579588914] [2022-04-28 05:37:09,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:37:09,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-28 05:37:09,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:37:09,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:09,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:09,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:37:09,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:09,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:37:09,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:37:09,323 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:09,410 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-28 05:37:09,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:37:09,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-28 05:37:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:37:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-28 05:37:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:09,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-28 05:37:09,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-28 05:37:09,463 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 05:37:09,465 INFO L225 Difference]: With dead ends: 44 [2022-04-28 05:37:09,465 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 05:37:09,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:37:09,467 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:37:09,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:37:09,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 05:37:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 05:37:09,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:37:09,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:09,487 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:09,487 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:09,492 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-28 05:37:09,492 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-28 05:37:09,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:09,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:09,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-28 05:37:09,497 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-28 05:37:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:09,500 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-28 05:37:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-28 05:37:09,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:09,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:09,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:37:09,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:37:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-28 05:37:09,507 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-28 05:37:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:37:09,507 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-28 05:37:09,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:09,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 47 transitions. [2022-04-28 05:37:09,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:09,543 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-28 05:37:09,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 05:37:09,543 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:37:09,543 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:37:09,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 05:37:09,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:09,761 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:37:09,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:37:09,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 1 times [2022-04-28 05:37:09,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:09,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [349371422] [2022-04-28 05:37:09,762 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:37:09,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 2 times [2022-04-28 05:37:09,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:37:09,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762997851] [2022-04-28 05:37:09,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:37:09,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:37:09,787 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:37:09,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590569739] [2022-04-28 05:37:09,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:37:09,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:09,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:37:09,790 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:37:09,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 05:37:09,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:37:09,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:37:09,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:37:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:09,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:37:09,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-28 05:37:09,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {682#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);~counter~0 := 0; {682#true} is VALID [2022-04-28 05:37:09,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 05:37:09,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #98#return; {682#true} is VALID [2022-04-28 05:37:09,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret8 := main(); {682#true} is VALID [2022-04-28 05:37:09,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {682#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {682#true} is VALID [2022-04-28 05:37:09,981 INFO L272 TraceCheckUtils]: 6: Hoare triple {682#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-28 05:37:09,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 05:37:09,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 05:37:09,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 05:37:09,981 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {682#true} {682#true} #78#return; {682#true} is VALID [2022-04-28 05:37:09,981 INFO L272 TraceCheckUtils]: 11: Hoare triple {682#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-28 05:37:09,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {682#true} ~cond := #in~cond; {723#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:37:09,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {723#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:37:09,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:37:09,983 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {727#(not (= |assume_abort_if_not_#in~cond| 0))} {682#true} #80#return; {734#(<= 1 main_~y~0)} is VALID [2022-04-28 05:37:09,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#(<= 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; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:09,985 INFO L272 TraceCheckUtils]: 17: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-28 05:37:09,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 05:37:09,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 05:37:09,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 05:37:09,986 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #82#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:09,986 INFO L272 TraceCheckUtils]: 22: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-28 05:37:09,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 05:37:09,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 05:37:09,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 05:37:09,987 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #84#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:09,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {738#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:09,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {738#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:09,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {738#(<= 1 main_~b~0)} assume !(0 != ~b~0); {683#false} is VALID [2022-04-28 05:37:09,989 INFO L272 TraceCheckUtils]: 30: Hoare triple {683#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {683#false} is VALID [2022-04-28 05:37:09,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-28 05:37:09,989 INFO L290 TraceCheckUtils]: 32: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-28 05:37:09,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-28 05:37:09,990 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 05:37:09,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:37:10,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-28 05:37:10,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-28 05:37:10,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-28 05:37:10,175 INFO L272 TraceCheckUtils]: 30: Hoare triple {683#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {683#false} is VALID [2022-04-28 05:37:10,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {738#(<= 1 main_~b~0)} assume !(0 != ~b~0); {683#false} is VALID [2022-04-28 05:37:10,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {738#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:10,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {738#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:10,184 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #84#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:10,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 05:37:10,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 05:37:10,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 05:37:10,185 INFO L272 TraceCheckUtils]: 22: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-28 05:37:10,185 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #82#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:10,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 05:37:10,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 05:37:10,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 05:37:10,186 INFO L272 TraceCheckUtils]: 17: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-28 05:37:10,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#(<= 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; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:10,187 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {727#(not (= |assume_abort_if_not_#in~cond| 0))} {682#true} #80#return; {734#(<= 1 main_~y~0)} is VALID [2022-04-28 05:37:10,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:37:10,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:37:10,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {682#true} ~cond := #in~cond; {853#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 05:37:10,188 INFO L272 TraceCheckUtils]: 11: Hoare triple {682#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-28 05:37:10,188 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {682#true} {682#true} #78#return; {682#true} is VALID [2022-04-28 05:37:10,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 05:37:10,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 05:37:10,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 05:37:10,188 INFO L272 TraceCheckUtils]: 6: Hoare triple {682#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-28 05:37:10,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {682#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {682#true} is VALID [2022-04-28 05:37:10,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret8 := main(); {682#true} is VALID [2022-04-28 05:37:10,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #98#return; {682#true} is VALID [2022-04-28 05:37:10,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 05:37:10,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {682#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);~counter~0 := 0; {682#true} is VALID [2022-04-28 05:37:10,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-28 05:37:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 05:37:10,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:37:10,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762997851] [2022-04-28 05:37:10,189 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:37:10,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590569739] [2022-04-28 05:37:10,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590569739] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:37:10,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:37:10,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-28 05:37:10,190 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:37:10,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [349371422] [2022-04-28 05:37:10,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [349371422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:10,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:10,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:37:10,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725596714] [2022-04-28 05:37:10,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:37:10,190 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 05:37:10,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:37:10,191 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:10,206 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 05:37:10,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:37:10,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:10,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:37:10,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 05:37:10,207 INFO L87 Difference]: Start difference. First operand 36 states and 47 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:10,422 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-28 05:37:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:37:10,422 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 05:37:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:37:10,423 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-28 05:37:10,425 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-28 05:37:10,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-28 05:37:10,471 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 05:37:10,474 INFO L225 Difference]: With dead ends: 53 [2022-04-28 05:37:10,474 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 05:37:10,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 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 05:37:10,494 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:37:10,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 135 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:37:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 05:37:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-28 05:37:10,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:37:10,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:10,517 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:10,517 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:10,519 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-28 05:37:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-28 05:37:10,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:10,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:10,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-28 05:37:10,520 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-28 05:37:10,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:10,522 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-28 05:37:10,522 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-28 05:37:10,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:10,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:10,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:37:10,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:37:10,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-28 05:37:10,523 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-28 05:37:10,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:37:10,524 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-28 05:37:10,524 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:10,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 48 transitions. [2022-04-28 05:37:10,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:10,557 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-28 05:37:10,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 05:37:10,558 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:37:10,558 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:37:10,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 05:37:10,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 05:37:10,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:37:10,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:37:10,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 1 times [2022-04-28 05:37:10,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:10,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1701496574] [2022-04-28 05:37:10,775 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:37:10,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 2 times [2022-04-28 05:37:10,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:37:10,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866445972] [2022-04-28 05:37:10,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:37:10,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:37:10,788 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:37:10,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494530350] [2022-04-28 05:37:10,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:37:10,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:10,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:37:10,789 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:37:10,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 05:37:10,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:37:10,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:37:10,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 05:37:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:10,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:37:10,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {1166#true} call ULTIMATE.init(); {1166#true} is VALID [2022-04-28 05:37:10,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {1166#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);~counter~0 := 0; {1166#true} is VALID [2022-04-28 05:37:10,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-28 05:37:10,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1166#true} {1166#true} #98#return; {1166#true} is VALID [2022-04-28 05:37:10,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {1166#true} call #t~ret8 := main(); {1166#true} is VALID [2022-04-28 05:37:10,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {1166#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1166#true} is VALID [2022-04-28 05:37:10,935 INFO L272 TraceCheckUtils]: 6: Hoare triple {1166#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1166#true} is VALID [2022-04-28 05:37:10,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-28 05:37:10,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-28 05:37:10,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-28 05:37:10,935 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1166#true} {1166#true} #78#return; {1166#true} is VALID [2022-04-28 05:37:10,935 INFO L272 TraceCheckUtils]: 11: Hoare triple {1166#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1166#true} is VALID [2022-04-28 05:37:10,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-28 05:37:10,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-28 05:37:10,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-28 05:37:10,935 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1166#true} {1166#true} #80#return; {1166#true} is VALID [2022-04-28 05:37:10,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {1166#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; {1166#true} is VALID [2022-04-28 05:37:10,936 INFO L272 TraceCheckUtils]: 17: Hoare triple {1166#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1166#true} is VALID [2022-04-28 05:37:10,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-28 05:37:10,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-28 05:37:10,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-28 05:37:10,936 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1166#true} {1166#true} #82#return; {1166#true} is VALID [2022-04-28 05:37:10,936 INFO L272 TraceCheckUtils]: 22: Hoare triple {1166#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1166#true} is VALID [2022-04-28 05:37:10,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-28 05:37:10,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-28 05:37:10,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-28 05:37:10,936 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1166#true} {1166#true} #84#return; {1166#true} is VALID [2022-04-28 05:37:10,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {1166#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1166#true} is VALID [2022-04-28 05:37:10,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {1166#true} assume !!(#t~post6 < 10);havoc #t~post6; {1166#true} is VALID [2022-04-28 05:37:10,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {1166#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-28 05:37:10,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-28 05:37:10,938 INFO L290 TraceCheckUtils]: 31: Hoare triple {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} assume !!(#t~post7 < 10);havoc #t~post7; {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-28 05:37:10,938 INFO L272 TraceCheckUtils]: 32: Hoare triple {1258#(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)); {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:37:10,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1272#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:37:10,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {1272#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1167#false} is VALID [2022-04-28 05:37:10,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {1167#false} assume !false; {1167#false} is VALID [2022-04-28 05:37:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 05:37:10,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:37:10,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:37:10,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866445972] [2022-04-28 05:37:10,940 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:37:10,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494530350] [2022-04-28 05:37:10,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494530350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:10,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:10,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:37:10,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:37:10,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1701496574] [2022-04-28 05:37:10,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1701496574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:10,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:10,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:37:10,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354923131] [2022-04-28 05:37:10,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:37:10,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-28 05:37:10,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:37:10,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 05:37:10,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:10,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:37:10,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:10,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:37:10,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:37:10,957 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 05:37:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:11,124 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-28 05:37:11,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:37:11,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-28 05:37:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:37:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 05:37:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 05:37:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 05:37:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 05:37:11,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-28 05:37:11,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:11,174 INFO L225 Difference]: With dead ends: 51 [2022-04-28 05:37:11,174 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 05:37:11,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:37:11,175 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 150 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 05:37:11,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 150 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:37:11,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 05:37:11,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2022-04-28 05:37:11,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:37:11,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:37:11,201 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:37:11,202 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:37:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:11,203 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-28 05:37:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-28 05:37:11,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:11,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:11,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 49 states. [2022-04-28 05:37:11,204 INFO L87 Difference]: Start difference. First operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 49 states. [2022-04-28 05:37:11,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:11,206 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-28 05:37:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-28 05:37:11,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:11,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:11,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:37:11,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:37:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:37:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-04-28 05:37:11,208 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 36 [2022-04-28 05:37:11,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:37:11,208 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-04-28 05:37:11,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 05:37:11,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 56 transitions. [2022-04-28 05:37:11,249 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 05:37:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-04-28 05:37:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 05:37:11,250 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:37:11,250 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:37:11,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 05:37:11,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:11,459 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:37:11,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:37:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 1 times [2022-04-28 05:37:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:11,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [203790412] [2022-04-28 05:37:11,460 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:37:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 2 times [2022-04-28 05:37:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:37:11,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331226264] [2022-04-28 05:37:11,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:37:11,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:37:11,477 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:37:11,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394013761] [2022-04-28 05:37:11,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:37:11,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:11,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:37:11,478 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:37:11,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 05:37:11,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:37:11,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:37:11,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:37:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:11,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:37:11,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {1568#true} call ULTIMATE.init(); {1568#true} is VALID [2022-04-28 05:37:11,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {1568#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);~counter~0 := 0; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#(<= ~counter~0 0)} {1568#true} #98#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#(<= ~counter~0 0)} call #t~ret8 := main(); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {1576#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,651 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #78#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,652 INFO L272 TraceCheckUtils]: 11: Hoare triple {1576#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,653 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #80#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {1576#(<= ~counter~0 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; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,654 INFO L272 TraceCheckUtils]: 17: Hoare triple {1576#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,655 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #82#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,655 INFO L272 TraceCheckUtils]: 22: Hoare triple {1576#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,657 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #84#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:11,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {1576#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1655#(<= ~counter~0 1)} is VALID [2022-04-28 05:37:11,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {1655#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1655#(<= ~counter~0 1)} is VALID [2022-04-28 05:37:11,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {1655#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1655#(<= ~counter~0 1)} is VALID [2022-04-28 05:37:11,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {1655#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1665#(<= |main_#t~post7| 1)} is VALID [2022-04-28 05:37:11,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {1665#(<= |main_#t~post7| 1)} assume !(#t~post7 < 10);havoc #t~post7; {1569#false} is VALID [2022-04-28 05:37:11,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {1569#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; {1569#false} is VALID [2022-04-28 05:37:11,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {1569#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1569#false} is VALID [2022-04-28 05:37:11,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {1569#false} assume !(#t~post6 < 10);havoc #t~post6; {1569#false} is VALID [2022-04-28 05:37:11,659 INFO L272 TraceCheckUtils]: 35: Hoare triple {1569#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {1569#false} is VALID [2022-04-28 05:37:11,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {1569#false} ~cond := #in~cond; {1569#false} is VALID [2022-04-28 05:37:11,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {1569#false} assume 0 == ~cond; {1569#false} is VALID [2022-04-28 05:37:11,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {1569#false} assume !false; {1569#false} is VALID [2022-04-28 05:37:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 05:37:11,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:37:11,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:37:11,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331226264] [2022-04-28 05:37:11,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:37:11,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394013761] [2022-04-28 05:37:11,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394013761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:11,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:11,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:37:11,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:37:11,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [203790412] [2022-04-28 05:37:11,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [203790412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:11,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:11,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:37:11,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956740662] [2022-04-28 05:37:11,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:37:11,660 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-28 05:37:11,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:37:11,661 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:11,677 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 05:37:11,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:37:11,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:11,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:37:11,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:37:11,678 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:11,800 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-28 05:37:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:37:11,800 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-28 05:37:11,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:37:11,800 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-28 05:37:11,802 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-28 05:37:11,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-28 05:37:11,852 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 05:37:11,853 INFO L225 Difference]: With dead ends: 72 [2022-04-28 05:37:11,853 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 05:37:11,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:37:11,854 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:37:11,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:37:11,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 05:37:11,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 05:37:11,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:37:11,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:37:11,888 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:37:11,888 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:37:11,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:11,890 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-28 05:37:11,890 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-28 05:37:11,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:11,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:11,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 46 states. [2022-04-28 05:37:11,890 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 46 states. [2022-04-28 05:37:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:11,891 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-28 05:37:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-28 05:37:11,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:11,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:11,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:37:11,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:37:11,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:37:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-04-28 05:37:11,893 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 39 [2022-04-28 05:37:11,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:37:11,893 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-04-28 05:37:11,893 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:11,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 58 transitions. [2022-04-28 05:37:11,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-28 05:37:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 05:37:11,938 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:37:11,938 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:37:11,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 05:37:12,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:12,139 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:37:12,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:37:12,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 1 times [2022-04-28 05:37:12,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:12,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [710355477] [2022-04-28 05:37:12,139 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:37:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 2 times [2022-04-28 05:37:12,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:37:12,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013029850] [2022-04-28 05:37:12,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:37:12,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:37:12,149 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:37:12,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [742285387] [2022-04-28 05:37:12,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:37:12,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:12,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:37:12,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 05:37:12,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 05:37:12,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:37:12,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:37:12,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 05:37:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:12,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:37:12,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2022-04-28 05:37:12,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {2017#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);~counter~0 := 0; {2017#true} is VALID [2022-04-28 05:37:12,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:12,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #98#return; {2017#true} is VALID [2022-04-28 05:37:12,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret8 := main(); {2017#true} is VALID [2022-04-28 05:37:12,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {2017#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2017#true} is VALID [2022-04-28 05:37:12,414 INFO L272 TraceCheckUtils]: 6: Hoare triple {2017#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:12,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:12,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:12,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:12,415 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2017#true} {2017#true} #78#return; {2017#true} is VALID [2022-04-28 05:37:12,415 INFO L272 TraceCheckUtils]: 11: Hoare triple {2017#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:12,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {2017#true} ~cond := #in~cond; {2058#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:37:12,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {2058#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2062#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:37:12,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {2062#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2062#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:37:12,416 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2062#(not (= |assume_abort_if_not_#in~cond| 0))} {2017#true} #80#return; {2069#(<= 1 main_~y~0)} is VALID [2022-04-28 05:37:12,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {2069#(<= 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; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:12,421 INFO L272 TraceCheckUtils]: 17: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:12,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:12,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:12,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:12,421 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2017#true} {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:12,421 INFO L272 TraceCheckUtils]: 22: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:12,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:12,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:12,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:12,422 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2017#true} {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:12,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:12,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:12,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:12,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:12,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:12,424 INFO L272 TraceCheckUtils]: 32: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:12,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:12,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:12,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:12,425 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2017#true} {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:12,425 INFO L272 TraceCheckUtils]: 37: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:37:12,426 INFO L290 TraceCheckUtils]: 38: Hoare triple {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:37:12,426 INFO L290 TraceCheckUtils]: 39: Hoare triple {2141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2018#false} is VALID [2022-04-28 05:37:12,426 INFO L290 TraceCheckUtils]: 40: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2022-04-28 05:37:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 05:37:12,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:37:12,607 INFO L290 TraceCheckUtils]: 40: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2022-04-28 05:37:12,607 INFO L290 TraceCheckUtils]: 39: Hoare triple {2141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2018#false} is VALID [2022-04-28 05:37:12,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:37:12,609 INFO L272 TraceCheckUtils]: 37: Hoare triple {2157#(= 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)); {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:37:12,609 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2017#true} {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:12,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:12,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:12,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:12,610 INFO L272 TraceCheckUtils]: 32: Hoare triple {2157#(= 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)); {2017#true} is VALID [2022-04-28 05:37:12,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:12,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:12,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {2157#(= 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; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:12,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:12,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:12,612 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2017#true} {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #84#return; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:12,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:12,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:12,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:12,612 INFO L272 TraceCheckUtils]: 22: Hoare triple {2157#(= main_~a~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)); {2017#true} is VALID [2022-04-28 05:37:12,613 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2017#true} {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #82#return; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:12,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:12,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:12,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:12,613 INFO L272 TraceCheckUtils]: 17: Hoare triple {2157#(= main_~a~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)); {2017#true} is VALID [2022-04-28 05:37:12,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {2017#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; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:12,613 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2017#true} {2017#true} #80#return; {2017#true} is VALID [2022-04-28 05:37:12,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:12,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:12,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:12,614 INFO L272 TraceCheckUtils]: 11: Hoare triple {2017#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:12,614 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2017#true} {2017#true} #78#return; {2017#true} is VALID [2022-04-28 05:37:12,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:12,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:12,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:12,614 INFO L272 TraceCheckUtils]: 6: Hoare triple {2017#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:12,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {2017#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2017#true} is VALID [2022-04-28 05:37:12,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret8 := main(); {2017#true} is VALID [2022-04-28 05:37:12,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #98#return; {2017#true} is VALID [2022-04-28 05:37:12,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:12,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {2017#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);~counter~0 := 0; {2017#true} is VALID [2022-04-28 05:37:12,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2022-04-28 05:37:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 05:37:12,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:37:12,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013029850] [2022-04-28 05:37:12,615 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:37:12,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742285387] [2022-04-28 05:37:12,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742285387] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 05:37:12,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:37:12,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-28 05:37:12,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:37:12,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [710355477] [2022-04-28 05:37:12,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [710355477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:12,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:12,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:37:12,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903572068] [2022-04-28 05:37:12,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:37:12,616 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-28 05:37:12,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:37:12,616 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:37:12,638 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 05:37:12,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:37:12,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:12,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:37:12,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:37:12,639 INFO L87 Difference]: Start difference. First operand 46 states and 58 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:37:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:12,821 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2022-04-28 05:37:12,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:37:12,821 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-28 05:37:12,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:37:12,821 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:37:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 05:37:12,822 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:37:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 05:37:12,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 05:37:12,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:12,867 INFO L225 Difference]: With dead ends: 61 [2022-04-28 05:37:12,867 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 05:37:12,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:37:12,867 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 157 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 05:37:12,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 157 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:37:12,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 05:37:12,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-28 05:37:12,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:37:12,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:37:12,907 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:37:12,908 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:37:12,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:12,909 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-28 05:37:12,909 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-28 05:37:12,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:12,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:12,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 59 states. [2022-04-28 05:37:12,910 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 59 states. [2022-04-28 05:37:12,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:12,912 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-28 05:37:12,912 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-28 05:37:12,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:12,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:12,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:37:12,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:37:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:37:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-04-28 05:37:12,914 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 41 [2022-04-28 05:37:12,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:37:12,914 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-04-28 05:37:12,914 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:37:12,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 76 transitions. [2022-04-28 05:37:12,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:12,975 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-28 05:37:12,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 05:37:12,975 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:37:12,975 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:37:12,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 05:37:13,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:13,194 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:37:13,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:37:13,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 1 times [2022-04-28 05:37:13,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:13,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [890220712] [2022-04-28 05:37:13,194 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:37:13,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 2 times [2022-04-28 05:37:13,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:37:13,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907780416] [2022-04-28 05:37:13,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:37:13,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:37:13,205 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:37:13,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [774492714] [2022-04-28 05:37:13,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:37:13,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:13,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:37:13,206 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:37:13,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 05:37:13,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:37:13,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:37:13,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 05:37:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:13,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:37:13,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {2629#true} call ULTIMATE.init(); {2629#true} is VALID [2022-04-28 05:37:13,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {2629#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);~counter~0 := 0; {2629#true} is VALID [2022-04-28 05:37:13,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:13,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #98#return; {2629#true} is VALID [2022-04-28 05:37:13,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {2629#true} call #t~ret8 := main(); {2629#true} is VALID [2022-04-28 05:37:13,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {2629#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2629#true} is VALID [2022-04-28 05:37:13,501 INFO L272 TraceCheckUtils]: 6: Hoare triple {2629#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:13,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {2629#true} ~cond := #in~cond; {2655#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:37:13,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {2655#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2659#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:37:13,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {2659#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2659#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:37:13,502 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2659#(not (= |assume_abort_if_not_#in~cond| 0))} {2629#true} #78#return; {2666#(<= 1 main_~x~0)} is VALID [2022-04-28 05:37:13,502 INFO L272 TraceCheckUtils]: 11: Hoare triple {2666#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:13,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:13,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:13,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:13,503 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2629#true} {2666#(<= 1 main_~x~0)} #80#return; {2666#(<= 1 main_~x~0)} is VALID [2022-04-28 05:37:13,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {2666#(<= 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; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:13,503 INFO L272 TraceCheckUtils]: 17: Hoare triple {2685#(and (<= 1 main_~x~0) (= 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)); {2629#true} is VALID [2022-04-28 05:37:13,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:13,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:13,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:13,506 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2629#true} {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #82#return; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:13,506 INFO L272 TraceCheckUtils]: 22: Hoare triple {2685#(and (<= 1 main_~x~0) (= 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)); {2629#true} is VALID [2022-04-28 05:37:13,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:13,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:13,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:13,507 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2629#true} {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #84#return; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:13,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:13,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:13,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {2685#(and (<= 1 main_~x~0) (= 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; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:13,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:13,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:13,509 INFO L272 TraceCheckUtils]: 32: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:13,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:13,509 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:13,509 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:13,509 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2629#true} {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #86#return; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:13,509 INFO L272 TraceCheckUtils]: 37: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:13,509 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:13,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:13,510 INFO L290 TraceCheckUtils]: 40: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:13,510 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2629#true} {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #88#return; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:13,511 INFO L272 TraceCheckUtils]: 42: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:37:13,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2768#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:37:13,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {2768#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2630#false} is VALID [2022-04-28 05:37:13,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {2630#false} assume !false; {2630#false} is VALID [2022-04-28 05:37:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 05:37:13,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:37:13,722 INFO L290 TraceCheckUtils]: 45: Hoare triple {2630#false} assume !false; {2630#false} is VALID [2022-04-28 05:37:13,722 INFO L290 TraceCheckUtils]: 44: Hoare triple {2768#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2630#false} is VALID [2022-04-28 05:37:13,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2768#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:37:13,723 INFO L272 TraceCheckUtils]: 42: Hoare triple {2784#(= 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)); {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:37:13,724 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2629#true} {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:13,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:13,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:13,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:13,724 INFO L272 TraceCheckUtils]: 37: Hoare triple {2784#(= 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)); {2629#true} is VALID [2022-04-28 05:37:13,724 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2629#true} {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:13,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:13,725 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:13,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:13,725 INFO L272 TraceCheckUtils]: 32: Hoare triple {2784#(= 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)); {2629#true} is VALID [2022-04-28 05:37:13,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:13,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:13,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {2784#(= 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; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:13,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:13,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:13,728 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2629#true} {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #84#return; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:13,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:13,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:13,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:13,728 INFO L272 TraceCheckUtils]: 22: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:13,732 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2629#true} {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #82#return; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:13,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:13,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:13,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:13,732 INFO L272 TraceCheckUtils]: 17: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:13,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {2629#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; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:13,733 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2629#true} {2629#true} #80#return; {2629#true} is VALID [2022-04-28 05:37:13,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:13,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:13,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:13,733 INFO L272 TraceCheckUtils]: 11: Hoare triple {2629#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:13,733 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2629#true} {2629#true} #78#return; {2629#true} is VALID [2022-04-28 05:37:13,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:13,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:13,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:13,734 INFO L272 TraceCheckUtils]: 6: Hoare triple {2629#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:13,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {2629#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2629#true} is VALID [2022-04-28 05:37:13,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {2629#true} call #t~ret8 := main(); {2629#true} is VALID [2022-04-28 05:37:13,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #98#return; {2629#true} is VALID [2022-04-28 05:37:13,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:13,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {2629#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);~counter~0 := 0; {2629#true} is VALID [2022-04-28 05:37:13,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {2629#true} call ULTIMATE.init(); {2629#true} is VALID [2022-04-28 05:37:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:37:13,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:37:13,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907780416] [2022-04-28 05:37:13,734 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:37:13,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774492714] [2022-04-28 05:37:13,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774492714] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 05:37:13,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:37:13,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-28 05:37:13,735 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:37:13,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [890220712] [2022-04-28 05:37:13,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [890220712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:13,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:13,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:37:13,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740913161] [2022-04-28 05:37:13,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:37:13,735 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-28 05:37:13,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:37:13,736 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:37:13,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:13,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:37:13,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:13,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:37:13,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:37:13,758 INFO L87 Difference]: Start difference. First operand 58 states and 76 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:37:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:13,948 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2022-04-28 05:37:13,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:37:13,949 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-28 05:37:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:37:13,949 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:37:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 05:37:13,950 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:37:13,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 05:37:13,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 05:37:13,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:13,989 INFO L225 Difference]: With dead ends: 65 [2022-04-28 05:37:13,990 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 05:37:13,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:37:13,990 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:37:13,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:37:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 05:37:14,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-28 05:37:14,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:37:14,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:37:14,033 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:37:14,033 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:37:14,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:14,035 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-28 05:37:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-28 05:37:14,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:14,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:14,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-28 05:37:14,036 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-28 05:37:14,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:14,038 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-28 05:37:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-28 05:37:14,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:14,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:14,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:37:14,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:37:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:37:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-04-28 05:37:14,040 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 46 [2022-04-28 05:37:14,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:37:14,041 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-04-28 05:37:14,041 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:37:14,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 79 transitions. [2022-04-28 05:37:14,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-04-28 05:37:14,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 05:37:14,115 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:37:14,115 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:37:14,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 05:37:14,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:14,316 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:37:14,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:37:14,316 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 1 times [2022-04-28 05:37:14,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:14,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1220426408] [2022-04-28 05:37:14,317 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:37:14,317 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 2 times [2022-04-28 05:37:14,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:37:14,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782329846] [2022-04-28 05:37:14,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:37:14,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:37:14,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:37:14,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568970769] [2022-04-28 05:37:14,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:37:14,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:14,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:37:14,327 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:37:14,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 05:37:14,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:37:14,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:37:14,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 05:37:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:14,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:37:21,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {3295#true} call ULTIMATE.init(); {3295#true} is VALID [2022-04-28 05:37:21,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {3295#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);~counter~0 := 0; {3295#true} is VALID [2022-04-28 05:37:21,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 05:37:21,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3295#true} {3295#true} #98#return; {3295#true} is VALID [2022-04-28 05:37:21,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {3295#true} call #t~ret8 := main(); {3295#true} is VALID [2022-04-28 05:37:21,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {3295#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3295#true} is VALID [2022-04-28 05:37:21,544 INFO L272 TraceCheckUtils]: 6: Hoare triple {3295#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3295#true} is VALID [2022-04-28 05:37:21,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-28 05:37:21,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-28 05:37:21,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 05:37:21,544 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3295#true} {3295#true} #78#return; {3295#true} is VALID [2022-04-28 05:37:21,544 INFO L272 TraceCheckUtils]: 11: Hoare triple {3295#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3295#true} is VALID [2022-04-28 05:37:21,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-28 05:37:21,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-28 05:37:21,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 05:37:21,545 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3295#true} {3295#true} #80#return; {3295#true} is VALID [2022-04-28 05:37:21,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {3295#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; {3348#(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 05:37:21,545 INFO L272 TraceCheckUtils]: 17: Hoare triple {3348#(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)); {3295#true} is VALID [2022-04-28 05:37:21,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-28 05:37:21,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-28 05:37:21,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 05:37:21,546 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3295#true} {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #82#return; {3348#(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 05:37:21,546 INFO L272 TraceCheckUtils]: 22: Hoare triple {3348#(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)); {3295#true} is VALID [2022-04-28 05:37:21,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-28 05:37:21,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-28 05:37:21,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 05:37:21,547 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3295#true} {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #84#return; {3348#(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 05:37:21,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3348#(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 05:37:21,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {3348#(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 !!(#t~post6 < 10);havoc #t~post6; {3348#(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 05:37:21,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {3348#(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; {3348#(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 05:37:21,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3348#(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 05:37:21,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {3348#(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 !!(#t~post7 < 10);havoc #t~post7; {3348#(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 05:37:21,549 INFO L272 TraceCheckUtils]: 32: Hoare triple {3348#(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)); {3295#true} is VALID [2022-04-28 05:37:21,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-28 05:37:21,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-28 05:37:21,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 05:37:21,551 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3295#true} {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #86#return; {3348#(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 05:37:21,551 INFO L272 TraceCheckUtils]: 37: Hoare triple {3348#(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)); {3295#true} is VALID [2022-04-28 05:37:21,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {3295#true} ~cond := #in~cond; {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:37:21,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:37:21,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:37:21,553 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #88#return; {3348#(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 05:37:21,553 INFO L272 TraceCheckUtils]: 42: Hoare triple {3348#(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)); {3295#true} is VALID [2022-04-28 05:37:21,553 INFO L290 TraceCheckUtils]: 43: Hoare triple {3295#true} ~cond := #in~cond; {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:37:21,554 INFO L290 TraceCheckUtils]: 44: Hoare triple {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:37:21,554 INFO L290 TraceCheckUtils]: 45: Hoare triple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:37:21,554 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #90#return; {3348#(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 05:37:21,555 INFO L272 TraceCheckUtils]: 47: Hoare triple {3348#(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)); {3444#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:37:21,556 INFO L290 TraceCheckUtils]: 48: Hoare triple {3444#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3448#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:37:21,556 INFO L290 TraceCheckUtils]: 49: Hoare triple {3448#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3296#false} is VALID [2022-04-28 05:37:21,556 INFO L290 TraceCheckUtils]: 50: Hoare triple {3296#false} assume !false; {3296#false} is VALID [2022-04-28 05:37:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 05:37:21,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:38:18,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:38:18,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782329846] [2022-04-28 05:38:18,626 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:38:18,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568970769] [2022-04-28 05:38:18,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568970769] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 05:38:18,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:38:18,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 05:38:18,627 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:38:18,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1220426408] [2022-04-28 05:38:18,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1220426408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:38:18,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:38:18,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:38:18,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859777182] [2022-04-28 05:38:18,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:38:18,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-28 05:38:18,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:38:18,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:38:18,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:18,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:38:18,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:18,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:38:18,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:38:18,657 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:38:19,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:19,031 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-04-28 05:38:19,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:38:19,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-28 05:38:19,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:38:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:38:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-28 05:38:19,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:38:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-28 05:38:19,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-28 05:38:19,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:19,082 INFO L225 Difference]: With dead ends: 69 [2022-04-28 05:38:19,082 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 05:38:19,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 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 05:38:19,082 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:38:19,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 160 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:38:19,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 05:38:19,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-28 05:38:19,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:38:19,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:38:19,131 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:38:19,132 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:38:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:19,133 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-28 05:38:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-04-28 05:38:19,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:19,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:19,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-28 05:38:19,134 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-28 05:38:19,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:19,136 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-28 05:38:19,136 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-04-28 05:38:19,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:19,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:19,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:38:19,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:38:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:38:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2022-04-28 05:38:19,138 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 51 [2022-04-28 05:38:19,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:38:19,138 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2022-04-28 05:38:19,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:38:19,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 82 transitions. [2022-04-28 05:38:19,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2022-04-28 05:38:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 05:38:19,227 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:38:19,227 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:38:19,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 05:38:19,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:38:19,432 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:38:19,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:38:19,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2044027516, now seen corresponding path program 1 times [2022-04-28 05:38:19,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:19,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1688242527] [2022-04-28 05:38:19,433 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:38:19,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2044027516, now seen corresponding path program 2 times [2022-04-28 05:38:19,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:38:19,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455924611] [2022-04-28 05:38:19,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:38:19,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:38:19,462 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:38:19,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478199388] [2022-04-28 05:38:19,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:38:19,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:38:19,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:38:19,469 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:38:19,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 05:38:19,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:38:19,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:38:19,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:38:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:38:19,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:38:19,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {3879#true} call ULTIMATE.init(); {3879#true} is VALID [2022-04-28 05:38:19,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {3879#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);~counter~0 := 0; {3879#true} is VALID [2022-04-28 05:38:19,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:19,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3879#true} {3879#true} #98#return; {3879#true} is VALID [2022-04-28 05:38:19,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {3879#true} call #t~ret8 := main(); {3879#true} is VALID [2022-04-28 05:38:19,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {3879#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3879#true} is VALID [2022-04-28 05:38:19,645 INFO L272 TraceCheckUtils]: 6: Hoare triple {3879#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:19,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:19,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:19,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:19,645 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3879#true} {3879#true} #78#return; {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L272 TraceCheckUtils]: 11: Hoare triple {3879#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3879#true} {3879#true} #80#return; {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {3879#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; {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L272 TraceCheckUtils]: 17: Hoare triple {3879#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3879#true} {3879#true} #82#return; {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L272 TraceCheckUtils]: 22: Hoare triple {3879#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3879#true} {3879#true} #84#return; {3879#true} is VALID [2022-04-28 05:38:19,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3879#true} is VALID [2022-04-28 05:38:19,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#true} assume !!(#t~post6 < 10);havoc #t~post6; {3879#true} is VALID [2022-04-28 05:38:19,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {3879#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:19,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:19,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:19,647 INFO L272 TraceCheckUtils]: 32: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-28 05:38:19,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:19,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:19,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:19,648 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #86#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:19,648 INFO L272 TraceCheckUtils]: 37: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-28 05:38:19,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:19,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:19,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:19,649 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #88#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:19,649 INFO L272 TraceCheckUtils]: 42: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-28 05:38:19,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:19,649 INFO L290 TraceCheckUtils]: 44: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:19,649 INFO L290 TraceCheckUtils]: 45: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:19,649 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #90#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:19,649 INFO L272 TraceCheckUtils]: 47: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-28 05:38:19,650 INFO L290 TraceCheckUtils]: 48: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:19,650 INFO L290 TraceCheckUtils]: 49: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:19,650 INFO L290 TraceCheckUtils]: 50: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:19,650 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #92#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:19,651 INFO L290 TraceCheckUtils]: 52: Hoare triple {3971#(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; {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} is VALID [2022-04-28 05:38:19,652 INFO L290 TraceCheckUtils]: 53: Hoare triple {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} is VALID [2022-04-28 05:38:19,653 INFO L290 TraceCheckUtils]: 54: Hoare triple {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} is VALID [2022-04-28 05:38:19,653 INFO L272 TraceCheckUtils]: 55: Hoare triple {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:38:19,653 INFO L290 TraceCheckUtils]: 56: Hoare triple {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:38:19,654 INFO L290 TraceCheckUtils]: 57: Hoare triple {4055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3880#false} is VALID [2022-04-28 05:38:19,655 INFO L290 TraceCheckUtils]: 58: Hoare triple {3880#false} assume !false; {3880#false} is VALID [2022-04-28 05:38:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:38:19,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:38:40,737 INFO L290 TraceCheckUtils]: 58: Hoare triple {3880#false} assume !false; {3880#false} is VALID [2022-04-28 05:38:40,738 INFO L290 TraceCheckUtils]: 57: Hoare triple {4055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3880#false} is VALID [2022-04-28 05:38:40,738 INFO L290 TraceCheckUtils]: 56: Hoare triple {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:38:40,739 INFO L272 TraceCheckUtils]: 55: Hoare triple {4071#(= 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)); {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:38:40,739 INFO L290 TraceCheckUtils]: 54: Hoare triple {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:38:40,740 INFO L290 TraceCheckUtils]: 53: Hoare triple {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:38:40,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {3971#(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; {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:38:40,741 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #92#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:40,741 INFO L290 TraceCheckUtils]: 50: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:40,741 INFO L290 TraceCheckUtils]: 49: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:40,741 INFO L290 TraceCheckUtils]: 48: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:40,741 INFO L272 TraceCheckUtils]: 47: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-28 05:38:40,742 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #90#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:40,742 INFO L290 TraceCheckUtils]: 45: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:40,742 INFO L290 TraceCheckUtils]: 44: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:40,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:40,742 INFO L272 TraceCheckUtils]: 42: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-28 05:38:40,743 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #88#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:40,743 INFO L290 TraceCheckUtils]: 40: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:40,743 INFO L290 TraceCheckUtils]: 39: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:40,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:40,743 INFO L272 TraceCheckUtils]: 37: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-28 05:38:40,743 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #86#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:40,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:40,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:40,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:40,744 INFO L272 TraceCheckUtils]: 32: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-28 05:38:40,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:40,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:40,745 INFO L290 TraceCheckUtils]: 29: Hoare triple {3879#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:40,745 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#true} assume !!(#t~post6 < 10);havoc #t~post6; {3879#true} is VALID [2022-04-28 05:38:40,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3879#true} is VALID [2022-04-28 05:38:40,745 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3879#true} {3879#true} #84#return; {3879#true} is VALID [2022-04-28 05:38:40,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:40,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:40,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:40,745 INFO L272 TraceCheckUtils]: 22: Hoare triple {3879#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:40,745 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3879#true} {3879#true} #82#return; {3879#true} is VALID [2022-04-28 05:38:40,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:40,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:40,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:40,745 INFO L272 TraceCheckUtils]: 17: Hoare triple {3879#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:40,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {3879#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; {3879#true} is VALID [2022-04-28 05:38:40,745 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3879#true} {3879#true} #80#return; {3879#true} is VALID [2022-04-28 05:38:40,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:40,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:40,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:40,746 INFO L272 TraceCheckUtils]: 11: Hoare triple {3879#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:40,746 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3879#true} {3879#true} #78#return; {3879#true} is VALID [2022-04-28 05:38:40,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:40,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:40,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:40,746 INFO L272 TraceCheckUtils]: 6: Hoare triple {3879#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:40,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {3879#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3879#true} is VALID [2022-04-28 05:38:40,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {3879#true} call #t~ret8 := main(); {3879#true} is VALID [2022-04-28 05:38:40,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3879#true} {3879#true} #98#return; {3879#true} is VALID [2022-04-28 05:38:40,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:40,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {3879#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);~counter~0 := 0; {3879#true} is VALID [2022-04-28 05:38:40,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {3879#true} call ULTIMATE.init(); {3879#true} is VALID [2022-04-28 05:38:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:38:40,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:38:40,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455924611] [2022-04-28 05:38:40,747 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:38:40,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478199388] [2022-04-28 05:38:40,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478199388] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:38:40,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:38:40,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-28 05:38:40,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:38:40,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1688242527] [2022-04-28 05:38:40,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1688242527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:38:40,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:38:40,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:38:40,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709527335] [2022-04-28 05:38:40,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:38:40,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 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 59 [2022-04-28 05:38:40,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:38:40,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 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 05:38:40,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:40,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:38:40,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:40,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:38:40,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 05:38:40,783 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 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 05:38:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:41,116 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2022-04-28 05:38:41,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:38:41,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 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 59 [2022-04-28 05:38:41,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:38:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 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 05:38:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-28 05:38:41,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 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 05:38:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-28 05:38:41,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-28 05:38:41,189 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 05:38:41,191 INFO L225 Difference]: With dead ends: 96 [2022-04-28 05:38:41,191 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 05:38:41,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:38:41,192 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:38:41,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 208 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:38:41,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 05:38:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2022-04-28 05:38:41,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:38:41,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:38:41,262 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:38:41,262 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:38:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:41,265 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2022-04-28 05:38:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2022-04-28 05:38:41,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:41,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:41,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 94 states. [2022-04-28 05:38:41,266 INFO L87 Difference]: Start difference. First operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 94 states. [2022-04-28 05:38:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:41,268 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2022-04-28 05:38:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2022-04-28 05:38:41,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:41,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:41,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:38:41,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:38:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:38:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2022-04-28 05:38:41,271 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 59 [2022-04-28 05:38:41,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:38:41,271 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2022-04-28 05:38:41,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 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 05:38:41,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 111 transitions. [2022-04-28 05:38:41,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2022-04-28 05:38:41,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 05:38:41,381 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:38:41,381 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:38:41,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 05:38:41,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 05:38:41,581 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:38:41,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:38:41,582 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 1 times [2022-04-28 05:38:41,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:41,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1293902455] [2022-04-28 05:38:41,582 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:38:41,582 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 2 times [2022-04-28 05:38:41,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:38:41,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539952017] [2022-04-28 05:38:41,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:38:41,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:38:41,591 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:38:41,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1607764495] [2022-04-28 05:38:41,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:38:41,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:38:41,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:38:41,592 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:38:41,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 05:38:41,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:38:41,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:38:41,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:38:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:38:41,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:38:41,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {4789#true} call ULTIMATE.init(); {4789#true} is VALID [2022-04-28 05:38:41,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {4789#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);~counter~0 := 0; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4797#(<= ~counter~0 0)} {4789#true} #98#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {4797#(<= ~counter~0 0)} call #t~ret8 := main(); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {4797#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,874 INFO L272 TraceCheckUtils]: 6: Hoare triple {4797#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #78#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,876 INFO L272 TraceCheckUtils]: 11: Hoare triple {4797#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,878 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #80#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {4797#(<= ~counter~0 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; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,879 INFO L272 TraceCheckUtils]: 17: Hoare triple {4797#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,880 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #82#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,880 INFO L272 TraceCheckUtils]: 22: Hoare triple {4797#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,881 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #84#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:41,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {4797#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4876#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:41,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {4876#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {4876#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:41,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {4876#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4876#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:41,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {4876#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {4886#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,884 INFO L272 TraceCheckUtils]: 32: Hoare triple {4886#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,885 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #86#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,886 INFO L272 TraceCheckUtils]: 37: Hoare triple {4886#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,886 INFO L290 TraceCheckUtils]: 38: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,886 INFO L290 TraceCheckUtils]: 39: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,887 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #88#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,887 INFO L272 TraceCheckUtils]: 42: Hoare triple {4886#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,888 INFO L290 TraceCheckUtils]: 45: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,889 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #90#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,889 INFO L272 TraceCheckUtils]: 47: Hoare triple {4886#(<= ~counter~0 2)} 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)); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,890 INFO L290 TraceCheckUtils]: 48: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,890 INFO L290 TraceCheckUtils]: 49: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,891 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #92#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,891 INFO L290 TraceCheckUtils]: 52: Hoare triple {4886#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {4886#(<= ~counter~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; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:41,892 INFO L290 TraceCheckUtils]: 54: Hoare triple {4886#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4959#(<= |main_#t~post6| 2)} is VALID [2022-04-28 05:38:41,892 INFO L290 TraceCheckUtils]: 55: Hoare triple {4959#(<= |main_#t~post6| 2)} assume !(#t~post6 < 10);havoc #t~post6; {4790#false} is VALID [2022-04-28 05:38:41,892 INFO L272 TraceCheckUtils]: 56: Hoare triple {4790#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {4790#false} is VALID [2022-04-28 05:38:41,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#false} ~cond := #in~cond; {4790#false} is VALID [2022-04-28 05:38:41,892 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#false} assume 0 == ~cond; {4790#false} is VALID [2022-04-28 05:38:41,892 INFO L290 TraceCheckUtils]: 59: Hoare triple {4790#false} assume !false; {4790#false} is VALID [2022-04-28 05:38:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:38:41,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:38:42,137 INFO L290 TraceCheckUtils]: 59: Hoare triple {4790#false} assume !false; {4790#false} is VALID [2022-04-28 05:38:42,137 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#false} assume 0 == ~cond; {4790#false} is VALID [2022-04-28 05:38:42,138 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#false} ~cond := #in~cond; {4790#false} is VALID [2022-04-28 05:38:42,138 INFO L272 TraceCheckUtils]: 56: Hoare triple {4790#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {4790#false} is VALID [2022-04-28 05:38:42,138 INFO L290 TraceCheckUtils]: 55: Hoare triple {4987#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {4790#false} is VALID [2022-04-28 05:38:42,138 INFO L290 TraceCheckUtils]: 54: Hoare triple {4991#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4987#(< |main_#t~post6| 10)} is VALID [2022-04-28 05:38:42,139 INFO L290 TraceCheckUtils]: 53: Hoare triple {4991#(< ~counter~0 10)} ~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; {4991#(< ~counter~0 10)} is VALID [2022-04-28 05:38:42,139 INFO L290 TraceCheckUtils]: 52: Hoare triple {4991#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {4991#(< ~counter~0 10)} is VALID [2022-04-28 05:38:42,140 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4789#true} {4991#(< ~counter~0 10)} #92#return; {4991#(< ~counter~0 10)} is VALID [2022-04-28 05:38:42,140 INFO L290 TraceCheckUtils]: 50: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 05:38:42,140 INFO L290 TraceCheckUtils]: 49: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 05:38:42,140 INFO L290 TraceCheckUtils]: 48: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 05:38:42,140 INFO L272 TraceCheckUtils]: 47: Hoare triple {4991#(< ~counter~0 10)} 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)); {4789#true} is VALID [2022-04-28 05:38:42,141 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4789#true} {4991#(< ~counter~0 10)} #90#return; {4991#(< ~counter~0 10)} is VALID [2022-04-28 05:38:42,141 INFO L290 TraceCheckUtils]: 45: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 05:38:42,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 05:38:42,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 05:38:42,141 INFO L272 TraceCheckUtils]: 42: Hoare triple {4991#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4789#true} is VALID [2022-04-28 05:38:42,141 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4789#true} {4991#(< ~counter~0 10)} #88#return; {4991#(< ~counter~0 10)} is VALID [2022-04-28 05:38:42,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 05:38:42,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 05:38:42,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 05:38:42,142 INFO L272 TraceCheckUtils]: 37: Hoare triple {4991#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4789#true} is VALID [2022-04-28 05:38:42,142 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4789#true} {4991#(< ~counter~0 10)} #86#return; {4991#(< ~counter~0 10)} is VALID [2022-04-28 05:38:42,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 05:38:42,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 05:38:42,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 05:38:42,143 INFO L272 TraceCheckUtils]: 32: Hoare triple {4991#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4789#true} is VALID [2022-04-28 05:38:42,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {4991#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {4991#(< ~counter~0 10)} is VALID [2022-04-28 05:38:42,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {5064#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4991#(< ~counter~0 10)} is VALID [2022-04-28 05:38:42,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {5064#(< ~counter~0 9)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5064#(< ~counter~0 9)} is VALID [2022-04-28 05:38:42,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {5064#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {5064#(< ~counter~0 9)} is VALID [2022-04-28 05:38:42,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {5074#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5064#(< ~counter~0 9)} is VALID [2022-04-28 05:38:42,145 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4789#true} {5074#(< ~counter~0 8)} #84#return; {5074#(< ~counter~0 8)} is VALID [2022-04-28 05:38:42,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 05:38:42,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 05:38:42,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 05:38:42,145 INFO L272 TraceCheckUtils]: 22: Hoare triple {5074#(< ~counter~0 8)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4789#true} is VALID [2022-04-28 05:38:42,146 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4789#true} {5074#(< ~counter~0 8)} #82#return; {5074#(< ~counter~0 8)} is VALID [2022-04-28 05:38:42,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 05:38:42,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 05:38:42,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 05:38:42,146 INFO L272 TraceCheckUtils]: 17: Hoare triple {5074#(< ~counter~0 8)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4789#true} is VALID [2022-04-28 05:38:42,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {5074#(< ~counter~0 8)} ~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; {5074#(< ~counter~0 8)} is VALID [2022-04-28 05:38:42,147 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4789#true} {5074#(< ~counter~0 8)} #80#return; {5074#(< ~counter~0 8)} is VALID [2022-04-28 05:38:42,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 05:38:42,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 05:38:42,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 05:38:42,147 INFO L272 TraceCheckUtils]: 11: Hoare triple {5074#(< ~counter~0 8)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4789#true} is VALID [2022-04-28 05:38:42,147 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4789#true} {5074#(< ~counter~0 8)} #78#return; {5074#(< ~counter~0 8)} is VALID [2022-04-28 05:38:42,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 05:38:42,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 05:38:42,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 05:38:42,148 INFO L272 TraceCheckUtils]: 6: Hoare triple {5074#(< ~counter~0 8)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4789#true} is VALID [2022-04-28 05:38:42,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {5074#(< ~counter~0 8)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5074#(< ~counter~0 8)} is VALID [2022-04-28 05:38:42,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {5074#(< ~counter~0 8)} call #t~ret8 := main(); {5074#(< ~counter~0 8)} is VALID [2022-04-28 05:38:42,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5074#(< ~counter~0 8)} {4789#true} #98#return; {5074#(< ~counter~0 8)} is VALID [2022-04-28 05:38:42,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {5074#(< ~counter~0 8)} assume true; {5074#(< ~counter~0 8)} is VALID [2022-04-28 05:38:42,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {4789#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);~counter~0 := 0; {5074#(< ~counter~0 8)} is VALID [2022-04-28 05:38:42,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {4789#true} call ULTIMATE.init(); {4789#true} is VALID [2022-04-28 05:38:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:38:42,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:38:42,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539952017] [2022-04-28 05:38:42,150 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:38:42,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607764495] [2022-04-28 05:38:42,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607764495] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:38:42,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:38:42,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 05:38:42,150 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:38:42,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1293902455] [2022-04-28 05:38:42,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1293902455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:38:42,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:38:42,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:38:42,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419022906] [2022-04-28 05:38:42,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:38:42,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 60 [2022-04-28 05:38:42,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:38:42,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:42,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:42,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:38:42,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:42,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:38:42,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:38:42,186 INFO L87 Difference]: Start difference. First operand 84 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:42,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:42,383 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2022-04-28 05:38:42,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:38:42,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 60 [2022-04-28 05:38:42,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:38:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 05:38:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 05:38:42,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 05:38:42,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:42,436 INFO L225 Difference]: With dead ends: 111 [2022-04-28 05:38:42,436 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 05:38:42,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:38:42,437 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 8 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:38:42,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 138 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:38:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 05:38:42,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-28 05:38:42,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:38:42,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:38:42,540 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:38:42,540 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:38:42,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:42,542 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-28 05:38:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-28 05:38:42,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:42,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:42,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 103 states. [2022-04-28 05:38:42,542 INFO L87 Difference]: Start difference. First operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 103 states. [2022-04-28 05:38:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:42,544 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-28 05:38:42,544 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-28 05:38:42,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:42,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:42,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:38:42,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:38:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:38:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2022-04-28 05:38:42,546 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 60 [2022-04-28 05:38:42,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:38:42,546 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2022-04-28 05:38:42,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:42,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 126 transitions. [2022-04-28 05:38:42,699 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 05:38:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-28 05:38:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 05:38:42,700 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:38:42,700 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 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 05:38:42,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 05:38:42,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 05:38:42,901 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:38:42,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:38:42,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 1 times [2022-04-28 05:38:42,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:42,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [384477762] [2022-04-28 05:38:42,901 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:38:42,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 2 times [2022-04-28 05:38:42,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:38:42,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124148091] [2022-04-28 05:38:42,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:38:42,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:38:42,911 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:38:42,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2075937249] [2022-04-28 05:38:42,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:38:42,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:38:42,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:38:42,912 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:38:42,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 05:38:42,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:38:42,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:38:42,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:38:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:38:42,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:38:43,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {5794#true} call ULTIMATE.init(); {5794#true} is VALID [2022-04-28 05:38:43,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {5794#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);~counter~0 := 0; {5794#true} is VALID [2022-04-28 05:38:43,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 05:38:43,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5794#true} {5794#true} #98#return; {5794#true} is VALID [2022-04-28 05:38:43,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {5794#true} call #t~ret8 := main(); {5794#true} is VALID [2022-04-28 05:38:43,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {5794#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5794#true} is VALID [2022-04-28 05:38:43,131 INFO L272 TraceCheckUtils]: 6: Hoare triple {5794#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5794#true} is VALID [2022-04-28 05:38:43,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {5794#true} ~cond := #in~cond; {5820#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:38:43,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {5820#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5824#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:38:43,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {5824#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5824#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:38:43,132 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5824#(not (= |assume_abort_if_not_#in~cond| 0))} {5794#true} #78#return; {5831#(<= 1 main_~x~0)} is VALID [2022-04-28 05:38:43,132 INFO L272 TraceCheckUtils]: 11: Hoare triple {5831#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5794#true} is VALID [2022-04-28 05:38:43,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 05:38:43,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 05:38:43,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 05:38:43,133 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5794#true} {5831#(<= 1 main_~x~0)} #80#return; {5831#(<= 1 main_~x~0)} is VALID [2022-04-28 05:38:43,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {5831#(<= 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; {5850#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:43,133 INFO L272 TraceCheckUtils]: 17: Hoare triple {5850#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {5794#true} is VALID [2022-04-28 05:38:43,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 05:38:43,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 05:38:43,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 05:38:43,134 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5794#true} {5850#(<= 1 main_~a~0)} #82#return; {5850#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:43,134 INFO L272 TraceCheckUtils]: 22: Hoare triple {5850#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {5794#true} is VALID [2022-04-28 05:38:43,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 05:38:43,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 05:38:43,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 05:38:43,134 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5794#true} {5850#(<= 1 main_~a~0)} #84#return; {5850#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:43,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {5850#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5850#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:43,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {5850#(<= 1 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {5850#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:43,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {5850#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5890#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:43,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {5890#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5890#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:43,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {5890#(<= 1 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {5890#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:43,136 INFO L272 TraceCheckUtils]: 32: Hoare triple {5890#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5794#true} is VALID [2022-04-28 05:38:43,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 05:38:43,136 INFO L290 TraceCheckUtils]: 34: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 05:38:43,136 INFO L290 TraceCheckUtils]: 35: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 05:38:43,136 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #86#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:43,136 INFO L272 TraceCheckUtils]: 37: Hoare triple {5890#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5794#true} is VALID [2022-04-28 05:38:43,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 05:38:43,136 INFO L290 TraceCheckUtils]: 39: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 05:38:43,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 05:38:43,137 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #88#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:43,137 INFO L272 TraceCheckUtils]: 42: Hoare triple {5890#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5794#true} is VALID [2022-04-28 05:38:43,137 INFO L290 TraceCheckUtils]: 43: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 05:38:43,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 05:38:43,137 INFO L290 TraceCheckUtils]: 45: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 05:38:43,138 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #90#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:43,138 INFO L272 TraceCheckUtils]: 47: Hoare triple {5890#(<= 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)); {5794#true} is VALID [2022-04-28 05:38:43,138 INFO L290 TraceCheckUtils]: 48: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 05:38:43,138 INFO L290 TraceCheckUtils]: 49: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 05:38:43,138 INFO L290 TraceCheckUtils]: 50: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 05:38:43,138 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #92#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:43,139 INFO L290 TraceCheckUtils]: 52: Hoare triple {5890#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {5890#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:43,139 INFO L290 TraceCheckUtils]: 53: Hoare triple {5890#(<= 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; {5963#(<= 1 main_~b~0)} is VALID [2022-04-28 05:38:43,139 INFO L290 TraceCheckUtils]: 54: Hoare triple {5963#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5963#(<= 1 main_~b~0)} is VALID [2022-04-28 05:38:43,140 INFO L290 TraceCheckUtils]: 55: Hoare triple {5963#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {5963#(<= 1 main_~b~0)} is VALID [2022-04-28 05:38:43,140 INFO L290 TraceCheckUtils]: 56: Hoare triple {5963#(<= 1 main_~b~0)} assume !(0 != ~b~0); {5795#false} is VALID [2022-04-28 05:38:43,140 INFO L272 TraceCheckUtils]: 57: Hoare triple {5795#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {5795#false} is VALID [2022-04-28 05:38:43,140 INFO L290 TraceCheckUtils]: 58: Hoare triple {5795#false} ~cond := #in~cond; {5795#false} is VALID [2022-04-28 05:38:43,140 INFO L290 TraceCheckUtils]: 59: Hoare triple {5795#false} assume 0 == ~cond; {5795#false} is VALID [2022-04-28 05:38:43,140 INFO L290 TraceCheckUtils]: 60: Hoare triple {5795#false} assume !false; {5795#false} is VALID [2022-04-28 05:38:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 05:38:43,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:38:43,404 INFO L290 TraceCheckUtils]: 60: Hoare triple {5795#false} assume !false; {5795#false} is VALID [2022-04-28 05:38:43,404 INFO L290 TraceCheckUtils]: 59: Hoare triple {5795#false} assume 0 == ~cond; {5795#false} is VALID [2022-04-28 05:38:43,404 INFO L290 TraceCheckUtils]: 58: Hoare triple {5795#false} ~cond := #in~cond; {5795#false} is VALID [2022-04-28 05:38:43,404 INFO L272 TraceCheckUtils]: 57: Hoare triple {5795#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {5795#false} is VALID [2022-04-28 05:38:43,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {5963#(<= 1 main_~b~0)} assume !(0 != ~b~0); {5795#false} is VALID [2022-04-28 05:38:43,404 INFO L290 TraceCheckUtils]: 55: Hoare triple {5963#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {5963#(<= 1 main_~b~0)} is VALID [2022-04-28 05:38:43,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {5963#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5963#(<= 1 main_~b~0)} is VALID [2022-04-28 05:38:43,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {5890#(<= 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; {5963#(<= 1 main_~b~0)} is VALID [2022-04-28 05:38:43,405 INFO L290 TraceCheckUtils]: 52: Hoare triple {5890#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {5890#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:43,406 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #92#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:43,406 INFO L290 TraceCheckUtils]: 50: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 05:38:43,406 INFO L290 TraceCheckUtils]: 49: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 05:38:43,406 INFO L290 TraceCheckUtils]: 48: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 05:38:43,406 INFO L272 TraceCheckUtils]: 47: Hoare triple {5890#(<= 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)); {5794#true} is VALID [2022-04-28 05:38:43,407 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #90#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:43,407 INFO L290 TraceCheckUtils]: 45: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 05:38:43,407 INFO L290 TraceCheckUtils]: 44: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 05:38:43,407 INFO L290 TraceCheckUtils]: 43: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 05:38:43,407 INFO L272 TraceCheckUtils]: 42: Hoare triple {5890#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5794#true} is VALID [2022-04-28 05:38:43,407 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #88#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:43,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 05:38:43,407 INFO L290 TraceCheckUtils]: 39: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 05:38:43,408 INFO L290 TraceCheckUtils]: 38: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 05:38:43,408 INFO L272 TraceCheckUtils]: 37: Hoare triple {5890#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5794#true} is VALID [2022-04-28 05:38:43,408 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #86#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:43,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 05:38:43,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 05:38:43,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 05:38:43,408 INFO L272 TraceCheckUtils]: 32: Hoare triple {5890#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5794#true} is VALID [2022-04-28 05:38:43,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {5890#(<= 1 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {5890#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:43,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {5890#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5890#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:43,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {5850#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5890#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:43,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {5850#(<= 1 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {5850#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:43,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {5850#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5850#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:43,410 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5794#true} {5850#(<= 1 main_~a~0)} #84#return; {5850#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:43,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 05:38:43,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 05:38:43,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 05:38:43,410 INFO L272 TraceCheckUtils]: 22: Hoare triple {5850#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {5794#true} is VALID [2022-04-28 05:38:43,410 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5794#true} {5850#(<= 1 main_~a~0)} #82#return; {5850#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:43,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 05:38:43,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 05:38:43,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 05:38:43,411 INFO L272 TraceCheckUtils]: 17: Hoare triple {5850#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {5794#true} is VALID [2022-04-28 05:38:43,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {5831#(<= 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; {5850#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:43,414 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5794#true} {5831#(<= 1 main_~x~0)} #80#return; {5831#(<= 1 main_~x~0)} is VALID [2022-04-28 05:38:43,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 05:38:43,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 05:38:43,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 05:38:43,414 INFO L272 TraceCheckUtils]: 11: Hoare triple {5831#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5794#true} is VALID [2022-04-28 05:38:43,415 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5824#(not (= |assume_abort_if_not_#in~cond| 0))} {5794#true} #78#return; {5831#(<= 1 main_~x~0)} is VALID [2022-04-28 05:38:43,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {5824#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5824#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:38:43,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {6144#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {5824#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:38:43,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {5794#true} ~cond := #in~cond; {6144#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 05:38:43,416 INFO L272 TraceCheckUtils]: 6: Hoare triple {5794#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5794#true} is VALID [2022-04-28 05:38:43,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {5794#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5794#true} is VALID [2022-04-28 05:38:43,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {5794#true} call #t~ret8 := main(); {5794#true} is VALID [2022-04-28 05:38:43,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5794#true} {5794#true} #98#return; {5794#true} is VALID [2022-04-28 05:38:43,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 05:38:43,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {5794#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);~counter~0 := 0; {5794#true} is VALID [2022-04-28 05:38:43,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {5794#true} call ULTIMATE.init(); {5794#true} is VALID [2022-04-28 05:38:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 05:38:43,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:38:43,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124148091] [2022-04-28 05:38:43,416 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:38:43,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075937249] [2022-04-28 05:38:43,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075937249] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:38:43,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:38:43,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 05:38:43,417 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:38:43,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [384477762] [2022-04-28 05:38:43,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [384477762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:38:43,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:38:43,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:38:43,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024284442] [2022-04-28 05:38:43,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:38:43,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-28 05:38:43,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:38:43,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 05:38:43,445 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 05:38:43,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:38:43,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:43,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:38:43,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:38:43,446 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 05:38:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:44,315 INFO L93 Difference]: Finished difference Result 182 states and 256 transitions. [2022-04-28 05:38:44,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:38:44,315 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-28 05:38:44,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:38:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 05:38:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-28 05:38:44,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 05:38:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-28 05:38:44,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 147 transitions. [2022-04-28 05:38:44,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:44,460 INFO L225 Difference]: With dead ends: 182 [2022-04-28 05:38:44,460 INFO L226 Difference]: Without dead ends: 174 [2022-04-28 05:38:44,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:38:44,460 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 59 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:38:44,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 317 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:38:44,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-28 05:38:44,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 146. [2022-04-28 05:38:44,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:38:44,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 05:38:44,645 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 05:38:44,646 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 05:38:44,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:44,650 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2022-04-28 05:38:44,650 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2022-04-28 05:38:44,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:44,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:44,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) Second operand 174 states. [2022-04-28 05:38:44,651 INFO L87 Difference]: Start difference. First operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) Second operand 174 states. [2022-04-28 05:38:44,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:44,655 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2022-04-28 05:38:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2022-04-28 05:38:44,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:44,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:44,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:38:44,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:38:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 05:38:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2022-04-28 05:38:44,660 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 61 [2022-04-28 05:38:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:38:44,660 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2022-04-28 05:38:44,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 05:38:44,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 199 transitions. [2022-04-28 05:38:44,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2022-04-28 05:38:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 05:38:44,858 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:38:44,859 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1] [2022-04-28 05:38:44,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 05:38:45,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 05:38:45,063 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:38:45,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:38:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1537891564, now seen corresponding path program 1 times [2022-04-28 05:38:45,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:45,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1520946161] [2022-04-28 05:38:45,064 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:38:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1537891564, now seen corresponding path program 2 times [2022-04-28 05:38:45,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:38:45,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920759422] [2022-04-28 05:38:45,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:38:45,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:38:45,074 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:38:45,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [427763931] [2022-04-28 05:38:45,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:38:45,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:38:45,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:38:45,075 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:38:45,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 05:38:45,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:38:45,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:38:45,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:38:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:38:45,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:38:45,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {7186#true} call ULTIMATE.init(); {7186#true} is VALID [2022-04-28 05:38:45,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {7186#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);~counter~0 := 0; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7194#(<= ~counter~0 0)} {7186#true} #98#return; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {7194#(<= ~counter~0 0)} call #t~ret8 := main(); {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {7194#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,330 INFO L272 TraceCheckUtils]: 6: Hoare triple {7194#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {7194#(<= ~counter~0 0)} ~cond := #in~cond; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {7194#(<= ~counter~0 0)} assume !(0 == ~cond); {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,332 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7194#(<= ~counter~0 0)} {7194#(<= ~counter~0 0)} #78#return; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,332 INFO L272 TraceCheckUtils]: 11: Hoare triple {7194#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {7194#(<= ~counter~0 0)} ~cond := #in~cond; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {7194#(<= ~counter~0 0)} assume !(0 == ~cond); {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,333 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7194#(<= ~counter~0 0)} {7194#(<= ~counter~0 0)} #80#return; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {7194#(<= ~counter~0 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; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,334 INFO L272 TraceCheckUtils]: 17: Hoare triple {7194#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {7194#(<= ~counter~0 0)} ~cond := #in~cond; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {7194#(<= ~counter~0 0)} assume !(0 == ~cond); {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,343 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7194#(<= ~counter~0 0)} {7194#(<= ~counter~0 0)} #82#return; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,344 INFO L272 TraceCheckUtils]: 22: Hoare triple {7194#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {7194#(<= ~counter~0 0)} ~cond := #in~cond; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {7194#(<= ~counter~0 0)} assume !(0 == ~cond); {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,345 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7194#(<= ~counter~0 0)} {7194#(<= ~counter~0 0)} #84#return; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:45,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {7194#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7273#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:45,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {7273#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {7273#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:45,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {7273#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7273#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:45,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {7273#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {7283#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,347 INFO L272 TraceCheckUtils]: 32: Hoare triple {7283#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {7283#(<= ~counter~0 2)} ~cond := #in~cond; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {7283#(<= ~counter~0 2)} assume !(0 == ~cond); {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {7283#(<= ~counter~0 2)} assume true; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,348 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7283#(<= ~counter~0 2)} {7283#(<= ~counter~0 2)} #86#return; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,349 INFO L272 TraceCheckUtils]: 37: Hoare triple {7283#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {7283#(<= ~counter~0 2)} ~cond := #in~cond; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,350 INFO L290 TraceCheckUtils]: 39: Hoare triple {7283#(<= ~counter~0 2)} assume !(0 == ~cond); {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,350 INFO L290 TraceCheckUtils]: 40: Hoare triple {7283#(<= ~counter~0 2)} assume true; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,350 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7283#(<= ~counter~0 2)} {7283#(<= ~counter~0 2)} #88#return; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,351 INFO L272 TraceCheckUtils]: 42: Hoare triple {7283#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,351 INFO L290 TraceCheckUtils]: 43: Hoare triple {7283#(<= ~counter~0 2)} ~cond := #in~cond; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,351 INFO L290 TraceCheckUtils]: 44: Hoare triple {7283#(<= ~counter~0 2)} assume !(0 == ~cond); {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,352 INFO L290 TraceCheckUtils]: 45: Hoare triple {7283#(<= ~counter~0 2)} assume true; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,352 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7283#(<= ~counter~0 2)} {7283#(<= ~counter~0 2)} #90#return; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,353 INFO L272 TraceCheckUtils]: 47: Hoare triple {7283#(<= ~counter~0 2)} 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)); {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,353 INFO L290 TraceCheckUtils]: 48: Hoare triple {7283#(<= ~counter~0 2)} ~cond := #in~cond; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,353 INFO L290 TraceCheckUtils]: 49: Hoare triple {7283#(<= ~counter~0 2)} assume !(0 == ~cond); {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,354 INFO L290 TraceCheckUtils]: 50: Hoare triple {7283#(<= ~counter~0 2)} assume true; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,354 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7283#(<= ~counter~0 2)} {7283#(<= ~counter~0 2)} #92#return; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,355 INFO L290 TraceCheckUtils]: 52: Hoare triple {7283#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:45,355 INFO L290 TraceCheckUtils]: 53: Hoare triple {7283#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7353#(<= |main_#t~post7| 2)} is VALID [2022-04-28 05:38:45,355 INFO L290 TraceCheckUtils]: 54: Hoare triple {7353#(<= |main_#t~post7| 2)} assume !(#t~post7 < 10);havoc #t~post7; {7187#false} is VALID [2022-04-28 05:38:45,355 INFO L290 TraceCheckUtils]: 55: Hoare triple {7187#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; {7187#false} is VALID [2022-04-28 05:38:45,355 INFO L290 TraceCheckUtils]: 56: Hoare triple {7187#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7187#false} is VALID [2022-04-28 05:38:45,355 INFO L290 TraceCheckUtils]: 57: Hoare triple {7187#false} assume !(#t~post6 < 10);havoc #t~post6; {7187#false} is VALID [2022-04-28 05:38:45,355 INFO L272 TraceCheckUtils]: 58: Hoare triple {7187#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {7187#false} is VALID [2022-04-28 05:38:45,355 INFO L290 TraceCheckUtils]: 59: Hoare triple {7187#false} ~cond := #in~cond; {7187#false} is VALID [2022-04-28 05:38:45,356 INFO L290 TraceCheckUtils]: 60: Hoare triple {7187#false} assume 0 == ~cond; {7187#false} is VALID [2022-04-28 05:38:45,356 INFO L290 TraceCheckUtils]: 61: Hoare triple {7187#false} assume !false; {7187#false} is VALID [2022-04-28 05:38:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:38:45,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:38:45,565 INFO L290 TraceCheckUtils]: 61: Hoare triple {7187#false} assume !false; {7187#false} is VALID [2022-04-28 05:38:45,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {7187#false} assume 0 == ~cond; {7187#false} is VALID [2022-04-28 05:38:45,565 INFO L290 TraceCheckUtils]: 59: Hoare triple {7187#false} ~cond := #in~cond; {7187#false} is VALID [2022-04-28 05:38:45,565 INFO L272 TraceCheckUtils]: 58: Hoare triple {7187#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {7187#false} is VALID [2022-04-28 05:38:45,565 INFO L290 TraceCheckUtils]: 57: Hoare triple {7187#false} assume !(#t~post6 < 10);havoc #t~post6; {7187#false} is VALID [2022-04-28 05:38:45,565 INFO L290 TraceCheckUtils]: 56: Hoare triple {7187#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7187#false} is VALID [2022-04-28 05:38:45,565 INFO L290 TraceCheckUtils]: 55: Hoare triple {7187#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; {7187#false} is VALID [2022-04-28 05:38:45,565 INFO L290 TraceCheckUtils]: 54: Hoare triple {7399#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {7187#false} is VALID [2022-04-28 05:38:45,566 INFO L290 TraceCheckUtils]: 53: Hoare triple {7403#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7399#(< |main_#t~post7| 10)} is VALID [2022-04-28 05:38:45,566 INFO L290 TraceCheckUtils]: 52: Hoare triple {7403#(< ~counter~0 10)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {7403#(< ~counter~0 10)} is VALID [2022-04-28 05:38:45,567 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7186#true} {7403#(< ~counter~0 10)} #92#return; {7403#(< ~counter~0 10)} is VALID [2022-04-28 05:38:45,567 INFO L290 TraceCheckUtils]: 50: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-28 05:38:45,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-28 05:38:45,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-28 05:38:45,567 INFO L272 TraceCheckUtils]: 47: Hoare triple {7403#(< ~counter~0 10)} 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)); {7186#true} is VALID [2022-04-28 05:38:45,567 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7186#true} {7403#(< ~counter~0 10)} #90#return; {7403#(< ~counter~0 10)} is VALID [2022-04-28 05:38:45,567 INFO L290 TraceCheckUtils]: 45: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-28 05:38:45,567 INFO L290 TraceCheckUtils]: 44: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-28 05:38:45,567 INFO L290 TraceCheckUtils]: 43: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-28 05:38:45,568 INFO L272 TraceCheckUtils]: 42: Hoare triple {7403#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7186#true} is VALID [2022-04-28 05:38:45,568 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7186#true} {7403#(< ~counter~0 10)} #88#return; {7403#(< ~counter~0 10)} is VALID [2022-04-28 05:38:45,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-28 05:38:45,568 INFO L290 TraceCheckUtils]: 39: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-28 05:38:45,568 INFO L290 TraceCheckUtils]: 38: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-28 05:38:45,568 INFO L272 TraceCheckUtils]: 37: Hoare triple {7403#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7186#true} is VALID [2022-04-28 05:38:45,569 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7186#true} {7403#(< ~counter~0 10)} #86#return; {7403#(< ~counter~0 10)} is VALID [2022-04-28 05:38:45,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-28 05:38:45,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-28 05:38:45,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-28 05:38:45,569 INFO L272 TraceCheckUtils]: 32: Hoare triple {7403#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7186#true} is VALID [2022-04-28 05:38:45,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {7403#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {7403#(< ~counter~0 10)} is VALID [2022-04-28 05:38:45,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {7473#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7403#(< ~counter~0 10)} is VALID [2022-04-28 05:38:45,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {7473#(< ~counter~0 9)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7473#(< ~counter~0 9)} is VALID [2022-04-28 05:38:45,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {7473#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {7473#(< ~counter~0 9)} is VALID [2022-04-28 05:38:45,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {7483#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7473#(< ~counter~0 9)} is VALID [2022-04-28 05:38:45,571 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7186#true} {7483#(< ~counter~0 8)} #84#return; {7483#(< ~counter~0 8)} is VALID [2022-04-28 05:38:45,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-28 05:38:45,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-28 05:38:45,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-28 05:38:45,571 INFO L272 TraceCheckUtils]: 22: Hoare triple {7483#(< ~counter~0 8)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7186#true} is VALID [2022-04-28 05:38:45,571 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7186#true} {7483#(< ~counter~0 8)} #82#return; {7483#(< ~counter~0 8)} is VALID [2022-04-28 05:38:45,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-28 05:38:45,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-28 05:38:45,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-28 05:38:45,572 INFO L272 TraceCheckUtils]: 17: Hoare triple {7483#(< ~counter~0 8)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7186#true} is VALID [2022-04-28 05:38:45,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {7483#(< ~counter~0 8)} ~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; {7483#(< ~counter~0 8)} is VALID [2022-04-28 05:38:45,572 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7186#true} {7483#(< ~counter~0 8)} #80#return; {7483#(< ~counter~0 8)} is VALID [2022-04-28 05:38:45,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-28 05:38:45,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-28 05:38:45,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-28 05:38:45,573 INFO L272 TraceCheckUtils]: 11: Hoare triple {7483#(< ~counter~0 8)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7186#true} is VALID [2022-04-28 05:38:45,573 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7186#true} {7483#(< ~counter~0 8)} #78#return; {7483#(< ~counter~0 8)} is VALID [2022-04-28 05:38:45,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-28 05:38:45,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-28 05:38:45,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-28 05:38:45,573 INFO L272 TraceCheckUtils]: 6: Hoare triple {7483#(< ~counter~0 8)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7186#true} is VALID [2022-04-28 05:38:45,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {7483#(< ~counter~0 8)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7483#(< ~counter~0 8)} is VALID [2022-04-28 05:38:45,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {7483#(< ~counter~0 8)} call #t~ret8 := main(); {7483#(< ~counter~0 8)} is VALID [2022-04-28 05:38:45,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7483#(< ~counter~0 8)} {7186#true} #98#return; {7483#(< ~counter~0 8)} is VALID [2022-04-28 05:38:45,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {7483#(< ~counter~0 8)} assume true; {7483#(< ~counter~0 8)} is VALID [2022-04-28 05:38:45,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {7186#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);~counter~0 := 0; {7483#(< ~counter~0 8)} is VALID [2022-04-28 05:38:45,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {7186#true} call ULTIMATE.init(); {7186#true} is VALID [2022-04-28 05:38:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:38:45,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:38:45,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920759422] [2022-04-28 05:38:45,575 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:38:45,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427763931] [2022-04-28 05:38:45,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427763931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:38:45,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:38:45,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 05:38:45,575 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:38:45,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1520946161] [2022-04-28 05:38:45,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1520946161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:38:45,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:38:45,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:38:45,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642061485] [2022-04-28 05:38:45,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:38:45,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-28 05:38:45,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:38:45,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:45,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:45,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:38:45,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:45,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:38:45,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:38:45,605 INFO L87 Difference]: Start difference. First operand 146 states and 199 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:45,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:45,998 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2022-04-28 05:38:45,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:38:45,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-28 05:38:45,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:38:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-28 05:38:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-28 05:38:46,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2022-04-28 05:38:46,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:46,061 INFO L225 Difference]: With dead ends: 183 [2022-04-28 05:38:46,062 INFO L226 Difference]: Without dead ends: 146 [2022-04-28 05:38:46,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:38:46,062 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 16 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:38:46,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 143 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:38:46,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-28 05:38:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-28 05:38:46,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:38:46,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 05:38:46,259 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 05:38:46,259 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 05:38:46,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:46,262 INFO L93 Difference]: Finished difference Result 146 states and 198 transitions. [2022-04-28 05:38:46,262 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-28 05:38:46,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:46,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:46,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) Second operand 146 states. [2022-04-28 05:38:46,263 INFO L87 Difference]: Start difference. First operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) Second operand 146 states. [2022-04-28 05:38:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:46,266 INFO L93 Difference]: Finished difference Result 146 states and 198 transitions. [2022-04-28 05:38:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-28 05:38:46,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:46,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:46,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:38:46,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:38:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 05:38:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 198 transitions. [2022-04-28 05:38:46,269 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 198 transitions. Word has length 62 [2022-04-28 05:38:46,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:38:46,269 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 198 transitions. [2022-04-28 05:38:46,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:46,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 198 transitions. [2022-04-28 05:38:46,469 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 05:38:46,469 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-28 05:38:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 05:38:46,470 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:38:46,470 INFO L195 NwaCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1] [2022-04-28 05:38:46,486 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 05:38:46,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 05:38:46,683 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:38:46,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:38:46,684 INFO L85 PathProgramCache]: Analyzing trace with hash -385934262, now seen corresponding path program 1 times [2022-04-28 05:38:46,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:46,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1381749351] [2022-04-28 05:38:46,684 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:38:46,684 INFO L85 PathProgramCache]: Analyzing trace with hash -385934262, now seen corresponding path program 2 times [2022-04-28 05:38:46,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:38:46,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641139665] [2022-04-28 05:38:46,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:38:46,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:38:46,695 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:38:46,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [826691686] [2022-04-28 05:38:46,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:38:46,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:38:46,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:38:46,700 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:38:46,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 05:38:46,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:38:46,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:38:46,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:38:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:38:46,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:38:47,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-28 05:38:47,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {8519#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);~counter~0 := 0; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8527#(<= ~counter~0 0)} {8519#true} #98#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {8527#(<= ~counter~0 0)} call #t~ret8 := main(); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {8527#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,010 INFO L272 TraceCheckUtils]: 6: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,011 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #78#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,011 INFO L272 TraceCheckUtils]: 11: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,013 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #80#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {8527#(<= ~counter~0 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; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,014 INFO L272 TraceCheckUtils]: 17: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,015 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #82#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,016 INFO L272 TraceCheckUtils]: 22: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,017 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #84#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {8527#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8606#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:47,018 INFO L290 TraceCheckUtils]: 28: Hoare triple {8606#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {8606#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:47,018 INFO L290 TraceCheckUtils]: 29: Hoare triple {8606#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8606#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:47,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {8606#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {8616#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,019 INFO L272 TraceCheckUtils]: 32: Hoare triple {8616#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {8616#(<= ~counter~0 2)} ~cond := #in~cond; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,020 INFO L290 TraceCheckUtils]: 34: Hoare triple {8616#(<= ~counter~0 2)} assume !(0 == ~cond); {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,020 INFO L290 TraceCheckUtils]: 35: Hoare triple {8616#(<= ~counter~0 2)} assume true; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,021 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8616#(<= ~counter~0 2)} {8616#(<= ~counter~0 2)} #86#return; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,021 INFO L272 TraceCheckUtils]: 37: Hoare triple {8616#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,021 INFO L290 TraceCheckUtils]: 38: Hoare triple {8616#(<= ~counter~0 2)} ~cond := #in~cond; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,022 INFO L290 TraceCheckUtils]: 39: Hoare triple {8616#(<= ~counter~0 2)} assume !(0 == ~cond); {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,022 INFO L290 TraceCheckUtils]: 40: Hoare triple {8616#(<= ~counter~0 2)} assume true; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,023 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8616#(<= ~counter~0 2)} {8616#(<= ~counter~0 2)} #88#return; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,023 INFO L272 TraceCheckUtils]: 42: Hoare triple {8616#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,024 INFO L290 TraceCheckUtils]: 43: Hoare triple {8616#(<= ~counter~0 2)} ~cond := #in~cond; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,025 INFO L290 TraceCheckUtils]: 44: Hoare triple {8616#(<= ~counter~0 2)} assume !(0 == ~cond); {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,025 INFO L290 TraceCheckUtils]: 45: Hoare triple {8616#(<= ~counter~0 2)} assume true; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,025 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8616#(<= ~counter~0 2)} {8616#(<= ~counter~0 2)} #90#return; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,026 INFO L272 TraceCheckUtils]: 47: Hoare triple {8616#(<= ~counter~0 2)} 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)); {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,026 INFO L290 TraceCheckUtils]: 48: Hoare triple {8616#(<= ~counter~0 2)} ~cond := #in~cond; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {8616#(<= ~counter~0 2)} assume !(0 == ~cond); {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,027 INFO L290 TraceCheckUtils]: 50: Hoare triple {8616#(<= ~counter~0 2)} assume true; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,027 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8616#(<= ~counter~0 2)} {8616#(<= ~counter~0 2)} #92#return; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,028 INFO L290 TraceCheckUtils]: 52: Hoare triple {8616#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,028 INFO L290 TraceCheckUtils]: 53: Hoare triple {8616#(<= ~counter~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; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,028 INFO L290 TraceCheckUtils]: 54: Hoare triple {8616#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8689#(<= ~counter~0 3)} is VALID [2022-04-28 05:38:47,029 INFO L290 TraceCheckUtils]: 55: Hoare triple {8689#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {8689#(<= ~counter~0 3)} is VALID [2022-04-28 05:38:47,029 INFO L290 TraceCheckUtils]: 56: Hoare triple {8689#(<= ~counter~0 3)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8689#(<= ~counter~0 3)} is VALID [2022-04-28 05:38:47,030 INFO L290 TraceCheckUtils]: 57: Hoare triple {8689#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8699#(<= |main_#t~post7| 3)} is VALID [2022-04-28 05:38:47,030 INFO L290 TraceCheckUtils]: 58: Hoare triple {8699#(<= |main_#t~post7| 3)} assume !(#t~post7 < 10);havoc #t~post7; {8520#false} is VALID [2022-04-28 05:38:47,030 INFO L290 TraceCheckUtils]: 59: Hoare triple {8520#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; {8520#false} is VALID [2022-04-28 05:38:47,030 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8520#false} is VALID [2022-04-28 05:38:47,030 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume !(#t~post6 < 10);havoc #t~post6; {8520#false} is VALID [2022-04-28 05:38:47,030 INFO L272 TraceCheckUtils]: 62: Hoare triple {8520#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {8520#false} is VALID [2022-04-28 05:38:47,030 INFO L290 TraceCheckUtils]: 63: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-28 05:38:47,030 INFO L290 TraceCheckUtils]: 64: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-28 05:38:47,030 INFO L290 TraceCheckUtils]: 65: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-28 05:38:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:38:47,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:38:47,274 INFO L290 TraceCheckUtils]: 65: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-28 05:38:47,274 INFO L290 TraceCheckUtils]: 64: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-28 05:38:47,274 INFO L290 TraceCheckUtils]: 63: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-28 05:38:47,274 INFO L272 TraceCheckUtils]: 62: Hoare triple {8520#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {8520#false} is VALID [2022-04-28 05:38:47,274 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume !(#t~post6 < 10);havoc #t~post6; {8520#false} is VALID [2022-04-28 05:38:47,274 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8520#false} is VALID [2022-04-28 05:38:47,274 INFO L290 TraceCheckUtils]: 59: Hoare triple {8520#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; {8520#false} is VALID [2022-04-28 05:38:47,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {8745#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {8520#false} is VALID [2022-04-28 05:38:47,276 INFO L290 TraceCheckUtils]: 57: Hoare triple {8749#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8745#(< |main_#t~post7| 10)} is VALID [2022-04-28 05:38:47,276 INFO L290 TraceCheckUtils]: 56: Hoare triple {8749#(< ~counter~0 10)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8749#(< ~counter~0 10)} is VALID [2022-04-28 05:38:47,276 INFO L290 TraceCheckUtils]: 55: Hoare triple {8749#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {8749#(< ~counter~0 10)} is VALID [2022-04-28 05:38:47,277 INFO L290 TraceCheckUtils]: 54: Hoare triple {8759#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8749#(< ~counter~0 10)} is VALID [2022-04-28 05:38:47,278 INFO L290 TraceCheckUtils]: 53: Hoare triple {8759#(< ~counter~0 9)} ~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; {8759#(< ~counter~0 9)} is VALID [2022-04-28 05:38:47,278 INFO L290 TraceCheckUtils]: 52: Hoare triple {8759#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {8759#(< ~counter~0 9)} is VALID [2022-04-28 05:38:47,279 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8519#true} {8759#(< ~counter~0 9)} #92#return; {8759#(< ~counter~0 9)} is VALID [2022-04-28 05:38:47,279 INFO L290 TraceCheckUtils]: 50: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:38:47,279 INFO L290 TraceCheckUtils]: 49: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:38:47,279 INFO L290 TraceCheckUtils]: 48: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:38:47,279 INFO L272 TraceCheckUtils]: 47: Hoare triple {8759#(< ~counter~0 9)} 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)); {8519#true} is VALID [2022-04-28 05:38:47,280 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8519#true} {8759#(< ~counter~0 9)} #90#return; {8759#(< ~counter~0 9)} is VALID [2022-04-28 05:38:47,280 INFO L290 TraceCheckUtils]: 45: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:38:47,280 INFO L290 TraceCheckUtils]: 44: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:38:47,280 INFO L290 TraceCheckUtils]: 43: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:38:47,280 INFO L272 TraceCheckUtils]: 42: Hoare triple {8759#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:38:47,280 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8519#true} {8759#(< ~counter~0 9)} #88#return; {8759#(< ~counter~0 9)} is VALID [2022-04-28 05:38:47,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:38:47,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:38:47,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:38:47,281 INFO L272 TraceCheckUtils]: 37: Hoare triple {8759#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:38:47,281 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8519#true} {8759#(< ~counter~0 9)} #86#return; {8759#(< ~counter~0 9)} is VALID [2022-04-28 05:38:47,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:38:47,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:38:47,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:38:47,281 INFO L272 TraceCheckUtils]: 32: Hoare triple {8759#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:38:47,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {8759#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {8759#(< ~counter~0 9)} is VALID [2022-04-28 05:38:47,282 INFO L290 TraceCheckUtils]: 30: Hoare triple {8832#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8759#(< ~counter~0 9)} is VALID [2022-04-28 05:38:47,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {8832#(< ~counter~0 8)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8832#(< ~counter~0 8)} is VALID [2022-04-28 05:38:47,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {8832#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {8832#(< ~counter~0 8)} is VALID [2022-04-28 05:38:47,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {8842#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8832#(< ~counter~0 8)} is VALID [2022-04-28 05:38:47,283 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8519#true} {8842#(< ~counter~0 7)} #84#return; {8842#(< ~counter~0 7)} is VALID [2022-04-28 05:38:47,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:38:47,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:38:47,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:38:47,283 INFO L272 TraceCheckUtils]: 22: Hoare triple {8842#(< ~counter~0 7)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:38:47,284 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8519#true} {8842#(< ~counter~0 7)} #82#return; {8842#(< ~counter~0 7)} is VALID [2022-04-28 05:38:47,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:38:47,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:38:47,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:38:47,284 INFO L272 TraceCheckUtils]: 17: Hoare triple {8842#(< ~counter~0 7)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:38:47,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {8842#(< ~counter~0 7)} ~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; {8842#(< ~counter~0 7)} is VALID [2022-04-28 05:38:47,285 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8519#true} {8842#(< ~counter~0 7)} #80#return; {8842#(< ~counter~0 7)} is VALID [2022-04-28 05:38:47,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:38:47,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:38:47,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:38:47,285 INFO L272 TraceCheckUtils]: 11: Hoare triple {8842#(< ~counter~0 7)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:38:47,285 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8519#true} {8842#(< ~counter~0 7)} #78#return; {8842#(< ~counter~0 7)} is VALID [2022-04-28 05:38:47,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:38:47,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:38:47,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:38:47,285 INFO L272 TraceCheckUtils]: 6: Hoare triple {8842#(< ~counter~0 7)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:38:47,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {8842#(< ~counter~0 7)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8842#(< ~counter~0 7)} is VALID [2022-04-28 05:38:47,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {8842#(< ~counter~0 7)} call #t~ret8 := main(); {8842#(< ~counter~0 7)} is VALID [2022-04-28 05:38:47,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8842#(< ~counter~0 7)} {8519#true} #98#return; {8842#(< ~counter~0 7)} is VALID [2022-04-28 05:38:47,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {8842#(< ~counter~0 7)} assume true; {8842#(< ~counter~0 7)} is VALID [2022-04-28 05:38:47,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {8519#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);~counter~0 := 0; {8842#(< ~counter~0 7)} is VALID [2022-04-28 05:38:47,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-28 05:38:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:38:47,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:38:47,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641139665] [2022-04-28 05:38:47,287 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:38:47,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826691686] [2022-04-28 05:38:47,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826691686] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:38:47,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:38:47,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 05:38:47,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:38:47,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1381749351] [2022-04-28 05:38:47,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1381749351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:38:47,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:38:47,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:38:47,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268677867] [2022-04-28 05:38:47,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:38:47,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-04-28 05:38:47,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:38:47,289 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), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:47,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:47,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:38:47,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:47,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:38:47,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:38:47,320 INFO L87 Difference]: Start difference. First operand 146 states and 198 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:47,742 INFO L93 Difference]: Finished difference Result 253 states and 351 transitions. [2022-04-28 05:38:47,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:38:47,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-04-28 05:38:47,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:38:47,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-28 05:38:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-28 05:38:47,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 114 transitions. [2022-04-28 05:38:47,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:47,818 INFO L225 Difference]: With dead ends: 253 [2022-04-28 05:38:47,818 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 05:38:47,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:38:47,821 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 29 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:38:47,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 155 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:38:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 05:38:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-04-28 05:38:48,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:38:48,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:38:48,046 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:38:48,046 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:38:48,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:48,049 INFO L93 Difference]: Finished difference Result 173 states and 225 transitions. [2022-04-28 05:38:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2022-04-28 05:38:48,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:48,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:48,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand 173 states. [2022-04-28 05:38:48,050 INFO L87 Difference]: Start difference. First operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand 173 states. [2022-04-28 05:38:48,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:48,053 INFO L93 Difference]: Finished difference Result 173 states and 225 transitions. [2022-04-28 05:38:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2022-04-28 05:38:48,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:48,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:48,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:38:48,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:38:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:38:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2022-04-28 05:38:48,057 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 66 [2022-04-28 05:38:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:38:48,057 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2022-04-28 05:38:48,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:48,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 223 transitions. [2022-04-28 05:38:48,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2022-04-28 05:38:48,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 05:38:48,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:38:48,301 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 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] [2022-04-28 05:38:48,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 05:38:48,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 05:38:48,502 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:38:48,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:38:48,502 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 1 times [2022-04-28 05:38:48,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:48,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1426165028] [2022-04-28 05:38:48,503 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:38:48,503 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 2 times [2022-04-28 05:38:48,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:38:48,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30586448] [2022-04-28 05:38:48,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:38:48,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:38:48,513 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:38:48,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [969734793] [2022-04-28 05:38:48,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:38:48,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:38:48,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:38:48,515 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:38:48,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 05:38:48,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:38:48,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:38:48,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 05:38:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:38:48,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:38:48,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {10124#true} call ULTIMATE.init(); {10124#true} is VALID [2022-04-28 05:38:48,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {10124#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);~counter~0 := 0; {10124#true} is VALID [2022-04-28 05:38:48,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:38:48,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10124#true} {10124#true} #98#return; {10124#true} is VALID [2022-04-28 05:38:48,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {10124#true} call #t~ret8 := main(); {10124#true} is VALID [2022-04-28 05:38:48,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {10124#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10124#true} is VALID [2022-04-28 05:38:48,873 INFO L272 TraceCheckUtils]: 6: Hoare triple {10124#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10124#true} is VALID [2022-04-28 05:38:48,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 05:38:48,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 05:38:48,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:38:48,874 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10124#true} {10124#true} #78#return; {10124#true} is VALID [2022-04-28 05:38:48,874 INFO L272 TraceCheckUtils]: 11: Hoare triple {10124#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10124#true} is VALID [2022-04-28 05:38:48,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 05:38:48,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 05:38:48,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:38:48,874 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10124#true} {10124#true} #80#return; {10124#true} is VALID [2022-04-28 05:38:48,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {10124#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; {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:38:48,874 INFO L272 TraceCheckUtils]: 17: Hoare triple {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {10124#true} is VALID [2022-04-28 05:38:48,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 05:38:48,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 05:38:48,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:38:48,875 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10124#true} {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #82#return; {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:38:48,875 INFO L272 TraceCheckUtils]: 22: Hoare triple {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {10124#true} is VALID [2022-04-28 05:38:48,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 05:38:48,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 05:38:48,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:38:48,876 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10124#true} {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #84#return; {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:38:48,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:38:48,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 10);havoc #t~post6; {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:38:48,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:38:48,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:38:48,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !!(#t~post7 < 10);havoc #t~post7; {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:38:48,877 INFO L272 TraceCheckUtils]: 32: Hoare triple {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10124#true} is VALID [2022-04-28 05:38:48,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 05:38:48,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 05:38:48,877 INFO L290 TraceCheckUtils]: 35: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:38:48,878 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10124#true} {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} #86#return; {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:38:48,878 INFO L272 TraceCheckUtils]: 37: Hoare triple {10217#(and (= main_~q~0 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)); {10124#true} is VALID [2022-04-28 05:38:48,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 05:38:48,878 INFO L290 TraceCheckUtils]: 39: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 05:38:48,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:38:48,879 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10124#true} {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} #88#return; {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:38:48,879 INFO L272 TraceCheckUtils]: 42: Hoare triple {10217#(and (= main_~q~0 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)); {10124#true} is VALID [2022-04-28 05:38:48,879 INFO L290 TraceCheckUtils]: 43: Hoare triple {10124#true} ~cond := #in~cond; {10260#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:38:48,879 INFO L290 TraceCheckUtils]: 44: Hoare triple {10260#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10264#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:38:48,879 INFO L290 TraceCheckUtils]: 45: Hoare triple {10264#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10264#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:38:48,880 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10264#(not (= |__VERIFIER_assert_#in~cond| 0))} {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} #90#return; {10271#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:38:48,880 INFO L272 TraceCheckUtils]: 47: Hoare triple {10271#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 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)); {10124#true} is VALID [2022-04-28 05:38:48,880 INFO L290 TraceCheckUtils]: 48: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 05:38:48,880 INFO L290 TraceCheckUtils]: 49: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 05:38:48,880 INFO L290 TraceCheckUtils]: 50: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:38:48,881 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10124#true} {10271#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #92#return; {10271#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:38:48,881 INFO L290 TraceCheckUtils]: 52: Hoare triple {10271#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {10271#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:38:48,882 INFO L290 TraceCheckUtils]: 53: Hoare triple {10271#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 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; {10293#(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 05:38:48,882 INFO L290 TraceCheckUtils]: 54: Hoare triple {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10293#(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 05:38:48,882 INFO L290 TraceCheckUtils]: 55: Hoare triple {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(#t~post6 < 10);havoc #t~post6; {10293#(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 05:38:48,883 INFO L290 TraceCheckUtils]: 56: Hoare triple {10293#(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; {10293#(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 05:38:48,883 INFO L290 TraceCheckUtils]: 57: Hoare triple {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10293#(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 05:38:48,883 INFO L290 TraceCheckUtils]: 58: Hoare triple {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(#t~post7 < 10);havoc #t~post7; {10293#(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 05:38:48,883 INFO L272 TraceCheckUtils]: 59: Hoare triple {10293#(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)); {10124#true} is VALID [2022-04-28 05:38:48,883 INFO L290 TraceCheckUtils]: 60: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 05:38:48,883 INFO L290 TraceCheckUtils]: 61: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 05:38:48,884 INFO L290 TraceCheckUtils]: 62: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:38:48,884 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10124#true} {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #86#return; {10293#(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 05:38:48,885 INFO L272 TraceCheckUtils]: 64: Hoare triple {10293#(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)); {10327#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:38:48,885 INFO L290 TraceCheckUtils]: 65: Hoare triple {10327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:38:48,885 INFO L290 TraceCheckUtils]: 66: Hoare triple {10331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10125#false} is VALID [2022-04-28 05:38:48,885 INFO L290 TraceCheckUtils]: 67: Hoare triple {10125#false} assume !false; {10125#false} is VALID [2022-04-28 05:38:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 05:38:48,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:39:07,013 INFO L290 TraceCheckUtils]: 67: Hoare triple {10125#false} assume !false; {10125#false} is VALID [2022-04-28 05:39:07,013 INFO L290 TraceCheckUtils]: 66: Hoare triple {10331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10125#false} is VALID [2022-04-28 05:39:07,014 INFO L290 TraceCheckUtils]: 65: Hoare triple {10327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:39:07,014 INFO L272 TraceCheckUtils]: 64: Hoare triple {10347#(= 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)); {10327#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:39:07,015 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10124#true} {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:39:07,015 INFO L290 TraceCheckUtils]: 62: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:39:07,015 INFO L290 TraceCheckUtils]: 61: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 05:39:07,015 INFO L290 TraceCheckUtils]: 60: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 05:39:07,015 INFO L272 TraceCheckUtils]: 59: Hoare triple {10347#(= 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)); {10124#true} is VALID [2022-04-28 05:39:07,015 INFO L290 TraceCheckUtils]: 58: Hoare triple {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:39:07,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:39:07,016 INFO L290 TraceCheckUtils]: 56: Hoare triple {10347#(= 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; {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:39:07,016 INFO L290 TraceCheckUtils]: 55: Hoare triple {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:39:07,016 INFO L290 TraceCheckUtils]: 54: Hoare triple {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:39:07,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {10381#(= 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; {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:39:07,017 INFO L290 TraceCheckUtils]: 52: Hoare triple {10381#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {10381#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:07,018 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10124#true} {10381#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {10381#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:07,018 INFO L290 TraceCheckUtils]: 50: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:39:07,018 INFO L290 TraceCheckUtils]: 49: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 05:39:07,018 INFO L290 TraceCheckUtils]: 48: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 05:39:07,018 INFO L272 TraceCheckUtils]: 47: Hoare triple {10381#(= 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)); {10124#true} is VALID [2022-04-28 05:39:07,018 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10264#(not (= |__VERIFIER_assert_#in~cond| 0))} {10124#true} #90#return; {10381#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:07,019 INFO L290 TraceCheckUtils]: 45: Hoare triple {10264#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10264#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:39:07,019 INFO L290 TraceCheckUtils]: 44: Hoare triple {10412#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10264#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:39:07,019 INFO L290 TraceCheckUtils]: 43: Hoare triple {10124#true} ~cond := #in~cond; {10412#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:39:07,019 INFO L272 TraceCheckUtils]: 42: Hoare triple {10124#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10124#true} is VALID [2022-04-28 05:39:07,019 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10124#true} {10124#true} #88#return; {10124#true} is VALID [2022-04-28 05:39:07,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:39:07,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L290 TraceCheckUtils]: 38: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L272 TraceCheckUtils]: 37: Hoare triple {10124#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10124#true} {10124#true} #86#return; {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L290 TraceCheckUtils]: 35: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L290 TraceCheckUtils]: 34: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L290 TraceCheckUtils]: 33: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L272 TraceCheckUtils]: 32: Hoare triple {10124#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L290 TraceCheckUtils]: 31: Hoare triple {10124#true} assume !!(#t~post7 < 10);havoc #t~post7; {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {10124#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {10124#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {10124#true} assume !!(#t~post6 < 10);havoc #t~post6; {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L290 TraceCheckUtils]: 27: Hoare triple {10124#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10124#true} {10124#true} #84#return; {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L272 TraceCheckUtils]: 22: Hoare triple {10124#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {10124#true} is VALID [2022-04-28 05:39:07,020 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10124#true} {10124#true} #82#return; {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L272 TraceCheckUtils]: 17: Hoare triple {10124#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {10124#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; {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10124#true} {10124#true} #80#return; {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L272 TraceCheckUtils]: 11: Hoare triple {10124#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10124#true} {10124#true} #78#return; {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L272 TraceCheckUtils]: 6: Hoare triple {10124#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {10124#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {10124#true} call #t~ret8 := main(); {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10124#true} {10124#true} #98#return; {10124#true} is VALID [2022-04-28 05:39:07,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 05:39:07,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {10124#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);~counter~0 := 0; {10124#true} is VALID [2022-04-28 05:39:07,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {10124#true} call ULTIMATE.init(); {10124#true} is VALID [2022-04-28 05:39:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 05:39:07,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:39:07,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30586448] [2022-04-28 05:39:07,022 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:39:07,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969734793] [2022-04-28 05:39:07,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969734793] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:39:07,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:39:07,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-28 05:39:07,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:39:07,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1426165028] [2022-04-28 05:39:07,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1426165028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:39:07,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:39:07,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:39:07,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951854789] [2022-04-28 05:39:07,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:39:07,023 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 68 [2022-04-28 05:39:07,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:39:07,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 05:39:07,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:39:07,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:39:07,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:39:07,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:39:07,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:39:07,058 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 05:39:08,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:39:08,234 INFO L93 Difference]: Finished difference Result 195 states and 259 transitions. [2022-04-28 05:39:08,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 05:39:08,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 68 [2022-04-28 05:39:08,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:39:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 05:39:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-28 05:39:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 05:39:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-28 05:39:08,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2022-04-28 05:39:08,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:39:08,335 INFO L225 Difference]: With dead ends: 195 [2022-04-28 05:39:08,335 INFO L226 Difference]: Without dead ends: 193 [2022-04-28 05:39:08,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-04-28 05:39:08,335 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 22 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 05:39:08,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 295 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 05:39:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-28 05:39:08,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2022-04-28 05:39:08,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:39:08,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:39:08,589 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:39:08,589 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:39:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:39:08,593 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2022-04-28 05:39:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2022-04-28 05:39:08,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:39:08,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:39:08,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 193 states. [2022-04-28 05:39:08,594 INFO L87 Difference]: Start difference. First operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 193 states. [2022-04-28 05:39:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:39:08,597 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2022-04-28 05:39:08,597 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2022-04-28 05:39:08,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:39:08,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:39:08,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:39:08,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:39:08,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:39:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 254 transitions. [2022-04-28 05:39:08,602 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 254 transitions. Word has length 68 [2022-04-28 05:39:08,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:39:08,602 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 254 transitions. [2022-04-28 05:39:08,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 05:39:08,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 254 transitions. [2022-04-28 05:39:08,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:39:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 254 transitions. [2022-04-28 05:39:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 05:39:08,877 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:39:08,877 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 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] [2022-04-28 05:39:08,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 05:39:09,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 05:39:09,091 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:39:09,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:39:09,092 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 3 times [2022-04-28 05:39:09,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:39:09,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [601775621] [2022-04-28 05:39:09,092 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:39:09,092 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 4 times [2022-04-28 05:39:09,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:39:09,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317151633] [2022-04-28 05:39:09,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:39:09,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:39:09,108 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:39:09,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1882485858] [2022-04-28 05:39:09,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:39:09,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:39:09,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:39:09,109 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:39:09,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 05:39:09,162 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:39:09,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:39:09,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 05:39:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:39:09,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:39:11,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {11708#true} call ULTIMATE.init(); {11708#true} is VALID [2022-04-28 05:39:11,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {11708#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);~counter~0 := 0; {11708#true} is VALID [2022-04-28 05:39:11,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:11,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11708#true} {11708#true} #98#return; {11708#true} is VALID [2022-04-28 05:39:11,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {11708#true} call #t~ret8 := main(); {11708#true} is VALID [2022-04-28 05:39:11,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {11708#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11708#true} is VALID [2022-04-28 05:39:11,773 INFO L272 TraceCheckUtils]: 6: Hoare triple {11708#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11708#true} is VALID [2022-04-28 05:39:11,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:11,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:11,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:11,773 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11708#true} {11708#true} #78#return; {11708#true} is VALID [2022-04-28 05:39:11,773 INFO L272 TraceCheckUtils]: 11: Hoare triple {11708#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11708#true} is VALID [2022-04-28 05:39:11,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:11,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:11,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:11,773 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11708#true} {11708#true} #80#return; {11708#true} is VALID [2022-04-28 05:39:11,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {11708#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; {11761#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:11,774 INFO L272 TraceCheckUtils]: 17: Hoare triple {11761#(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)); {11708#true} is VALID [2022-04-28 05:39:11,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:11,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:11,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:11,775 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11708#true} {11761#(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))} #82#return; {11761#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:11,775 INFO L272 TraceCheckUtils]: 22: Hoare triple {11761#(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)); {11708#true} is VALID [2022-04-28 05:39:11,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:11,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:11,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:11,776 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11708#true} {11761#(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))} #84#return; {11761#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:11,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {11761#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11761#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:11,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {11761#(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 !!(#t~post6 < 10);havoc #t~post6; {11761#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:11,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {11761#(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; {11801#(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 05:39:11,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {11801#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11801#(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 05:39:11,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {11801#(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 !!(#t~post7 < 10);havoc #t~post7; {11801#(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 05:39:11,777 INFO L272 TraceCheckUtils]: 32: Hoare triple {11801#(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)); {11708#true} is VALID [2022-04-28 05:39:11,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:11,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:11,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:11,778 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11708#true} {11801#(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))} #86#return; {11801#(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 05:39:11,778 INFO L272 TraceCheckUtils]: 37: Hoare triple {11801#(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)); {11708#true} is VALID [2022-04-28 05:39:11,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:11,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:11,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:11,779 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11708#true} {11801#(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))} #88#return; {11801#(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 05:39:11,779 INFO L272 TraceCheckUtils]: 42: Hoare triple {11801#(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)); {11708#true} is VALID [2022-04-28 05:39:11,779 INFO L290 TraceCheckUtils]: 43: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:11,779 INFO L290 TraceCheckUtils]: 44: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:11,779 INFO L290 TraceCheckUtils]: 45: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:11,780 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11708#true} {11801#(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))} #90#return; {11801#(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 05:39:11,780 INFO L272 TraceCheckUtils]: 47: Hoare triple {11801#(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)); {11708#true} is VALID [2022-04-28 05:39:11,780 INFO L290 TraceCheckUtils]: 48: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:11,780 INFO L290 TraceCheckUtils]: 49: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:11,780 INFO L290 TraceCheckUtils]: 50: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:11,781 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11708#true} {11801#(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))} #92#return; {11801#(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 05:39:11,781 INFO L290 TraceCheckUtils]: 52: Hoare triple {11801#(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); {11801#(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 05:39:11,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {11801#(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))} ~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; {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:39:11,782 INFO L290 TraceCheckUtils]: 54: Hoare triple {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:39:11,782 INFO L290 TraceCheckUtils]: 55: Hoare triple {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:39:11,782 INFO L290 TraceCheckUtils]: 56: Hoare triple {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:39:11,783 INFO L290 TraceCheckUtils]: 57: Hoare triple {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:39:11,783 INFO L290 TraceCheckUtils]: 58: Hoare triple {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:39:11,783 INFO L272 TraceCheckUtils]: 59: Hoare triple {11874#(and (= main_~s~0 0) (= 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)); {11708#true} is VALID [2022-04-28 05:39:11,783 INFO L290 TraceCheckUtils]: 60: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:11,783 INFO L290 TraceCheckUtils]: 61: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:11,783 INFO L290 TraceCheckUtils]: 62: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:11,784 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11708#true} {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #86#return; {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:39:11,784 INFO L272 TraceCheckUtils]: 64: Hoare triple {11874#(and (= main_~s~0 0) (= 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)); {11708#true} is VALID [2022-04-28 05:39:11,784 INFO L290 TraceCheckUtils]: 65: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:11,784 INFO L290 TraceCheckUtils]: 66: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:11,784 INFO L290 TraceCheckUtils]: 67: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:11,785 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11708#true} {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #88#return; {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:39:11,785 INFO L272 TraceCheckUtils]: 69: Hoare triple {11874#(and (= main_~s~0 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)); {11923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:39:11,785 INFO L290 TraceCheckUtils]: 70: Hoare triple {11923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:39:11,786 INFO L290 TraceCheckUtils]: 71: Hoare triple {11927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11709#false} is VALID [2022-04-28 05:39:11,786 INFO L290 TraceCheckUtils]: 72: Hoare triple {11709#false} assume !false; {11709#false} is VALID [2022-04-28 05:39:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 05:39:11,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:39:12,043 INFO L290 TraceCheckUtils]: 72: Hoare triple {11709#false} assume !false; {11709#false} is VALID [2022-04-28 05:39:12,043 INFO L290 TraceCheckUtils]: 71: Hoare triple {11927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11709#false} is VALID [2022-04-28 05:39:12,044 INFO L290 TraceCheckUtils]: 70: Hoare triple {11923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:39:12,044 INFO L272 TraceCheckUtils]: 69: Hoare triple {11943#(= 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)); {11923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:39:12,045 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11708#true} {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:12,045 INFO L290 TraceCheckUtils]: 67: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:12,045 INFO L290 TraceCheckUtils]: 66: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:12,045 INFO L290 TraceCheckUtils]: 65: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:12,045 INFO L272 TraceCheckUtils]: 64: Hoare triple {11943#(= 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)); {11708#true} is VALID [2022-04-28 05:39:12,046 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11708#true} {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:12,046 INFO L290 TraceCheckUtils]: 62: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:12,046 INFO L290 TraceCheckUtils]: 61: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:12,046 INFO L290 TraceCheckUtils]: 60: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:12,046 INFO L272 TraceCheckUtils]: 59: Hoare triple {11943#(= 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)); {11708#true} is VALID [2022-04-28 05:39:12,046 INFO L290 TraceCheckUtils]: 58: Hoare triple {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:12,047 INFO L290 TraceCheckUtils]: 57: Hoare triple {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:12,047 INFO L290 TraceCheckUtils]: 56: Hoare triple {11943#(= 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; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:12,047 INFO L290 TraceCheckUtils]: 55: Hoare triple {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:12,047 INFO L290 TraceCheckUtils]: 54: Hoare triple {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:14,049 WARN L290 TraceCheckUtils]: 53: Hoare triple {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~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; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-28 05:39:14,050 INFO L290 TraceCheckUtils]: 52: Hoare triple {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:39:14,050 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11708#true} {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} #92#return; {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:39:14,050 INFO L290 TraceCheckUtils]: 50: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:14,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:14,050 INFO L290 TraceCheckUtils]: 48: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:14,051 INFO L272 TraceCheckUtils]: 47: Hoare triple {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~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)); {11708#true} is VALID [2022-04-28 05:39:14,051 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11708#true} {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} #90#return; {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:39:14,051 INFO L290 TraceCheckUtils]: 45: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:14,051 INFO L290 TraceCheckUtils]: 44: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:14,051 INFO L290 TraceCheckUtils]: 43: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:14,051 INFO L272 TraceCheckUtils]: 42: Hoare triple {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11708#true} is VALID [2022-04-28 05:39:14,052 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11708#true} {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} #88#return; {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:39:14,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:14,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:14,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:14,052 INFO L272 TraceCheckUtils]: 37: Hoare triple {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11708#true} is VALID [2022-04-28 05:39:14,053 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11708#true} {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} #86#return; {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:39:14,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:14,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:14,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:14,053 INFO L272 TraceCheckUtils]: 32: Hoare triple {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11708#true} is VALID [2022-04-28 05:39:14,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:39:14,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:39:14,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:39:14,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} assume !!(#t~post6 < 10);havoc #t~post6; {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-28 05:39:14,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-28 05:39:14,069 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11708#true} {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} #84#return; {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-28 05:39:14,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:14,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:14,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:14,070 INFO L272 TraceCheckUtils]: 22: Hoare triple {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {11708#true} is VALID [2022-04-28 05:39:14,070 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11708#true} {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} #82#return; {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-28 05:39:14,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:14,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:14,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:14,070 INFO L272 TraceCheckUtils]: 17: Hoare triple {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {11708#true} is VALID [2022-04-28 05:39:14,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {11708#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; {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-28 05:39:14,071 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11708#true} {11708#true} #80#return; {11708#true} is VALID [2022-04-28 05:39:14,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:14,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:14,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:14,071 INFO L272 TraceCheckUtils]: 11: Hoare triple {11708#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11708#true} is VALID [2022-04-28 05:39:14,071 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11708#true} {11708#true} #78#return; {11708#true} is VALID [2022-04-28 05:39:14,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:14,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 05:39:14,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 05:39:14,071 INFO L272 TraceCheckUtils]: 6: Hoare triple {11708#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11708#true} is VALID [2022-04-28 05:39:14,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {11708#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11708#true} is VALID [2022-04-28 05:39:14,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {11708#true} call #t~ret8 := main(); {11708#true} is VALID [2022-04-28 05:39:14,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11708#true} {11708#true} #98#return; {11708#true} is VALID [2022-04-28 05:39:14,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 05:39:14,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {11708#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);~counter~0 := 0; {11708#true} is VALID [2022-04-28 05:39:14,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {11708#true} call ULTIMATE.init(); {11708#true} is VALID [2022-04-28 05:39:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 05:39:14,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:39:14,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317151633] [2022-04-28 05:39:14,072 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:39:14,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882485858] [2022-04-28 05:39:14,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882485858] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:39:14,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:39:14,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 05:39:14,073 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:39:14,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [601775621] [2022-04-28 05:39:14,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [601775621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:39:14,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:39:14,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:39:14,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569641361] [2022-04-28 05:39:14,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:39:14,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 73 [2022-04-28 05:39:14,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:39:14,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:39:14,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:39:14,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:39:14,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:39:14,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:39:14,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:39:14,112 INFO L87 Difference]: Start difference. First operand 190 states and 254 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:39:14,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:39:14,818 INFO L93 Difference]: Finished difference Result 199 states and 262 transitions. [2022-04-28 05:39:14,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:39:14,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 73 [2022-04-28 05:39:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:39:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:39:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-28 05:39:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:39:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-28 05:39:14,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 97 transitions. [2022-04-28 05:39:14,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:39:14,916 INFO L225 Difference]: With dead ends: 199 [2022-04-28 05:39:14,916 INFO L226 Difference]: Without dead ends: 197 [2022-04-28 05:39:14,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:39:14,917 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 17 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:39:14,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 234 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:39:14,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-28 05:39:15,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2022-04-28 05:39:15,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:39:15,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:39:15,190 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:39:15,190 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:39:15,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:39:15,194 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2022-04-28 05:39:15,194 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2022-04-28 05:39:15,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:39:15,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:39:15,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 197 states. [2022-04-28 05:39:15,195 INFO L87 Difference]: Start difference. First operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 197 states. [2022-04-28 05:39:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:39:15,198 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2022-04-28 05:39:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2022-04-28 05:39:15,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:39:15,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:39:15,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:39:15,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:39:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:39:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 257 transitions. [2022-04-28 05:39:15,202 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 257 transitions. Word has length 73 [2022-04-28 05:39:15,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:39:15,203 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 257 transitions. [2022-04-28 05:39:15,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:39:15,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 257 transitions. [2022-04-28 05:39:15,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:39:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 257 transitions. [2022-04-28 05:39:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-28 05:39:15,493 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:39:15,493 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 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] [2022-04-28 05:39:15,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 05:39:15,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:39:15,694 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:39:15,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:39:15,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 5 times [2022-04-28 05:39:15,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:39:15,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1031785126] [2022-04-28 05:39:15,695 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:39:15,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 6 times [2022-04-28 05:39:15,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:39:15,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658101329] [2022-04-28 05:39:15,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:39:15,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:39:15,704 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:39:15,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647479446] [2022-04-28 05:39:15,705 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:39:15,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:39:15,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:39:15,708 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:39:15,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 05:39:15,759 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:39:15,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:39:15,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 05:39:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:39:15,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:39:21,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {13339#true} call ULTIMATE.init(); {13339#true} is VALID [2022-04-28 05:39:21,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {13339#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);~counter~0 := 0; {13339#true} is VALID [2022-04-28 05:39:21,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 05:39:21,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13339#true} {13339#true} #98#return; {13339#true} is VALID [2022-04-28 05:39:21,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {13339#true} call #t~ret8 := main(); {13339#true} is VALID [2022-04-28 05:39:21,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {13339#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13339#true} is VALID [2022-04-28 05:39:21,805 INFO L272 TraceCheckUtils]: 6: Hoare triple {13339#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13339#true} is VALID [2022-04-28 05:39:21,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {13339#true} ~cond := #in~cond; {13365#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:39:21,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {13365#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {13369#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:39:21,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {13369#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {13369#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:39:21,806 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13369#(not (= |assume_abort_if_not_#in~cond| 0))} {13339#true} #78#return; {13376#(<= 1 main_~x~0)} is VALID [2022-04-28 05:39:21,806 INFO L272 TraceCheckUtils]: 11: Hoare triple {13376#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13339#true} is VALID [2022-04-28 05:39:21,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 05:39:21,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 05:39:21,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 05:39:21,807 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13339#true} {13376#(<= 1 main_~x~0)} #80#return; {13376#(<= 1 main_~x~0)} is VALID [2022-04-28 05:39:21,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {13376#(<= 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; {13395#(and (= main_~r~0 0) (<= 1 main_~x~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) (= main_~p~0 1))} is VALID [2022-04-28 05:39:21,807 INFO L272 TraceCheckUtils]: 17: Hoare triple {13395#(and (= main_~r~0 0) (<= 1 main_~x~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) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {13339#true} is VALID [2022-04-28 05:39:21,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 05:39:21,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 05:39:21,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 05:39:21,808 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13339#true} {13395#(and (= main_~r~0 0) (<= 1 main_~x~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) (= main_~p~0 1))} #82#return; {13395#(and (= main_~r~0 0) (<= 1 main_~x~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) (= main_~p~0 1))} is VALID [2022-04-28 05:39:21,808 INFO L272 TraceCheckUtils]: 22: Hoare triple {13395#(and (= main_~r~0 0) (<= 1 main_~x~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) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {13339#true} is VALID [2022-04-28 05:39:21,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 05:39:21,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 05:39:21,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 05:39:21,809 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13339#true} {13395#(and (= main_~r~0 0) (<= 1 main_~x~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) (= main_~p~0 1))} #84#return; {13395#(and (= main_~r~0 0) (<= 1 main_~x~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) (= main_~p~0 1))} is VALID [2022-04-28 05:39:21,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {13395#(and (= main_~r~0 0) (<= 1 main_~x~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) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13395#(and (= main_~r~0 0) (<= 1 main_~x~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) (= main_~p~0 1))} is VALID [2022-04-28 05:39:21,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {13395#(and (= main_~r~0 0) (<= 1 main_~x~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) (= main_~p~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {13395#(and (= main_~r~0 0) (<= 1 main_~x~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) (= main_~p~0 1))} is VALID [2022-04-28 05:39:21,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {13395#(and (= main_~r~0 0) (<= 1 main_~x~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) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 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 05:39:21,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 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 05:39:21,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 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 !!(#t~post7 < 10);havoc #t~post7; {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 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 05:39:21,811 INFO L272 TraceCheckUtils]: 32: Hoare triple {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 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 ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13339#true} is VALID [2022-04-28 05:39:21,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 05:39:21,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 05:39:21,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 05:39:21,812 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13339#true} {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 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 05:39:21,812 INFO L272 TraceCheckUtils]: 37: Hoare triple {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 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 ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13339#true} is VALID [2022-04-28 05:39:21,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 05:39:21,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 05:39:21,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 05:39:21,813 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13339#true} {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 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 05:39:21,813 INFO L272 TraceCheckUtils]: 42: Hoare triple {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 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)); {13339#true} is VALID [2022-04-28 05:39:21,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 05:39:21,813 INFO L290 TraceCheckUtils]: 44: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 05:39:21,813 INFO L290 TraceCheckUtils]: 45: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 05:39:21,814 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13339#true} {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 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 05:39:21,814 INFO L272 TraceCheckUtils]: 47: Hoare triple {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 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)); {13339#true} is VALID [2022-04-28 05:39:21,814 INFO L290 TraceCheckUtils]: 48: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 05:39:21,814 INFO L290 TraceCheckUtils]: 49: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 05:39:21,814 INFO L290 TraceCheckUtils]: 50: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 05:39:21,815 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {13339#true} {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 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 05:39:21,815 INFO L290 TraceCheckUtils]: 52: Hoare triple {13435#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 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); {13505#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~0) (= main_~k~0 0) (= main_~s~0 1) (= 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 05:39:21,816 INFO L290 TraceCheckUtils]: 53: Hoare triple {13505#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~0) (= main_~k~0 0) (= main_~s~0 1) (= 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; {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:21,816 INFO L290 TraceCheckUtils]: 54: Hoare triple {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:21,817 INFO L290 TraceCheckUtils]: 55: Hoare triple {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:21,817 INFO L290 TraceCheckUtils]: 56: Hoare triple {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~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; {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:21,817 INFO L290 TraceCheckUtils]: 57: Hoare triple {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:21,818 INFO L290 TraceCheckUtils]: 58: Hoare triple {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:21,818 INFO L272 TraceCheckUtils]: 59: Hoare triple {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~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)); {13339#true} is VALID [2022-04-28 05:39:21,818 INFO L290 TraceCheckUtils]: 60: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 05:39:21,818 INFO L290 TraceCheckUtils]: 61: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 05:39:21,818 INFO L290 TraceCheckUtils]: 62: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 05:39:21,819 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13339#true} {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:21,819 INFO L272 TraceCheckUtils]: 64: Hoare triple {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~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)); {13339#true} is VALID [2022-04-28 05:39:21,819 INFO L290 TraceCheckUtils]: 65: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 05:39:21,819 INFO L290 TraceCheckUtils]: 66: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 05:39:21,819 INFO L290 TraceCheckUtils]: 67: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 05:39:21,820 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13339#true} {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:21,820 INFO L272 TraceCheckUtils]: 69: Hoare triple {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~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)); {13339#true} is VALID [2022-04-28 05:39:21,820 INFO L290 TraceCheckUtils]: 70: Hoare triple {13339#true} ~cond := #in~cond; {13561#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:39:21,820 INFO L290 TraceCheckUtils]: 71: Hoare triple {13561#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13565#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:39:21,821 INFO L290 TraceCheckUtils]: 72: Hoare triple {13565#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13565#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:39:21,821 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13565#(not (= |__VERIFIER_assert_#in~cond| 0))} {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:21,822 INFO L272 TraceCheckUtils]: 74: Hoare triple {13509#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~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)); {13575#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:39:21,823 INFO L290 TraceCheckUtils]: 75: Hoare triple {13575#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13579#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:39:21,823 INFO L290 TraceCheckUtils]: 76: Hoare triple {13579#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13340#false} is VALID [2022-04-28 05:39:21,823 INFO L290 TraceCheckUtils]: 77: Hoare triple {13340#false} assume !false; {13340#false} is VALID [2022-04-28 05:39:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 19 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-28 05:39:21,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:40:00,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:40:00,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658101329] [2022-04-28 05:40:00,113 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:40:00,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647479446] [2022-04-28 05:40:00,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647479446] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 05:40:00,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:40:00,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 05:40:00,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:40:00,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1031785126] [2022-04-28 05:40:00,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1031785126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:40:00,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:40:00,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:40:00,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366405044] [2022-04-28 05:40:00,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:40:00,114 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 78 [2022-04-28 05:40:00,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:40:00,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:40:00,159 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 05:40:00,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:40:00,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:00,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:40:00,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-04-28 05:40:00,160 INFO L87 Difference]: Start difference. First operand 194 states and 257 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:40:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:05,627 INFO L93 Difference]: Finished difference Result 203 states and 265 transitions. [2022-04-28 05:40:05,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:40:05,628 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 78 [2022-04-28 05:40:05,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:40:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:40:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-28 05:40:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:40:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-28 05:40:05,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 97 transitions. [2022-04-28 05:40:05,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:05,730 INFO L225 Difference]: With dead ends: 203 [2022-04-28 05:40:05,730 INFO L226 Difference]: Without dead ends: 201 [2022-04-28 05:40:05,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-04-28 05:40:05,731 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 55 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:40:05,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 240 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 05:40:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-28 05:40:05,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2022-04-28 05:40:05,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:40:05,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:40:05,999 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:40:06,000 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:40:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:06,003 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2022-04-28 05:40:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2022-04-28 05:40:06,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:06,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:06,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 201 states. [2022-04-28 05:40:06,004 INFO L87 Difference]: Start difference. First operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 201 states. [2022-04-28 05:40:06,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:06,008 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2022-04-28 05:40:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2022-04-28 05:40:06,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:06,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:06,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:40:06,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:40:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:40:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 260 transitions. [2022-04-28 05:40:06,012 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 260 transitions. Word has length 78 [2022-04-28 05:40:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:40:06,012 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 260 transitions. [2022-04-28 05:40:06,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:40:06,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 198 states and 260 transitions. [2022-04-28 05:40:06,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:06,330 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 260 transitions. [2022-04-28 05:40:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 05:40:06,330 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:40:06,330 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:40:06,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-28 05:40:06,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 05:40:06,531 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:40:06,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:40:06,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1849570232, now seen corresponding path program 3 times [2022-04-28 05:40:06,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:06,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1476523781] [2022-04-28 05:40:06,532 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:40:06,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1849570232, now seen corresponding path program 4 times [2022-04-28 05:40:06,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:40:06,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159327540] [2022-04-28 05:40:06,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:40:06,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:40:06,541 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:40:06,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1731887530] [2022-04-28 05:40:06,541 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:40:06,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:40:06,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:40:06,542 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:40:06,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 05:40:06,583 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:40:06,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:40:06,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 05:40:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:40:06,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:40:07,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {14816#true} call ULTIMATE.init(); {14816#true} is VALID [2022-04-28 05:40:07,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {14816#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);~counter~0 := 0; {14816#true} is VALID [2022-04-28 05:40:07,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:07,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14816#true} {14816#true} #98#return; {14816#true} is VALID [2022-04-28 05:40:07,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {14816#true} call #t~ret8 := main(); {14816#true} is VALID [2022-04-28 05:40:07,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {14816#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14816#true} is VALID [2022-04-28 05:40:07,540 INFO L272 TraceCheckUtils]: 6: Hoare triple {14816#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:07,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:07,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:07,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:07,541 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14816#true} {14816#true} #78#return; {14816#true} is VALID [2022-04-28 05:40:07,541 INFO L272 TraceCheckUtils]: 11: Hoare triple {14816#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:07,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {14816#true} ~cond := #in~cond; {14857#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:40:07,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {14857#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {14861#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:40:07,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {14861#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {14861#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:40:07,542 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14861#(not (= |assume_abort_if_not_#in~cond| 0))} {14816#true} #80#return; {14868#(<= 1 main_~y~0)} is VALID [2022-04-28 05:40:07,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {14868#(<= 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; {14872#(<= 1 main_~b~0)} is VALID [2022-04-28 05:40:07,543 INFO L272 TraceCheckUtils]: 17: Hoare triple {14872#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:07,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:07,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:07,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:07,543 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14816#true} {14872#(<= 1 main_~b~0)} #82#return; {14872#(<= 1 main_~b~0)} is VALID [2022-04-28 05:40:07,543 INFO L272 TraceCheckUtils]: 22: Hoare triple {14872#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:07,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:07,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:07,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:07,544 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14816#true} {14872#(<= 1 main_~b~0)} #84#return; {14872#(<= 1 main_~b~0)} is VALID [2022-04-28 05:40:07,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {14872#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14872#(<= 1 main_~b~0)} is VALID [2022-04-28 05:40:07,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {14872#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {14872#(<= 1 main_~b~0)} is VALID [2022-04-28 05:40:07,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {14872#(<= 1 main_~b~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(#t~post7 < 10);havoc #t~post7; {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,545 INFO L272 TraceCheckUtils]: 32: Hoare triple {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:07,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:07,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:07,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:07,546 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14816#true} {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #86#return; {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,546 INFO L272 TraceCheckUtils]: 37: Hoare triple {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:07,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:07,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:07,546 INFO L290 TraceCheckUtils]: 40: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:07,547 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14816#true} {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #88#return; {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,547 INFO L272 TraceCheckUtils]: 42: Hoare triple {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:07,547 INFO L290 TraceCheckUtils]: 43: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:07,547 INFO L290 TraceCheckUtils]: 44: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:07,547 INFO L290 TraceCheckUtils]: 45: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:07,548 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14816#true} {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #90#return; {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,548 INFO L272 TraceCheckUtils]: 47: Hoare triple {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 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)); {14816#true} is VALID [2022-04-28 05:40:07,548 INFO L290 TraceCheckUtils]: 48: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:07,548 INFO L290 TraceCheckUtils]: 49: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:07,548 INFO L290 TraceCheckUtils]: 50: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:07,548 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14816#true} {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #92#return; {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,549 INFO L290 TraceCheckUtils]: 52: Hoare triple {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14982#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,549 INFO L290 TraceCheckUtils]: 53: Hoare triple {14982#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14982#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,550 INFO L290 TraceCheckUtils]: 54: Hoare triple {14982#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} assume !!(#t~post7 < 10);havoc #t~post7; {14982#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,550 INFO L272 TraceCheckUtils]: 55: Hoare triple {14982#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:07,550 INFO L290 TraceCheckUtils]: 56: Hoare triple {14816#true} ~cond := #in~cond; {14995#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:40:07,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {14995#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:40:07,551 INFO L290 TraceCheckUtils]: 58: Hoare triple {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:40:07,551 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} {14982#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} #86#return; {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,551 INFO L272 TraceCheckUtils]: 60: Hoare triple {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:07,551 INFO L290 TraceCheckUtils]: 61: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:07,551 INFO L290 TraceCheckUtils]: 62: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:07,551 INFO L290 TraceCheckUtils]: 63: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:07,552 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14816#true} {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} #88#return; {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,552 INFO L272 TraceCheckUtils]: 65: Hoare triple {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:07,552 INFO L290 TraceCheckUtils]: 66: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:07,552 INFO L290 TraceCheckUtils]: 67: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:07,552 INFO L290 TraceCheckUtils]: 68: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:07,553 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14816#true} {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} #90#return; {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,553 INFO L272 TraceCheckUtils]: 70: Hoare triple {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~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)); {14816#true} is VALID [2022-04-28 05:40:07,553 INFO L290 TraceCheckUtils]: 71: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:07,553 INFO L290 TraceCheckUtils]: 72: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:07,553 INFO L290 TraceCheckUtils]: 73: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:07,554 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14816#true} {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} #92#return; {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,555 INFO L290 TraceCheckUtils]: 75: Hoare triple {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {15055#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,556 INFO L290 TraceCheckUtils]: 76: Hoare triple {15055#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15055#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,556 INFO L290 TraceCheckUtils]: 77: Hoare triple {15055#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} assume !!(#t~post7 < 10);havoc #t~post7; {15055#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:07,556 INFO L272 TraceCheckUtils]: 78: Hoare triple {15055#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15065#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:40:07,557 INFO L290 TraceCheckUtils]: 79: Hoare triple {15065#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:40:07,557 INFO L290 TraceCheckUtils]: 80: Hoare triple {15069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14817#false} is VALID [2022-04-28 05:40:07,557 INFO L290 TraceCheckUtils]: 81: Hoare triple {14817#false} assume !false; {14817#false} is VALID [2022-04-28 05:40:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 30 proven. 29 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-04-28 05:40:07,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:40:14,310 INFO L290 TraceCheckUtils]: 81: Hoare triple {14817#false} assume !false; {14817#false} is VALID [2022-04-28 05:40:14,310 INFO L290 TraceCheckUtils]: 80: Hoare triple {15069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14817#false} is VALID [2022-04-28 05:40:14,311 INFO L290 TraceCheckUtils]: 79: Hoare triple {15065#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:40:14,311 INFO L272 TraceCheckUtils]: 78: Hoare triple {15085#(= 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)); {15065#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:40:14,311 INFO L290 TraceCheckUtils]: 77: Hoare triple {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:40:14,312 INFO L290 TraceCheckUtils]: 76: Hoare triple {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:40:14,314 INFO L290 TraceCheckUtils]: 75: Hoare triple {15085#(= 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; {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:40:14,315 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14816#true} {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:40:14,315 INFO L290 TraceCheckUtils]: 73: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:14,315 INFO L290 TraceCheckUtils]: 72: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:14,315 INFO L290 TraceCheckUtils]: 71: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:14,315 INFO L272 TraceCheckUtils]: 70: Hoare triple {15085#(= 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)); {14816#true} is VALID [2022-04-28 05:40:14,316 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14816#true} {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:40:14,316 INFO L290 TraceCheckUtils]: 68: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:14,316 INFO L290 TraceCheckUtils]: 67: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:14,316 INFO L290 TraceCheckUtils]: 66: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:14,316 INFO L272 TraceCheckUtils]: 65: Hoare triple {15085#(= 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)); {14816#true} is VALID [2022-04-28 05:40:14,316 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14816#true} {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:40:14,316 INFO L290 TraceCheckUtils]: 63: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:14,316 INFO L290 TraceCheckUtils]: 62: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:14,317 INFO L290 TraceCheckUtils]: 61: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:14,317 INFO L272 TraceCheckUtils]: 60: Hoare triple {15085#(= 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)); {14816#true} is VALID [2022-04-28 05:40:14,317 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} {14816#true} #86#return; {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:40:14,317 INFO L290 TraceCheckUtils]: 58: Hoare triple {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:40:14,318 INFO L290 TraceCheckUtils]: 57: Hoare triple {15152#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:40:14,318 INFO L290 TraceCheckUtils]: 56: Hoare triple {14816#true} ~cond := #in~cond; {15152#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:40:14,318 INFO L272 TraceCheckUtils]: 55: Hoare triple {14816#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:14,318 INFO L290 TraceCheckUtils]: 54: Hoare triple {14816#true} assume !!(#t~post7 < 10);havoc #t~post7; {14816#true} is VALID [2022-04-28 05:40:14,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {14816#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14816#true} is VALID [2022-04-28 05:40:14,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {14816#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14816#true} is VALID [2022-04-28 05:40:14,318 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14816#true} {14816#true} #92#return; {14816#true} is VALID [2022-04-28 05:40:14,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:14,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:14,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:14,318 INFO L272 TraceCheckUtils]: 47: Hoare triple {14816#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)); {14816#true} is VALID [2022-04-28 05:40:14,318 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14816#true} {14816#true} #90#return; {14816#true} is VALID [2022-04-28 05:40:14,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L290 TraceCheckUtils]: 43: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L272 TraceCheckUtils]: 42: Hoare triple {14816#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14816#true} {14816#true} #88#return; {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L272 TraceCheckUtils]: 37: Hoare triple {14816#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14816#true} {14816#true} #86#return; {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L272 TraceCheckUtils]: 32: Hoare triple {14816#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {14816#true} assume !!(#t~post7 < 10);havoc #t~post7; {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {14816#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {14816#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {14816#true} assume !!(#t~post6 < 10);havoc #t~post6; {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {14816#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14816#true} is VALID [2022-04-28 05:40:14,319 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14816#true} {14816#true} #84#return; {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L272 TraceCheckUtils]: 22: Hoare triple {14816#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14816#true} {14816#true} #82#return; {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L272 TraceCheckUtils]: 17: Hoare triple {14816#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {14816#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; {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14816#true} {14816#true} #80#return; {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L272 TraceCheckUtils]: 11: Hoare triple {14816#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14816#true} {14816#true} #78#return; {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 05:40:14,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 05:40:14,321 INFO L272 TraceCheckUtils]: 6: Hoare triple {14816#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14816#true} is VALID [2022-04-28 05:40:14,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {14816#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14816#true} is VALID [2022-04-28 05:40:14,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {14816#true} call #t~ret8 := main(); {14816#true} is VALID [2022-04-28 05:40:14,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14816#true} {14816#true} #98#return; {14816#true} is VALID [2022-04-28 05:40:14,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 05:40:14,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {14816#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);~counter~0 := 0; {14816#true} is VALID [2022-04-28 05:40:14,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {14816#true} call ULTIMATE.init(); {14816#true} is VALID [2022-04-28 05:40:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-04-28 05:40:14,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:40:14,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159327540] [2022-04-28 05:40:14,321 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:40:14,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731887530] [2022-04-28 05:40:14,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731887530] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:40:14,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:40:14,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 16 [2022-04-28 05:40:14,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:40:14,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1476523781] [2022-04-28 05:40:14,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1476523781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:40:14,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:40:14,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 05:40:14,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467805990] [2022-04-28 05:40:14,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:40:14,322 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 82 [2022-04-28 05:40:14,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:40:14,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:40:14,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:14,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 05:40:14,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:14,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 05:40:14,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:40:14,376 INFO L87 Difference]: Start difference. First operand 198 states and 260 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:40:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:18,392 INFO L93 Difference]: Finished difference Result 212 states and 278 transitions. [2022-04-28 05:40:18,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:40:18,392 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 82 [2022-04-28 05:40:18,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:40:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:40:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-04-28 05:40:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:40:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-04-28 05:40:18,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 106 transitions. [2022-04-28 05:40:18,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:18,494 INFO L225 Difference]: With dead ends: 212 [2022-04-28 05:40:18,494 INFO L226 Difference]: Without dead ends: 210 [2022-04-28 05:40:18,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-04-28 05:40:18,495 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 53 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 05:40:18,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 263 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 05:40:18,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-28 05:40:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 203. [2022-04-28 05:40:18,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:40:18,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:40:18,798 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:40:18,798 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:40:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:18,802 INFO L93 Difference]: Finished difference Result 210 states and 276 transitions. [2022-04-28 05:40:18,802 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2022-04-28 05:40:18,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:18,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:18,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 210 states. [2022-04-28 05:40:18,803 INFO L87 Difference]: Start difference. First operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 210 states. [2022-04-28 05:40:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:18,806 INFO L93 Difference]: Finished difference Result 210 states and 276 transitions. [2022-04-28 05:40:18,806 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2022-04-28 05:40:18,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:18,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:18,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:40:18,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:40:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:40:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 265 transitions. [2022-04-28 05:40:18,811 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 265 transitions. Word has length 82 [2022-04-28 05:40:18,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:40:18,811 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 265 transitions. [2022-04-28 05:40:18,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:40:18,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 203 states and 265 transitions. [2022-04-28 05:40:19,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:19,146 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 265 transitions. [2022-04-28 05:40:19,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 05:40:19,147 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:40:19,147 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 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] [2022-04-28 05:40:19,165 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 05:40:19,347 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 05:40:19,348 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:40:19,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:40:19,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1768368813, now seen corresponding path program 1 times [2022-04-28 05:40:19,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:19,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1397773224] [2022-04-28 05:40:19,348 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:40:19,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1768368813, now seen corresponding path program 2 times [2022-04-28 05:40:19,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:40:19,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261345783] [2022-04-28 05:40:19,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:40:19,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:40:19,357 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:40:19,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1832059914] [2022-04-28 05:40:19,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:40:19,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:40:19,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:40:19,360 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 05:40:19,361 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 05:40:19,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:40:19,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:40:19,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:40:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:40:19,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:40:19,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {16587#true} call ULTIMATE.init(); {16587#true} is VALID [2022-04-28 05:40:19,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {16587#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);~counter~0 := 0; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {16595#(<= ~counter~0 0)} assume true; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16595#(<= ~counter~0 0)} {16587#true} #98#return; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {16595#(<= ~counter~0 0)} call #t~ret8 := main(); {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {16595#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,688 INFO L272 TraceCheckUtils]: 6: Hoare triple {16595#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {16595#(<= ~counter~0 0)} ~cond := #in~cond; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {16595#(<= ~counter~0 0)} assume !(0 == ~cond); {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {16595#(<= ~counter~0 0)} assume true; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,689 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16595#(<= ~counter~0 0)} {16595#(<= ~counter~0 0)} #78#return; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,689 INFO L272 TraceCheckUtils]: 11: Hoare triple {16595#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {16595#(<= ~counter~0 0)} ~cond := #in~cond; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {16595#(<= ~counter~0 0)} assume !(0 == ~cond); {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {16595#(<= ~counter~0 0)} assume true; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,690 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16595#(<= ~counter~0 0)} {16595#(<= ~counter~0 0)} #80#return; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {16595#(<= ~counter~0 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; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,691 INFO L272 TraceCheckUtils]: 17: Hoare triple {16595#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {16595#(<= ~counter~0 0)} ~cond := #in~cond; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {16595#(<= ~counter~0 0)} assume !(0 == ~cond); {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {16595#(<= ~counter~0 0)} assume true; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,692 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16595#(<= ~counter~0 0)} {16595#(<= ~counter~0 0)} #82#return; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,692 INFO L272 TraceCheckUtils]: 22: Hoare triple {16595#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {16595#(<= ~counter~0 0)} ~cond := #in~cond; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {16595#(<= ~counter~0 0)} assume !(0 == ~cond); {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {16595#(<= ~counter~0 0)} assume true; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,693 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16595#(<= ~counter~0 0)} {16595#(<= ~counter~0 0)} #84#return; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:19,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {16595#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16674#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:19,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {16674#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {16674#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:19,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {16674#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16674#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:19,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {16674#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {16684#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,695 INFO L272 TraceCheckUtils]: 32: Hoare triple {16684#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {16684#(<= ~counter~0 2)} ~cond := #in~cond; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {16684#(<= ~counter~0 2)} assume !(0 == ~cond); {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {16684#(<= ~counter~0 2)} assume true; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,697 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16684#(<= ~counter~0 2)} {16684#(<= ~counter~0 2)} #86#return; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,697 INFO L272 TraceCheckUtils]: 37: Hoare triple {16684#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {16684#(<= ~counter~0 2)} ~cond := #in~cond; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,697 INFO L290 TraceCheckUtils]: 39: Hoare triple {16684#(<= ~counter~0 2)} assume !(0 == ~cond); {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {16684#(<= ~counter~0 2)} assume true; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,698 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16684#(<= ~counter~0 2)} {16684#(<= ~counter~0 2)} #88#return; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,699 INFO L272 TraceCheckUtils]: 42: Hoare triple {16684#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {16684#(<= ~counter~0 2)} ~cond := #in~cond; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {16684#(<= ~counter~0 2)} assume !(0 == ~cond); {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {16684#(<= ~counter~0 2)} assume true; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,700 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16684#(<= ~counter~0 2)} {16684#(<= ~counter~0 2)} #90#return; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,700 INFO L272 TraceCheckUtils]: 47: Hoare triple {16684#(<= ~counter~0 2)} 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)); {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,701 INFO L290 TraceCheckUtils]: 48: Hoare triple {16684#(<= ~counter~0 2)} ~cond := #in~cond; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,701 INFO L290 TraceCheckUtils]: 49: Hoare triple {16684#(<= ~counter~0 2)} assume !(0 == ~cond); {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,701 INFO L290 TraceCheckUtils]: 50: Hoare triple {16684#(<= ~counter~0 2)} assume true; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,702 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16684#(<= ~counter~0 2)} {16684#(<= ~counter~0 2)} #92#return; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,702 INFO L290 TraceCheckUtils]: 52: Hoare triple {16684#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:19,702 INFO L290 TraceCheckUtils]: 53: Hoare triple {16684#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,702 INFO L290 TraceCheckUtils]: 54: Hoare triple {16754#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,703 INFO L272 TraceCheckUtils]: 55: Hoare triple {16754#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,703 INFO L290 TraceCheckUtils]: 56: Hoare triple {16754#(<= ~counter~0 3)} ~cond := #in~cond; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,703 INFO L290 TraceCheckUtils]: 57: Hoare triple {16754#(<= ~counter~0 3)} assume !(0 == ~cond); {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,704 INFO L290 TraceCheckUtils]: 58: Hoare triple {16754#(<= ~counter~0 3)} assume true; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,704 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16754#(<= ~counter~0 3)} {16754#(<= ~counter~0 3)} #86#return; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,704 INFO L272 TraceCheckUtils]: 60: Hoare triple {16754#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,705 INFO L290 TraceCheckUtils]: 61: Hoare triple {16754#(<= ~counter~0 3)} ~cond := #in~cond; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,705 INFO L290 TraceCheckUtils]: 62: Hoare triple {16754#(<= ~counter~0 3)} assume !(0 == ~cond); {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,705 INFO L290 TraceCheckUtils]: 63: Hoare triple {16754#(<= ~counter~0 3)} assume true; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,706 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16754#(<= ~counter~0 3)} {16754#(<= ~counter~0 3)} #88#return; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,706 INFO L272 TraceCheckUtils]: 65: Hoare triple {16754#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,706 INFO L290 TraceCheckUtils]: 66: Hoare triple {16754#(<= ~counter~0 3)} ~cond := #in~cond; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,707 INFO L290 TraceCheckUtils]: 67: Hoare triple {16754#(<= ~counter~0 3)} assume !(0 == ~cond); {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,707 INFO L290 TraceCheckUtils]: 68: Hoare triple {16754#(<= ~counter~0 3)} assume true; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,707 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16754#(<= ~counter~0 3)} {16754#(<= ~counter~0 3)} #90#return; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,708 INFO L272 TraceCheckUtils]: 70: Hoare triple {16754#(<= ~counter~0 3)} 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)); {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,708 INFO L290 TraceCheckUtils]: 71: Hoare triple {16754#(<= ~counter~0 3)} ~cond := #in~cond; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,708 INFO L290 TraceCheckUtils]: 72: Hoare triple {16754#(<= ~counter~0 3)} assume !(0 == ~cond); {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,709 INFO L290 TraceCheckUtils]: 73: Hoare triple {16754#(<= ~counter~0 3)} assume true; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,709 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16754#(<= ~counter~0 3)} {16754#(<= ~counter~0 3)} #92#return; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,709 INFO L290 TraceCheckUtils]: 75: Hoare triple {16754#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,710 INFO L290 TraceCheckUtils]: 76: Hoare triple {16754#(<= ~counter~0 3)} ~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; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:19,710 INFO L290 TraceCheckUtils]: 77: Hoare triple {16754#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16827#(<= |main_#t~post6| 3)} is VALID [2022-04-28 05:40:19,710 INFO L290 TraceCheckUtils]: 78: Hoare triple {16827#(<= |main_#t~post6| 3)} assume !(#t~post6 < 10);havoc #t~post6; {16588#false} is VALID [2022-04-28 05:40:19,710 INFO L272 TraceCheckUtils]: 79: Hoare triple {16588#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {16588#false} is VALID [2022-04-28 05:40:19,710 INFO L290 TraceCheckUtils]: 80: Hoare triple {16588#false} ~cond := #in~cond; {16588#false} is VALID [2022-04-28 05:40:19,710 INFO L290 TraceCheckUtils]: 81: Hoare triple {16588#false} assume 0 == ~cond; {16588#false} is VALID [2022-04-28 05:40:19,710 INFO L290 TraceCheckUtils]: 82: Hoare triple {16588#false} assume !false; {16588#false} is VALID [2022-04-28 05:40:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 05:40:19,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:40:20,003 INFO L290 TraceCheckUtils]: 82: Hoare triple {16588#false} assume !false; {16588#false} is VALID [2022-04-28 05:40:20,003 INFO L290 TraceCheckUtils]: 81: Hoare triple {16588#false} assume 0 == ~cond; {16588#false} is VALID [2022-04-28 05:40:20,003 INFO L290 TraceCheckUtils]: 80: Hoare triple {16588#false} ~cond := #in~cond; {16588#false} is VALID [2022-04-28 05:40:20,003 INFO L272 TraceCheckUtils]: 79: Hoare triple {16588#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {16588#false} is VALID [2022-04-28 05:40:20,003 INFO L290 TraceCheckUtils]: 78: Hoare triple {16855#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {16588#false} is VALID [2022-04-28 05:40:20,003 INFO L290 TraceCheckUtils]: 77: Hoare triple {16859#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16855#(< |main_#t~post6| 10)} is VALID [2022-04-28 05:40:20,004 INFO L290 TraceCheckUtils]: 76: Hoare triple {16859#(< ~counter~0 10)} ~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; {16859#(< ~counter~0 10)} is VALID [2022-04-28 05:40:20,004 INFO L290 TraceCheckUtils]: 75: Hoare triple {16859#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {16859#(< ~counter~0 10)} is VALID [2022-04-28 05:40:20,004 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16587#true} {16859#(< ~counter~0 10)} #92#return; {16859#(< ~counter~0 10)} is VALID [2022-04-28 05:40:20,005 INFO L290 TraceCheckUtils]: 73: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 05:40:20,005 INFO L290 TraceCheckUtils]: 72: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 05:40:20,005 INFO L290 TraceCheckUtils]: 71: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 05:40:20,005 INFO L272 TraceCheckUtils]: 70: Hoare triple {16859#(< ~counter~0 10)} 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)); {16587#true} is VALID [2022-04-28 05:40:20,005 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16587#true} {16859#(< ~counter~0 10)} #90#return; {16859#(< ~counter~0 10)} is VALID [2022-04-28 05:40:20,005 INFO L290 TraceCheckUtils]: 68: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 05:40:20,005 INFO L290 TraceCheckUtils]: 67: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 05:40:20,005 INFO L290 TraceCheckUtils]: 66: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 05:40:20,005 INFO L272 TraceCheckUtils]: 65: Hoare triple {16859#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16587#true} is VALID [2022-04-28 05:40:20,006 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16587#true} {16859#(< ~counter~0 10)} #88#return; {16859#(< ~counter~0 10)} is VALID [2022-04-28 05:40:20,006 INFO L290 TraceCheckUtils]: 63: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 05:40:20,006 INFO L290 TraceCheckUtils]: 62: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 05:40:20,006 INFO L290 TraceCheckUtils]: 61: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 05:40:20,006 INFO L272 TraceCheckUtils]: 60: Hoare triple {16859#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16587#true} is VALID [2022-04-28 05:40:20,006 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16587#true} {16859#(< ~counter~0 10)} #86#return; {16859#(< ~counter~0 10)} is VALID [2022-04-28 05:40:20,007 INFO L290 TraceCheckUtils]: 58: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 05:40:20,007 INFO L290 TraceCheckUtils]: 57: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 05:40:20,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 05:40:20,007 INFO L272 TraceCheckUtils]: 55: Hoare triple {16859#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16587#true} is VALID [2022-04-28 05:40:20,007 INFO L290 TraceCheckUtils]: 54: Hoare triple {16859#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {16859#(< ~counter~0 10)} is VALID [2022-04-28 05:40:20,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {16932#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16859#(< ~counter~0 10)} is VALID [2022-04-28 05:40:20,008 INFO L290 TraceCheckUtils]: 52: Hoare triple {16932#(< ~counter~0 9)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16932#(< ~counter~0 9)} is VALID [2022-04-28 05:40:20,009 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16587#true} {16932#(< ~counter~0 9)} #92#return; {16932#(< ~counter~0 9)} is VALID [2022-04-28 05:40:20,009 INFO L290 TraceCheckUtils]: 50: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 05:40:20,009 INFO L290 TraceCheckUtils]: 49: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 05:40:20,009 INFO L290 TraceCheckUtils]: 48: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 05:40:20,009 INFO L272 TraceCheckUtils]: 47: Hoare triple {16932#(< ~counter~0 9)} 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)); {16587#true} is VALID [2022-04-28 05:40:20,009 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16587#true} {16932#(< ~counter~0 9)} #90#return; {16932#(< ~counter~0 9)} is VALID [2022-04-28 05:40:20,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 05:40:20,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 05:40:20,009 INFO L290 TraceCheckUtils]: 43: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 05:40:20,009 INFO L272 TraceCheckUtils]: 42: Hoare triple {16932#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16587#true} is VALID [2022-04-28 05:40:20,010 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16587#true} {16932#(< ~counter~0 9)} #88#return; {16932#(< ~counter~0 9)} is VALID [2022-04-28 05:40:20,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 05:40:20,010 INFO L290 TraceCheckUtils]: 39: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 05:40:20,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 05:40:20,010 INFO L272 TraceCheckUtils]: 37: Hoare triple {16932#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16587#true} is VALID [2022-04-28 05:40:20,011 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16587#true} {16932#(< ~counter~0 9)} #86#return; {16932#(< ~counter~0 9)} is VALID [2022-04-28 05:40:20,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 05:40:20,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 05:40:20,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 05:40:20,011 INFO L272 TraceCheckUtils]: 32: Hoare triple {16932#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16587#true} is VALID [2022-04-28 05:40:20,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {16932#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {16932#(< ~counter~0 9)} is VALID [2022-04-28 05:40:20,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {17002#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16932#(< ~counter~0 9)} is VALID [2022-04-28 05:40:20,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {17002#(< ~counter~0 8)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {17002#(< ~counter~0 8)} is VALID [2022-04-28 05:40:20,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {17002#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {17002#(< ~counter~0 8)} is VALID [2022-04-28 05:40:20,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {17012#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17002#(< ~counter~0 8)} is VALID [2022-04-28 05:40:20,014 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16587#true} {17012#(< ~counter~0 7)} #84#return; {17012#(< ~counter~0 7)} is VALID [2022-04-28 05:40:20,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 05:40:20,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 05:40:20,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 05:40:20,014 INFO L272 TraceCheckUtils]: 22: Hoare triple {17012#(< ~counter~0 7)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16587#true} is VALID [2022-04-28 05:40:20,015 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16587#true} {17012#(< ~counter~0 7)} #82#return; {17012#(< ~counter~0 7)} is VALID [2022-04-28 05:40:20,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 05:40:20,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 05:40:20,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 05:40:20,015 INFO L272 TraceCheckUtils]: 17: Hoare triple {17012#(< ~counter~0 7)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16587#true} is VALID [2022-04-28 05:40:20,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {17012#(< ~counter~0 7)} ~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; {17012#(< ~counter~0 7)} is VALID [2022-04-28 05:40:20,016 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16587#true} {17012#(< ~counter~0 7)} #80#return; {17012#(< ~counter~0 7)} is VALID [2022-04-28 05:40:20,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 05:40:20,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 05:40:20,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 05:40:20,016 INFO L272 TraceCheckUtils]: 11: Hoare triple {17012#(< ~counter~0 7)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16587#true} is VALID [2022-04-28 05:40:20,016 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16587#true} {17012#(< ~counter~0 7)} #78#return; {17012#(< ~counter~0 7)} is VALID [2022-04-28 05:40:20,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 05:40:20,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 05:40:20,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 05:40:20,016 INFO L272 TraceCheckUtils]: 6: Hoare triple {17012#(< ~counter~0 7)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16587#true} is VALID [2022-04-28 05:40:20,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {17012#(< ~counter~0 7)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {17012#(< ~counter~0 7)} is VALID [2022-04-28 05:40:20,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {17012#(< ~counter~0 7)} call #t~ret8 := main(); {17012#(< ~counter~0 7)} is VALID [2022-04-28 05:40:20,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17012#(< ~counter~0 7)} {16587#true} #98#return; {17012#(< ~counter~0 7)} is VALID [2022-04-28 05:40:20,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {17012#(< ~counter~0 7)} assume true; {17012#(< ~counter~0 7)} is VALID [2022-04-28 05:40:20,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {16587#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);~counter~0 := 0; {17012#(< ~counter~0 7)} is VALID [2022-04-28 05:40:20,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {16587#true} call ULTIMATE.init(); {16587#true} is VALID [2022-04-28 05:40:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 05:40:20,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:40:20,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261345783] [2022-04-28 05:40:20,018 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:40:20,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832059914] [2022-04-28 05:40:20,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832059914] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:40:20,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:40:20,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 05:40:20,018 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:40:20,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1397773224] [2022-04-28 05:40:20,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1397773224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:40:20,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:40:20,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:40:20,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502155153] [2022-04-28 05:40:20,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:40:20,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 83 [2022-04-28 05:40:20,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:40:20,019 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), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:20,056 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 05:40:20,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:40:20,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:20,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:40:20,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:40:20,056 INFO L87 Difference]: Start difference. First operand 203 states and 265 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:20,525 INFO L93 Difference]: Finished difference Result 214 states and 277 transitions. [2022-04-28 05:40:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:40:20,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 83 [2022-04-28 05:40:20,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:40:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 05:40:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 05:40:20,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-28 05:40:20,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:20,616 INFO L225 Difference]: With dead ends: 214 [2022-04-28 05:40:20,616 INFO L226 Difference]: Without dead ends: 206 [2022-04-28 05:40:20,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:40:20,617 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 18 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:40:20,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 160 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:40:20,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-28 05:40:20,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-04-28 05:40:20,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:40:20,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:40:20,923 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:40:20,923 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:40:20,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:20,926 INFO L93 Difference]: Finished difference Result 206 states and 268 transitions. [2022-04-28 05:40:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-28 05:40:20,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:20,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:20,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 206 states. [2022-04-28 05:40:20,927 INFO L87 Difference]: Start difference. First operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 206 states. [2022-04-28 05:40:20,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:20,931 INFO L93 Difference]: Finished difference Result 206 states and 268 transitions. [2022-04-28 05:40:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-28 05:40:20,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:20,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:20,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:40:20,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:40:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:40:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 268 transitions. [2022-04-28 05:40:20,935 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 268 transitions. Word has length 83 [2022-04-28 05:40:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:40:20,936 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 268 transitions. [2022-04-28 05:40:20,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:20,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 206 states and 268 transitions. [2022-04-28 05:40:21,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-28 05:40:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 05:40:21,268 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:40:21,268 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 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] [2022-04-28 05:40:21,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-28 05:40:21,468 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 05:40:21,469 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:40:21,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:40:21,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 1 times [2022-04-28 05:40:21,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:21,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2012417311] [2022-04-28 05:40:21,470 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:40:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 2 times [2022-04-28 05:40:21,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:40:21,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771068623] [2022-04-28 05:40:21,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:40:21,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:40:21,478 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:40:21,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645638189] [2022-04-28 05:40:21,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:40:21,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:40:21,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:40:21,480 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 05:40:21,480 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 05:40:21,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:40:21,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:40:21,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 05:40:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:40:21,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:40:22,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {18352#true} call ULTIMATE.init(); {18352#true} is VALID [2022-04-28 05:40:22,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {18352#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);~counter~0 := 0; {18352#true} is VALID [2022-04-28 05:40:22,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18352#true} {18352#true} #98#return; {18352#true} is VALID [2022-04-28 05:40:22,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {18352#true} call #t~ret8 := main(); {18352#true} is VALID [2022-04-28 05:40:22,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {18352#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18352#true} is VALID [2022-04-28 05:40:22,076 INFO L272 TraceCheckUtils]: 6: Hoare triple {18352#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18352#true} is VALID [2022-04-28 05:40:22,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:22,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:22,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,076 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18352#true} {18352#true} #78#return; {18352#true} is VALID [2022-04-28 05:40:22,076 INFO L272 TraceCheckUtils]: 11: Hoare triple {18352#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18352#true} is VALID [2022-04-28 05:40:22,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:22,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:22,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,077 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18352#true} {18352#true} #80#return; {18352#true} is VALID [2022-04-28 05:40:22,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {18352#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; {18405#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:22,077 INFO L272 TraceCheckUtils]: 17: Hoare triple {18405#(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)); {18352#true} is VALID [2022-04-28 05:40:22,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:22,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:22,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,078 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18352#true} {18405#(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))} #82#return; {18405#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:22,078 INFO L272 TraceCheckUtils]: 22: Hoare triple {18405#(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)); {18352#true} is VALID [2022-04-28 05:40:22,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:22,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:22,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,079 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18352#true} {18405#(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))} #84#return; {18405#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:22,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {18405#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18405#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:22,079 INFO L290 TraceCheckUtils]: 28: Hoare triple {18405#(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 !!(#t~post6 < 10);havoc #t~post6; {18405#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:22,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {18405#(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; {18445#(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 05:40:22,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {18445#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18445#(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 05:40:22,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {18445#(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 !!(#t~post7 < 10);havoc #t~post7; {18445#(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 05:40:22,081 INFO L272 TraceCheckUtils]: 32: Hoare triple {18445#(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)); {18352#true} is VALID [2022-04-28 05:40:22,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:22,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:22,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,081 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18352#true} {18445#(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))} #86#return; {18445#(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 05:40:22,081 INFO L272 TraceCheckUtils]: 37: Hoare triple {18445#(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)); {18352#true} is VALID [2022-04-28 05:40:22,081 INFO L290 TraceCheckUtils]: 38: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:22,081 INFO L290 TraceCheckUtils]: 39: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:22,082 INFO L290 TraceCheckUtils]: 40: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,082 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18352#true} {18445#(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))} #88#return; {18445#(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 05:40:22,082 INFO L272 TraceCheckUtils]: 42: Hoare triple {18445#(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)); {18352#true} is VALID [2022-04-28 05:40:22,082 INFO L290 TraceCheckUtils]: 43: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:22,082 INFO L290 TraceCheckUtils]: 44: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:22,082 INFO L290 TraceCheckUtils]: 45: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,083 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18352#true} {18445#(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))} #90#return; {18445#(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 05:40:22,083 INFO L272 TraceCheckUtils]: 47: Hoare triple {18445#(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)); {18352#true} is VALID [2022-04-28 05:40:22,083 INFO L290 TraceCheckUtils]: 48: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:22,083 INFO L290 TraceCheckUtils]: 49: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:22,083 INFO L290 TraceCheckUtils]: 50: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,084 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {18352#true} {18445#(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))} #92#return; {18445#(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 05:40:22,084 INFO L290 TraceCheckUtils]: 52: Hoare triple {18445#(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; {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:22,085 INFO L290 TraceCheckUtils]: 53: Hoare triple {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:22,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:22,085 INFO L272 TraceCheckUtils]: 55: Hoare triple {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18352#true} is VALID [2022-04-28 05:40:22,085 INFO L290 TraceCheckUtils]: 56: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:22,085 INFO L290 TraceCheckUtils]: 57: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:22,085 INFO L290 TraceCheckUtils]: 58: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,086 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18352#true} {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #86#return; {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:22,086 INFO L272 TraceCheckUtils]: 60: Hoare triple {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18352#true} is VALID [2022-04-28 05:40:22,086 INFO L290 TraceCheckUtils]: 61: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:22,086 INFO L290 TraceCheckUtils]: 62: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:22,086 INFO L290 TraceCheckUtils]: 63: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,087 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18352#true} {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #88#return; {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:22,087 INFO L272 TraceCheckUtils]: 65: Hoare triple {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18352#true} is VALID [2022-04-28 05:40:22,087 INFO L290 TraceCheckUtils]: 66: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:22,087 INFO L290 TraceCheckUtils]: 67: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:22,087 INFO L290 TraceCheckUtils]: 68: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,087 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18352#true} {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #90#return; {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:22,087 INFO L272 TraceCheckUtils]: 70: Hoare triple {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= 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)); {18352#true} is VALID [2022-04-28 05:40:22,087 INFO L290 TraceCheckUtils]: 71: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:22,088 INFO L290 TraceCheckUtils]: 72: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:22,088 INFO L290 TraceCheckUtils]: 73: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,088 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18352#true} {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #92#return; {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:22,089 INFO L290 TraceCheckUtils]: 75: Hoare triple {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:22,089 INFO L290 TraceCheckUtils]: 76: Hoare triple {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= 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; {18588#(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 05:40:22,089 INFO L290 TraceCheckUtils]: 77: Hoare triple {18588#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18588#(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 05:40:22,090 INFO L290 TraceCheckUtils]: 78: Hoare triple {18588#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(#t~post6 < 10);havoc #t~post6; {18588#(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 05:40:22,090 INFO L290 TraceCheckUtils]: 79: Hoare triple {18588#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {18598#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 05:40:22,091 INFO L272 TraceCheckUtils]: 80: Hoare triple {18598#(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)); {18602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:40:22,091 INFO L290 TraceCheckUtils]: 81: Hoare triple {18602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:40:22,091 INFO L290 TraceCheckUtils]: 82: Hoare triple {18606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18353#false} is VALID [2022-04-28 05:40:22,091 INFO L290 TraceCheckUtils]: 83: Hoare triple {18353#false} assume !false; {18353#false} is VALID [2022-04-28 05:40:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 05:40:22,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:40:22,568 INFO L290 TraceCheckUtils]: 83: Hoare triple {18353#false} assume !false; {18353#false} is VALID [2022-04-28 05:40:22,568 INFO L290 TraceCheckUtils]: 82: Hoare triple {18606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18353#false} is VALID [2022-04-28 05:40:22,568 INFO L290 TraceCheckUtils]: 81: Hoare triple {18602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:40:22,569 INFO L272 TraceCheckUtils]: 80: Hoare triple {18622#(= (+ (* 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)); {18602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:40:22,569 INFO L290 TraceCheckUtils]: 79: Hoare triple {18626#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {18622#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-28 05:40:22,569 INFO L290 TraceCheckUtils]: 78: Hoare triple {18626#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !!(#t~post6 < 10);havoc #t~post6; {18626#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-28 05:40:22,570 INFO L290 TraceCheckUtils]: 77: Hoare triple {18626#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18626#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-28 05:40:22,903 INFO L290 TraceCheckUtils]: 76: Hoare triple {18636#(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; {18626#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-28 05:40:22,903 INFO L290 TraceCheckUtils]: 75: Hoare triple {18636#(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))} assume !(~c~0 >= ~b~0); {18636#(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 05:40:22,904 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18352#true} {18636#(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))} #92#return; {18636#(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 05:40:22,904 INFO L290 TraceCheckUtils]: 73: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,904 INFO L290 TraceCheckUtils]: 72: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:22,904 INFO L290 TraceCheckUtils]: 71: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:22,904 INFO L272 TraceCheckUtils]: 70: Hoare triple {18636#(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))} 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)); {18352#true} is VALID [2022-04-28 05:40:22,905 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18352#true} {18636#(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))} #90#return; {18636#(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 05:40:22,905 INFO L290 TraceCheckUtils]: 68: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,905 INFO L290 TraceCheckUtils]: 67: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:22,905 INFO L290 TraceCheckUtils]: 66: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:22,905 INFO L272 TraceCheckUtils]: 65: Hoare triple {18636#(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))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18352#true} is VALID [2022-04-28 05:40:22,906 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18352#true} {18636#(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))} #88#return; {18636#(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 05:40:22,906 INFO L290 TraceCheckUtils]: 63: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,906 INFO L290 TraceCheckUtils]: 62: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:22,906 INFO L290 TraceCheckUtils]: 61: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:22,906 INFO L272 TraceCheckUtils]: 60: Hoare triple {18636#(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))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18352#true} is VALID [2022-04-28 05:40:22,907 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18352#true} {18636#(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))} #86#return; {18636#(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 05:40:22,907 INFO L290 TraceCheckUtils]: 58: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:22,907 INFO L290 TraceCheckUtils]: 57: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:22,907 INFO L290 TraceCheckUtils]: 56: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:22,907 INFO L272 TraceCheckUtils]: 55: Hoare triple {18636#(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))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18352#true} is VALID [2022-04-28 05:40:22,907 INFO L290 TraceCheckUtils]: 54: Hoare triple {18636#(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))} assume !!(#t~post7 < 10);havoc #t~post7; {18636#(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 05:40:22,908 INFO L290 TraceCheckUtils]: 53: Hoare triple {18636#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18636#(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 05:40:23,061 INFO L290 TraceCheckUtils]: 52: Hoare triple {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {18636#(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 05:40:23,062 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {18352#true} {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #92#return; {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-28 05:40:23,062 INFO L290 TraceCheckUtils]: 50: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:23,062 INFO L290 TraceCheckUtils]: 49: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:23,062 INFO L290 TraceCheckUtils]: 48: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:23,062 INFO L272 TraceCheckUtils]: 47: Hoare triple {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 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)); {18352#true} is VALID [2022-04-28 05:40:23,063 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18352#true} {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #90#return; {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-28 05:40:23,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:23,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:23,063 INFO L290 TraceCheckUtils]: 43: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:23,063 INFO L272 TraceCheckUtils]: 42: Hoare triple {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18352#true} is VALID [2022-04-28 05:40:23,064 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18352#true} {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #88#return; {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-28 05:40:23,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:23,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:23,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:23,064 INFO L272 TraceCheckUtils]: 37: Hoare triple {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18352#true} is VALID [2022-04-28 05:40:23,065 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18352#true} {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #86#return; {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-28 05:40:23,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:23,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:23,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:23,065 INFO L272 TraceCheckUtils]: 32: Hoare triple {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18352#true} is VALID [2022-04-28 05:40:23,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} assume !!(#t~post7 < 10);havoc #t~post7; {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-28 05:40:23,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-28 05:40:23,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-28 05:40:23,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(#t~post6 < 10);havoc #t~post6; {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:40:23,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:40:23,068 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18352#true} {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #84#return; {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:40:23,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:23,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:23,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:23,068 INFO L272 TraceCheckUtils]: 22: Hoare triple {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {18352#true} is VALID [2022-04-28 05:40:23,068 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18352#true} {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #82#return; {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:40:23,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:23,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:23,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:23,069 INFO L272 TraceCheckUtils]: 17: Hoare triple {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {18352#true} is VALID [2022-04-28 05:40:23,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {18352#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; {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:40:23,069 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18352#true} {18352#true} #80#return; {18352#true} is VALID [2022-04-28 05:40:23,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:23,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:23,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:23,069 INFO L272 TraceCheckUtils]: 11: Hoare triple {18352#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18352#true} is VALID [2022-04-28 05:40:23,069 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18352#true} {18352#true} #78#return; {18352#true} is VALID [2022-04-28 05:40:23,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:23,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 05:40:23,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 05:40:23,069 INFO L272 TraceCheckUtils]: 6: Hoare triple {18352#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18352#true} is VALID [2022-04-28 05:40:23,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {18352#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18352#true} is VALID [2022-04-28 05:40:23,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {18352#true} call #t~ret8 := main(); {18352#true} is VALID [2022-04-28 05:40:23,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18352#true} {18352#true} #98#return; {18352#true} is VALID [2022-04-28 05:40:23,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 05:40:23,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {18352#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);~counter~0 := 0; {18352#true} is VALID [2022-04-28 05:40:23,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {18352#true} call ULTIMATE.init(); {18352#true} is VALID [2022-04-28 05:40:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 05:40:23,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:40:23,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771068623] [2022-04-28 05:40:23,070 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:40:23,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645638189] [2022-04-28 05:40:23,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645638189] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:40:23,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:40:23,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 05:40:23,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:40:23,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2012417311] [2022-04-28 05:40:23,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2012417311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:40:23,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:40:23,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:40:23,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200605750] [2022-04-28 05:40:23,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:40:23,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 84 [2022-04-28 05:40:23,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:40:23,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:23,114 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 05:40:23,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:40:23,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:23,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:40:23,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:40:23,115 INFO L87 Difference]: Start difference. First operand 206 states and 268 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:24,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:24,359 INFO L93 Difference]: Finished difference Result 234 states and 311 transitions. [2022-04-28 05:40:24,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:40:24,359 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 84 [2022-04-28 05:40:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:40:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-28 05:40:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-28 05:40:24,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 114 transitions. [2022-04-28 05:40:24,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:24,478 INFO L225 Difference]: With dead ends: 234 [2022-04-28 05:40:24,478 INFO L226 Difference]: Without dead ends: 232 [2022-04-28 05:40:24,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:40:24,479 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 25 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 05:40:24,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 307 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 05:40:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-04-28 05:40:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2022-04-28 05:40:24,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:40:24,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-28 05:40:24,788 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-28 05:40:24,788 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-28 05:40:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:24,798 INFO L93 Difference]: Finished difference Result 232 states and 309 transitions. [2022-04-28 05:40:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-28 05:40:24,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:24,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:24,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) Second operand 232 states. [2022-04-28 05:40:24,800 INFO L87 Difference]: Start difference. First operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) Second operand 232 states. [2022-04-28 05:40:24,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:24,805 INFO L93 Difference]: Finished difference Result 232 states and 309 transitions. [2022-04-28 05:40:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-28 05:40:24,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:24,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:24,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:40:24,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:40:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-28 05:40:24,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 306 transitions. [2022-04-28 05:40:24,811 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 306 transitions. Word has length 84 [2022-04-28 05:40:24,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:40:24,812 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 306 transitions. [2022-04-28 05:40:24,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:24,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 306 transitions. [2022-04-28 05:40:25,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 306 transitions. [2022-04-28 05:40:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 05:40:25,177 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:40:25,177 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 2, 2, 2, 2, 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] [2022-04-28 05:40:25,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 05:40:25,395 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 05:40:25,395 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:40:25,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:40:25,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1676300815, now seen corresponding path program 3 times [2022-04-28 05:40:25,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:25,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [942445975] [2022-04-28 05:40:25,396 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:40:25,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1676300815, now seen corresponding path program 4 times [2022-04-28 05:40:25,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:40:25,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126109112] [2022-04-28 05:40:25,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:40:25,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:40:25,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:40:25,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016801100] [2022-04-28 05:40:25,411 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:40:25,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:40:25,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:40:25,417 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 05:40:25,418 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 05:40:25,459 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:40:25,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:40:25,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 05:40:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:40:25,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:40:25,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {20267#true} call ULTIMATE.init(); {20267#true} is VALID [2022-04-28 05:40:25,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {20267#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);~counter~0 := 0; {20267#true} is VALID [2022-04-28 05:40:25,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 05:40:25,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20267#true} {20267#true} #98#return; {20267#true} is VALID [2022-04-28 05:40:25,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {20267#true} call #t~ret8 := main(); {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {20267#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L272 TraceCheckUtils]: 6: Hoare triple {20267#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20267#true} {20267#true} #78#return; {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L272 TraceCheckUtils]: 11: Hoare triple {20267#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20267#true} {20267#true} #80#return; {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {20267#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; {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L272 TraceCheckUtils]: 17: Hoare triple {20267#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20267#true} {20267#true} #82#return; {20267#true} is VALID [2022-04-28 05:40:25,651 INFO L272 TraceCheckUtils]: 22: Hoare triple {20267#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20267#true} {20267#true} #84#return; {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L290 TraceCheckUtils]: 27: Hoare triple {20267#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {20267#true} assume !!(#t~post6 < 10);havoc #t~post6; {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {20267#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {20267#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {20267#true} assume !!(#t~post7 < 10);havoc #t~post7; {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L272 TraceCheckUtils]: 32: Hoare triple {20267#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20267#true} {20267#true} #86#return; {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L272 TraceCheckUtils]: 37: Hoare triple {20267#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L290 TraceCheckUtils]: 39: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L290 TraceCheckUtils]: 40: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 05:40:25,652 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20267#true} {20267#true} #88#return; {20267#true} is VALID [2022-04-28 05:40:25,653 INFO L272 TraceCheckUtils]: 42: Hoare triple {20267#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20267#true} is VALID [2022-04-28 05:40:25,653 INFO L290 TraceCheckUtils]: 43: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 05:40:25,653 INFO L290 TraceCheckUtils]: 44: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 05:40:25,653 INFO L290 TraceCheckUtils]: 45: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 05:40:25,653 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {20267#true} {20267#true} #90#return; {20267#true} is VALID [2022-04-28 05:40:25,653 INFO L272 TraceCheckUtils]: 47: Hoare triple {20267#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)); {20267#true} is VALID [2022-04-28 05:40:25,653 INFO L290 TraceCheckUtils]: 48: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 05:40:25,653 INFO L290 TraceCheckUtils]: 49: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 05:40:25,653 INFO L290 TraceCheckUtils]: 50: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 05:40:25,653 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {20267#true} {20267#true} #92#return; {20267#true} is VALID [2022-04-28 05:40:25,653 INFO L290 TraceCheckUtils]: 52: Hoare triple {20267#true} assume !(~c~0 >= ~b~0); {20428#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:40:25,654 INFO L290 TraceCheckUtils]: 53: Hoare triple {20428#(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; {20432#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:40:25,654 INFO L290 TraceCheckUtils]: 54: Hoare triple {20432#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20432#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:40:25,654 INFO L290 TraceCheckUtils]: 55: Hoare triple {20432#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {20432#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:40:25,654 INFO L290 TraceCheckUtils]: 56: Hoare triple {20432#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20442#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:40:25,655 INFO L290 TraceCheckUtils]: 57: Hoare triple {20442#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20442#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:40:25,655 INFO L290 TraceCheckUtils]: 58: Hoare triple {20442#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {20442#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:40:25,655 INFO L272 TraceCheckUtils]: 59: Hoare triple {20442#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20267#true} is VALID [2022-04-28 05:40:25,655 INFO L290 TraceCheckUtils]: 60: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 05:40:25,655 INFO L290 TraceCheckUtils]: 61: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 05:40:25,655 INFO L290 TraceCheckUtils]: 62: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 05:40:25,656 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20267#true} {20442#(< main_~b~0 main_~c~0)} #86#return; {20442#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:40:25,656 INFO L272 TraceCheckUtils]: 64: Hoare triple {20442#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20267#true} is VALID [2022-04-28 05:40:25,656 INFO L290 TraceCheckUtils]: 65: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 05:40:25,656 INFO L290 TraceCheckUtils]: 66: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 05:40:25,656 INFO L290 TraceCheckUtils]: 67: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 05:40:25,656 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {20267#true} {20442#(< main_~b~0 main_~c~0)} #88#return; {20442#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:40:25,656 INFO L272 TraceCheckUtils]: 69: Hoare triple {20442#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20267#true} is VALID [2022-04-28 05:40:25,656 INFO L290 TraceCheckUtils]: 70: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 05:40:25,656 INFO L290 TraceCheckUtils]: 71: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 05:40:25,656 INFO L290 TraceCheckUtils]: 72: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 05:40:25,657 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20267#true} {20442#(< main_~b~0 main_~c~0)} #90#return; {20442#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:40:25,657 INFO L272 TraceCheckUtils]: 74: Hoare triple {20442#(< 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)); {20267#true} is VALID [2022-04-28 05:40:25,657 INFO L290 TraceCheckUtils]: 75: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 05:40:25,657 INFO L290 TraceCheckUtils]: 76: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 05:40:25,657 INFO L290 TraceCheckUtils]: 77: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 05:40:25,658 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {20267#true} {20442#(< main_~b~0 main_~c~0)} #92#return; {20442#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:40:25,658 INFO L290 TraceCheckUtils]: 79: Hoare triple {20442#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {20268#false} is VALID [2022-04-28 05:40:25,658 INFO L290 TraceCheckUtils]: 80: Hoare triple {20268#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; {20268#false} is VALID [2022-04-28 05:40:25,659 INFO L290 TraceCheckUtils]: 81: Hoare triple {20268#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20268#false} is VALID [2022-04-28 05:40:25,659 INFO L290 TraceCheckUtils]: 82: Hoare triple {20268#false} assume !(#t~post6 < 10);havoc #t~post6; {20268#false} is VALID [2022-04-28 05:40:25,659 INFO L272 TraceCheckUtils]: 83: Hoare triple {20268#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {20268#false} is VALID [2022-04-28 05:40:25,659 INFO L290 TraceCheckUtils]: 84: Hoare triple {20268#false} ~cond := #in~cond; {20268#false} is VALID [2022-04-28 05:40:25,659 INFO L290 TraceCheckUtils]: 85: Hoare triple {20268#false} assume 0 == ~cond; {20268#false} is VALID [2022-04-28 05:40:25,659 INFO L290 TraceCheckUtils]: 86: Hoare triple {20268#false} assume !false; {20268#false} is VALID [2022-04-28 05:40:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 05:40:25,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:40:25,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:40:25,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126109112] [2022-04-28 05:40:25,660 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:40:25,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016801100] [2022-04-28 05:40:25,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016801100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:40:25,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:40:25,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:40:25,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:40:25,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [942445975] [2022-04-28 05:40:25,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [942445975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:40:25,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:40:25,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:40:25,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176828935] [2022-04-28 05:40:25,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:40:25,662 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-04-28 05:40:25,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:40:25,662 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:40:25,699 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 05:40:25,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:40:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:25,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:40:25,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:40:25,700 INFO L87 Difference]: Start difference. First operand 229 states and 306 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:40:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:26,443 INFO L93 Difference]: Finished difference Result 371 states and 532 transitions. [2022-04-28 05:40:26,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:40:26,443 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-04-28 05:40:26,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:40:26,443 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:40:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-04-28 05:40:26,444 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:40:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-04-28 05:40:26,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 110 transitions. [2022-04-28 05:40:26,524 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 05:40:26,529 INFO L225 Difference]: With dead ends: 371 [2022-04-28 05:40:26,529 INFO L226 Difference]: Without dead ends: 291 [2022-04-28 05:40:26,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 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 05:40:26,530 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:40:26,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 172 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:40:26,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-04-28 05:40:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 257. [2022-04-28 05:40:26,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:40:26,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:40:26,951 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:40:26,951 INFO L87 Difference]: Start difference. First operand 291 states. Second operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:40:26,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:26,957 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2022-04-28 05:40:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 403 transitions. [2022-04-28 05:40:26,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:26,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:26,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 291 states. [2022-04-28 05:40:26,958 INFO L87 Difference]: Start difference. First operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 291 states. [2022-04-28 05:40:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:26,965 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2022-04-28 05:40:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 403 transitions. [2022-04-28 05:40:26,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:26,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:26,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:40:26,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:40:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:40:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 348 transitions. [2022-04-28 05:40:26,971 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 348 transitions. Word has length 87 [2022-04-28 05:40:26,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:40:26,971 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 348 transitions. [2022-04-28 05:40:26,971 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:40:26,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 348 transitions. [2022-04-28 05:40:27,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 348 edges. 348 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:27,364 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 348 transitions. [2022-04-28 05:40:27,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 05:40:27,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:40:27,365 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 2, 2, 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 05:40:27,390 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 05:40:27,582 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 05:40:27,583 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:40:27,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:40:27,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1175887352, now seen corresponding path program 1 times [2022-04-28 05:40:27,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:27,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2094589656] [2022-04-28 05:40:27,583 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:40:27,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1175887352, now seen corresponding path program 2 times [2022-04-28 05:40:27,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:40:27,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567208701] [2022-04-28 05:40:27,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:40:27,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:40:27,592 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:40:27,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1709202166] [2022-04-28 05:40:27,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:40:27,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:40:27,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:40:27,595 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 05:40:27,595 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 05:40:27,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:40:27,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:40:27,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 05:40:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:40:27,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:40:31,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {22375#true} call ULTIMATE.init(); {22375#true} is VALID [2022-04-28 05:40:31,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {22375#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);~counter~0 := 0; {22375#true} is VALID [2022-04-28 05:40:31,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:31,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22375#true} {22375#true} #98#return; {22375#true} is VALID [2022-04-28 05:40:31,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {22375#true} call #t~ret8 := main(); {22375#true} is VALID [2022-04-28 05:40:31,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {22375#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {22375#true} is VALID [2022-04-28 05:40:31,027 INFO L272 TraceCheckUtils]: 6: Hoare triple {22375#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:31,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:31,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:31,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:31,028 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22375#true} {22375#true} #78#return; {22375#true} is VALID [2022-04-28 05:40:31,028 INFO L272 TraceCheckUtils]: 11: Hoare triple {22375#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:31,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:31,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:31,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:31,028 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22375#true} {22375#true} #80#return; {22375#true} is VALID [2022-04-28 05:40:31,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {22375#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; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,028 INFO L272 TraceCheckUtils]: 17: Hoare triple {22428#(= main_~q~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:31,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:31,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:31,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:31,029 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {22375#true} {22428#(= main_~q~0 0)} #82#return; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,029 INFO L272 TraceCheckUtils]: 22: Hoare triple {22428#(= main_~q~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:31,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:31,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:31,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:31,029 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22375#true} {22428#(= main_~q~0 0)} #84#return; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {22428#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {22428#(= main_~q~0 0)} assume !!(#t~post6 < 10);havoc #t~post6; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {22428#(= main_~q~0 0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {22428#(= main_~q~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {22428#(= main_~q~0 0)} assume !!(#t~post7 < 10);havoc #t~post7; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,030 INFO L272 TraceCheckUtils]: 32: Hoare triple {22428#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:31,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:31,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:31,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:31,031 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22375#true} {22428#(= main_~q~0 0)} #86#return; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,031 INFO L272 TraceCheckUtils]: 37: Hoare triple {22428#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:31,031 INFO L290 TraceCheckUtils]: 38: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:31,031 INFO L290 TraceCheckUtils]: 39: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:31,031 INFO L290 TraceCheckUtils]: 40: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:31,032 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22375#true} {22428#(= main_~q~0 0)} #88#return; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,032 INFO L272 TraceCheckUtils]: 42: Hoare triple {22428#(= main_~q~0 0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:31,032 INFO L290 TraceCheckUtils]: 43: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:31,032 INFO L290 TraceCheckUtils]: 44: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:31,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:31,032 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22375#true} {22428#(= main_~q~0 0)} #90#return; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,032 INFO L272 TraceCheckUtils]: 47: Hoare triple {22428#(= 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)); {22375#true} is VALID [2022-04-28 05:40:31,032 INFO L290 TraceCheckUtils]: 48: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:31,033 INFO L290 TraceCheckUtils]: 49: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:31,033 INFO L290 TraceCheckUtils]: 50: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:31,033 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {22375#true} {22428#(= main_~q~0 0)} #92#return; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,033 INFO L290 TraceCheckUtils]: 52: Hoare triple {22428#(= main_~q~0 0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,033 INFO L290 TraceCheckUtils]: 53: Hoare triple {22428#(= main_~q~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {22428#(= main_~q~0 0)} assume !!(#t~post7 < 10);havoc #t~post7; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,034 INFO L272 TraceCheckUtils]: 55: Hoare triple {22428#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:31,034 INFO L290 TraceCheckUtils]: 56: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:31,034 INFO L290 TraceCheckUtils]: 57: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:31,034 INFO L290 TraceCheckUtils]: 58: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:31,034 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22375#true} {22428#(= main_~q~0 0)} #86#return; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,034 INFO L272 TraceCheckUtils]: 60: Hoare triple {22428#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:31,034 INFO L290 TraceCheckUtils]: 61: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:31,035 INFO L290 TraceCheckUtils]: 62: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:31,035 INFO L290 TraceCheckUtils]: 63: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:31,035 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22375#true} {22428#(= main_~q~0 0)} #88#return; {22428#(= main_~q~0 0)} is VALID [2022-04-28 05:40:31,035 INFO L272 TraceCheckUtils]: 65: Hoare triple {22428#(= main_~q~0 0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:31,035 INFO L290 TraceCheckUtils]: 66: Hoare triple {22375#true} ~cond := #in~cond; {22579#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:40:31,036 INFO L290 TraceCheckUtils]: 67: Hoare triple {22579#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22583#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:40:31,036 INFO L290 TraceCheckUtils]: 68: Hoare triple {22583#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22583#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:40:31,036 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {22583#(not (= |__VERIFIER_assert_#in~cond| 0))} {22428#(= main_~q~0 0)} #90#return; {22590#(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 05:40:31,036 INFO L272 TraceCheckUtils]: 70: Hoare triple {22590#(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)); {22375#true} is VALID [2022-04-28 05:40:31,037 INFO L290 TraceCheckUtils]: 71: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:31,037 INFO L290 TraceCheckUtils]: 72: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:31,037 INFO L290 TraceCheckUtils]: 73: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:31,037 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22375#true} {22590#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} #92#return; {22590#(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 05:40:31,037 INFO L290 TraceCheckUtils]: 75: Hoare triple {22590#(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); {22590#(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 05:40:31,038 INFO L290 TraceCheckUtils]: 76: Hoare triple {22590#(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; {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-28 05:40:31,038 INFO L290 TraceCheckUtils]: 77: Hoare triple {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-28 05:40:31,039 INFO L290 TraceCheckUtils]: 78: Hoare triple {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} assume !!(#t~post6 < 10);havoc #t~post6; {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-28 05:40:31,039 INFO L290 TraceCheckUtils]: 79: Hoare triple {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} assume !(0 != ~b~0); {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-28 05:40:31,039 INFO L272 TraceCheckUtils]: 80: Hoare triple {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:31,039 INFO L290 TraceCheckUtils]: 81: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:31,039 INFO L290 TraceCheckUtils]: 82: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:31,039 INFO L290 TraceCheckUtils]: 83: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:31,040 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22375#true} {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} #94#return; {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-28 05:40:31,040 INFO L272 TraceCheckUtils]: 85: Hoare triple {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} call __VERIFIER_assert((if ~p~0 * ~x~0 + ~r~0 * ~y~0 == ~a~0 then 1 else 0)); {22640#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:40:31,040 INFO L290 TraceCheckUtils]: 86: Hoare triple {22640#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22644#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:40:31,041 INFO L290 TraceCheckUtils]: 87: Hoare triple {22644#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22376#false} is VALID [2022-04-28 05:40:31,041 INFO L290 TraceCheckUtils]: 88: Hoare triple {22376#false} assume !false; {22376#false} is VALID [2022-04-28 05:40:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-04-28 05:40:31,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:40:53,873 INFO L290 TraceCheckUtils]: 88: Hoare triple {22376#false} assume !false; {22376#false} is VALID [2022-04-28 05:40:53,873 INFO L290 TraceCheckUtils]: 87: Hoare triple {22644#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22376#false} is VALID [2022-04-28 05:40:53,873 INFO L290 TraceCheckUtils]: 86: Hoare triple {22640#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22644#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:40:53,874 INFO L272 TraceCheckUtils]: 85: Hoare triple {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 + ~r~0 * ~y~0 == ~a~0 then 1 else 0)); {22640#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:40:53,874 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22375#true} {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #94#return; {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:40:53,874 INFO L290 TraceCheckUtils]: 83: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:53,875 INFO L290 TraceCheckUtils]: 82: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:53,875 INFO L290 TraceCheckUtils]: 81: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:53,875 INFO L272 TraceCheckUtils]: 80: Hoare triple {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:53,875 INFO L290 TraceCheckUtils]: 79: Hoare triple {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(0 != ~b~0); {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:40:53,875 INFO L290 TraceCheckUtils]: 78: Hoare triple {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:40:53,876 INFO L290 TraceCheckUtils]: 77: Hoare triple {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:40:53,876 INFO L290 TraceCheckUtils]: 76: Hoare triple {22688#(= 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; {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:40:53,876 INFO L290 TraceCheckUtils]: 75: Hoare triple {22688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {22688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:40:53,877 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22375#true} {22688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {22688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:40:53,877 INFO L290 TraceCheckUtils]: 73: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:53,877 INFO L290 TraceCheckUtils]: 72: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:53,877 INFO L290 TraceCheckUtils]: 71: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:53,877 INFO L272 TraceCheckUtils]: 70: Hoare triple {22688#(= 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)); {22375#true} is VALID [2022-04-28 05:40:53,878 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {22583#(not (= |__VERIFIER_assert_#in~cond| 0))} {22375#true} #90#return; {22688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:40:53,878 INFO L290 TraceCheckUtils]: 68: Hoare triple {22583#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22583#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:40:53,878 INFO L290 TraceCheckUtils]: 67: Hoare triple {22719#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22583#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:40:53,878 INFO L290 TraceCheckUtils]: 66: Hoare triple {22375#true} ~cond := #in~cond; {22719#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:40:53,878 INFO L272 TraceCheckUtils]: 65: Hoare triple {22375#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22375#true} {22375#true} #88#return; {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L290 TraceCheckUtils]: 63: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L290 TraceCheckUtils]: 62: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L290 TraceCheckUtils]: 61: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L272 TraceCheckUtils]: 60: Hoare triple {22375#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22375#true} {22375#true} #86#return; {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L290 TraceCheckUtils]: 58: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L290 TraceCheckUtils]: 57: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L290 TraceCheckUtils]: 56: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L272 TraceCheckUtils]: 55: Hoare triple {22375#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L290 TraceCheckUtils]: 54: Hoare triple {22375#true} assume !!(#t~post7 < 10);havoc #t~post7; {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L290 TraceCheckUtils]: 53: Hoare triple {22375#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L290 TraceCheckUtils]: 52: Hoare triple {22375#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {22375#true} {22375#true} #92#return; {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L290 TraceCheckUtils]: 50: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L290 TraceCheckUtils]: 49: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L290 TraceCheckUtils]: 48: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L272 TraceCheckUtils]: 47: Hoare triple {22375#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)); {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22375#true} {22375#true} #90#return; {22375#true} is VALID [2022-04-28 05:40:53,879 INFO L290 TraceCheckUtils]: 45: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L290 TraceCheckUtils]: 44: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L290 TraceCheckUtils]: 43: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L272 TraceCheckUtils]: 42: Hoare triple {22375#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22375#true} {22375#true} #88#return; {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L290 TraceCheckUtils]: 40: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L272 TraceCheckUtils]: 37: Hoare triple {22375#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22375#true} {22375#true} #86#return; {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L290 TraceCheckUtils]: 35: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L290 TraceCheckUtils]: 34: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L272 TraceCheckUtils]: 32: Hoare triple {22375#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {22375#true} assume !!(#t~post7 < 10);havoc #t~post7; {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {22375#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {22375#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {22375#true} assume !!(#t~post6 < 10);havoc #t~post6; {22375#true} is VALID [2022-04-28 05:40:53,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {22375#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22375#true} {22375#true} #84#return; {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L272 TraceCheckUtils]: 22: Hoare triple {22375#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {22375#true} {22375#true} #82#return; {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L272 TraceCheckUtils]: 17: Hoare triple {22375#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {22375#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; {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22375#true} {22375#true} #80#return; {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L272 TraceCheckUtils]: 11: Hoare triple {22375#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22375#true} {22375#true} #78#return; {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 05:40:53,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 05:40:53,882 INFO L272 TraceCheckUtils]: 6: Hoare triple {22375#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {22375#true} is VALID [2022-04-28 05:40:53,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {22375#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {22375#true} is VALID [2022-04-28 05:40:53,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {22375#true} call #t~ret8 := main(); {22375#true} is VALID [2022-04-28 05:40:53,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22375#true} {22375#true} #98#return; {22375#true} is VALID [2022-04-28 05:40:53,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 05:40:53,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {22375#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);~counter~0 := 0; {22375#true} is VALID [2022-04-28 05:40:53,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {22375#true} call ULTIMATE.init(); {22375#true} is VALID [2022-04-28 05:40:53,882 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-04-28 05:40:53,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:40:53,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567208701] [2022-04-28 05:40:53,882 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:40:53,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709202166] [2022-04-28 05:40:53,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709202166] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:40:53,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:40:53,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-28 05:40:53,883 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:40:53,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2094589656] [2022-04-28 05:40:53,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2094589656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:40:53,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:40:53,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:40:53,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049582041] [2022-04-28 05:40:53,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:40:53,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 89 [2022-04-28 05:40:53,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:40:53,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:40:53,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:53,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:40:53,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:53,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:40:53,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:40:53,920 INFO L87 Difference]: Start difference. First operand 257 states and 348 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:40:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:55,053 INFO L93 Difference]: Finished difference Result 301 states and 415 transitions. [2022-04-28 05:40:55,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:40:55,053 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 89 [2022-04-28 05:40:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:40:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:40:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-28 05:40:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:40:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-28 05:40:55,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 89 transitions. [2022-04-28 05:40:55,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:55,138 INFO L225 Difference]: With dead ends: 301 [2022-04-28 05:40:55,139 INFO L226 Difference]: Without dead ends: 297 [2022-04-28 05:40:55,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:40:55,139 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 25 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:40:55,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 226 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:40:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-28 05:40:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2022-04-28 05:40:55,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:40:55,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-28 05:40:55,615 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-28 05:40:55,615 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-28 05:40:55,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:55,621 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2022-04-28 05:40:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2022-04-28 05:40:55,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:55,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:55,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) Second operand 297 states. [2022-04-28 05:40:55,623 INFO L87 Difference]: Start difference. First operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) Second operand 297 states. [2022-04-28 05:40:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:55,629 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2022-04-28 05:40:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2022-04-28 05:40:55,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:55,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:55,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:40:55,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:40:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-28 05:40:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 404 transitions. [2022-04-28 05:40:55,636 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 404 transitions. Word has length 89 [2022-04-28 05:40:55,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:40:55,636 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 404 transitions. [2022-04-28 05:40:55,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:40:55,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 293 states and 404 transitions. [2022-04-28 05:40:56,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 404 edges. 404 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 404 transitions. [2022-04-28 05:40:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 05:40:56,121 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:40:56,121 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 2, 2, 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] [2022-04-28 05:40:56,145 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 05:40:56,343 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 05:40:56,343 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:40:56,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:40:56,344 INFO L85 PathProgramCache]: Analyzing trace with hash -201422586, now seen corresponding path program 1 times [2022-04-28 05:40:56,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:56,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1163382233] [2022-04-28 05:40:56,344 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:40:56,344 INFO L85 PathProgramCache]: Analyzing trace with hash -201422586, now seen corresponding path program 2 times [2022-04-28 05:40:56,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:40:56,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006234360] [2022-04-28 05:40:56,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:40:56,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:40:56,353 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:40:56,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [948034070] [2022-04-28 05:40:56,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:40:56,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:40:56,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:40:56,354 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 05:40:56,354 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 05:40:56,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:40:56,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:40:56,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:40:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:40:56,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:40:56,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {24706#true} call ULTIMATE.init(); {24706#true} is VALID [2022-04-28 05:40:56,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {24706#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);~counter~0 := 0; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {24714#(<= ~counter~0 0)} assume true; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24714#(<= ~counter~0 0)} {24706#true} #98#return; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {24714#(<= ~counter~0 0)} call #t~ret8 := main(); {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {24714#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,731 INFO L272 TraceCheckUtils]: 6: Hoare triple {24714#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {24714#(<= ~counter~0 0)} ~cond := #in~cond; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {24714#(<= ~counter~0 0)} assume !(0 == ~cond); {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {24714#(<= ~counter~0 0)} assume true; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,732 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24714#(<= ~counter~0 0)} {24714#(<= ~counter~0 0)} #78#return; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,733 INFO L272 TraceCheckUtils]: 11: Hoare triple {24714#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {24714#(<= ~counter~0 0)} ~cond := #in~cond; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {24714#(<= ~counter~0 0)} assume !(0 == ~cond); {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {24714#(<= ~counter~0 0)} assume true; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,734 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24714#(<= ~counter~0 0)} {24714#(<= ~counter~0 0)} #80#return; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {24714#(<= ~counter~0 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; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,734 INFO L272 TraceCheckUtils]: 17: Hoare triple {24714#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {24714#(<= ~counter~0 0)} ~cond := #in~cond; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {24714#(<= ~counter~0 0)} assume !(0 == ~cond); {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {24714#(<= ~counter~0 0)} assume true; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,735 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {24714#(<= ~counter~0 0)} {24714#(<= ~counter~0 0)} #82#return; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,736 INFO L272 TraceCheckUtils]: 22: Hoare triple {24714#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {24714#(<= ~counter~0 0)} ~cond := #in~cond; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {24714#(<= ~counter~0 0)} assume !(0 == ~cond); {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {24714#(<= ~counter~0 0)} assume true; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,737 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24714#(<= ~counter~0 0)} {24714#(<= ~counter~0 0)} #84#return; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:56,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {24714#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24793#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:56,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {24793#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {24793#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:56,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {24793#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24793#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:56,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {24793#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {24803#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,739 INFO L272 TraceCheckUtils]: 32: Hoare triple {24803#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {24803#(<= ~counter~0 2)} ~cond := #in~cond; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {24803#(<= ~counter~0 2)} assume !(0 == ~cond); {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {24803#(<= ~counter~0 2)} assume true; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,740 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24803#(<= ~counter~0 2)} {24803#(<= ~counter~0 2)} #86#return; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,741 INFO L272 TraceCheckUtils]: 37: Hoare triple {24803#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {24803#(<= ~counter~0 2)} ~cond := #in~cond; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,741 INFO L290 TraceCheckUtils]: 39: Hoare triple {24803#(<= ~counter~0 2)} assume !(0 == ~cond); {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,741 INFO L290 TraceCheckUtils]: 40: Hoare triple {24803#(<= ~counter~0 2)} assume true; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,742 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24803#(<= ~counter~0 2)} {24803#(<= ~counter~0 2)} #88#return; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,742 INFO L272 TraceCheckUtils]: 42: Hoare triple {24803#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,743 INFO L290 TraceCheckUtils]: 43: Hoare triple {24803#(<= ~counter~0 2)} ~cond := #in~cond; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {24803#(<= ~counter~0 2)} assume !(0 == ~cond); {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,743 INFO L290 TraceCheckUtils]: 45: Hoare triple {24803#(<= ~counter~0 2)} assume true; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,744 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24803#(<= ~counter~0 2)} {24803#(<= ~counter~0 2)} #90#return; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,744 INFO L272 TraceCheckUtils]: 47: Hoare triple {24803#(<= ~counter~0 2)} 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)); {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,744 INFO L290 TraceCheckUtils]: 48: Hoare triple {24803#(<= ~counter~0 2)} ~cond := #in~cond; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {24803#(<= ~counter~0 2)} assume !(0 == ~cond); {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,745 INFO L290 TraceCheckUtils]: 50: Hoare triple {24803#(<= ~counter~0 2)} assume true; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,745 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24803#(<= ~counter~0 2)} {24803#(<= ~counter~0 2)} #92#return; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,746 INFO L290 TraceCheckUtils]: 52: Hoare triple {24803#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:56,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {24803#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,746 INFO L290 TraceCheckUtils]: 54: Hoare triple {24873#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,747 INFO L272 TraceCheckUtils]: 55: Hoare triple {24873#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,747 INFO L290 TraceCheckUtils]: 56: Hoare triple {24873#(<= ~counter~0 3)} ~cond := #in~cond; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,747 INFO L290 TraceCheckUtils]: 57: Hoare triple {24873#(<= ~counter~0 3)} assume !(0 == ~cond); {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,747 INFO L290 TraceCheckUtils]: 58: Hoare triple {24873#(<= ~counter~0 3)} assume true; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,748 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24873#(<= ~counter~0 3)} {24873#(<= ~counter~0 3)} #86#return; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,748 INFO L272 TraceCheckUtils]: 60: Hoare triple {24873#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,749 INFO L290 TraceCheckUtils]: 61: Hoare triple {24873#(<= ~counter~0 3)} ~cond := #in~cond; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,749 INFO L290 TraceCheckUtils]: 62: Hoare triple {24873#(<= ~counter~0 3)} assume !(0 == ~cond); {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,749 INFO L290 TraceCheckUtils]: 63: Hoare triple {24873#(<= ~counter~0 3)} assume true; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,750 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24873#(<= ~counter~0 3)} {24873#(<= ~counter~0 3)} #88#return; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,750 INFO L272 TraceCheckUtils]: 65: Hoare triple {24873#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,750 INFO L290 TraceCheckUtils]: 66: Hoare triple {24873#(<= ~counter~0 3)} ~cond := #in~cond; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,751 INFO L290 TraceCheckUtils]: 67: Hoare triple {24873#(<= ~counter~0 3)} assume !(0 == ~cond); {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {24873#(<= ~counter~0 3)} assume true; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,754 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {24873#(<= ~counter~0 3)} {24873#(<= ~counter~0 3)} #90#return; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,754 INFO L272 TraceCheckUtils]: 70: Hoare triple {24873#(<= ~counter~0 3)} 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)); {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,755 INFO L290 TraceCheckUtils]: 71: Hoare triple {24873#(<= ~counter~0 3)} ~cond := #in~cond; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,755 INFO L290 TraceCheckUtils]: 72: Hoare triple {24873#(<= ~counter~0 3)} assume !(0 == ~cond); {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,755 INFO L290 TraceCheckUtils]: 73: Hoare triple {24873#(<= ~counter~0 3)} assume true; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,756 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24873#(<= ~counter~0 3)} {24873#(<= ~counter~0 3)} #92#return; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,756 INFO L290 TraceCheckUtils]: 75: Hoare triple {24873#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,756 INFO L290 TraceCheckUtils]: 76: Hoare triple {24873#(<= ~counter~0 3)} ~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; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:56,757 INFO L290 TraceCheckUtils]: 77: Hoare triple {24873#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24946#(<= ~counter~0 4)} is VALID [2022-04-28 05:40:56,757 INFO L290 TraceCheckUtils]: 78: Hoare triple {24946#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {24946#(<= ~counter~0 4)} is VALID [2022-04-28 05:40:56,757 INFO L290 TraceCheckUtils]: 79: Hoare triple {24946#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24946#(<= ~counter~0 4)} is VALID [2022-04-28 05:40:56,757 INFO L290 TraceCheckUtils]: 80: Hoare triple {24946#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24956#(<= |main_#t~post7| 4)} is VALID [2022-04-28 05:40:56,758 INFO L290 TraceCheckUtils]: 81: Hoare triple {24956#(<= |main_#t~post7| 4)} assume !(#t~post7 < 10);havoc #t~post7; {24707#false} is VALID [2022-04-28 05:40:56,758 INFO L290 TraceCheckUtils]: 82: Hoare triple {24707#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; {24707#false} is VALID [2022-04-28 05:40:56,758 INFO L290 TraceCheckUtils]: 83: Hoare triple {24707#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24707#false} is VALID [2022-04-28 05:40:56,758 INFO L290 TraceCheckUtils]: 84: Hoare triple {24707#false} assume !(#t~post6 < 10);havoc #t~post6; {24707#false} is VALID [2022-04-28 05:40:56,758 INFO L272 TraceCheckUtils]: 85: Hoare triple {24707#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {24707#false} is VALID [2022-04-28 05:40:56,758 INFO L290 TraceCheckUtils]: 86: Hoare triple {24707#false} ~cond := #in~cond; {24707#false} is VALID [2022-04-28 05:40:56,758 INFO L290 TraceCheckUtils]: 87: Hoare triple {24707#false} assume 0 == ~cond; {24707#false} is VALID [2022-04-28 05:40:56,758 INFO L290 TraceCheckUtils]: 88: Hoare triple {24707#false} assume !false; {24707#false} is VALID [2022-04-28 05:40:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 21 proven. 78 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 05:40:56,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:40:57,106 INFO L290 TraceCheckUtils]: 88: Hoare triple {24707#false} assume !false; {24707#false} is VALID [2022-04-28 05:40:57,106 INFO L290 TraceCheckUtils]: 87: Hoare triple {24707#false} assume 0 == ~cond; {24707#false} is VALID [2022-04-28 05:40:57,106 INFO L290 TraceCheckUtils]: 86: Hoare triple {24707#false} ~cond := #in~cond; {24707#false} is VALID [2022-04-28 05:40:57,106 INFO L272 TraceCheckUtils]: 85: Hoare triple {24707#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {24707#false} is VALID [2022-04-28 05:40:57,106 INFO L290 TraceCheckUtils]: 84: Hoare triple {24707#false} assume !(#t~post6 < 10);havoc #t~post6; {24707#false} is VALID [2022-04-28 05:40:57,106 INFO L290 TraceCheckUtils]: 83: Hoare triple {24707#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24707#false} is VALID [2022-04-28 05:40:57,106 INFO L290 TraceCheckUtils]: 82: Hoare triple {24707#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; {24707#false} is VALID [2022-04-28 05:40:57,106 INFO L290 TraceCheckUtils]: 81: Hoare triple {25002#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {24707#false} is VALID [2022-04-28 05:40:57,107 INFO L290 TraceCheckUtils]: 80: Hoare triple {25006#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25002#(< |main_#t~post7| 10)} is VALID [2022-04-28 05:40:57,107 INFO L290 TraceCheckUtils]: 79: Hoare triple {25006#(< ~counter~0 10)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {25006#(< ~counter~0 10)} is VALID [2022-04-28 05:40:57,107 INFO L290 TraceCheckUtils]: 78: Hoare triple {25006#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {25006#(< ~counter~0 10)} is VALID [2022-04-28 05:40:57,108 INFO L290 TraceCheckUtils]: 77: Hoare triple {25016#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25006#(< ~counter~0 10)} is VALID [2022-04-28 05:40:57,108 INFO L290 TraceCheckUtils]: 76: Hoare triple {25016#(< ~counter~0 9)} ~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; {25016#(< ~counter~0 9)} is VALID [2022-04-28 05:40:57,109 INFO L290 TraceCheckUtils]: 75: Hoare triple {25016#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {25016#(< ~counter~0 9)} is VALID [2022-04-28 05:40:57,109 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24706#true} {25016#(< ~counter~0 9)} #92#return; {25016#(< ~counter~0 9)} is VALID [2022-04-28 05:40:57,109 INFO L290 TraceCheckUtils]: 73: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 05:40:57,109 INFO L290 TraceCheckUtils]: 72: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 05:40:57,109 INFO L290 TraceCheckUtils]: 71: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 05:40:57,109 INFO L272 TraceCheckUtils]: 70: Hoare triple {25016#(< ~counter~0 9)} 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)); {24706#true} is VALID [2022-04-28 05:40:57,110 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {24706#true} {25016#(< ~counter~0 9)} #90#return; {25016#(< ~counter~0 9)} is VALID [2022-04-28 05:40:57,110 INFO L290 TraceCheckUtils]: 68: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 05:40:57,110 INFO L290 TraceCheckUtils]: 67: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 05:40:57,110 INFO L290 TraceCheckUtils]: 66: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 05:40:57,110 INFO L272 TraceCheckUtils]: 65: Hoare triple {25016#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24706#true} is VALID [2022-04-28 05:40:57,111 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24706#true} {25016#(< ~counter~0 9)} #88#return; {25016#(< ~counter~0 9)} is VALID [2022-04-28 05:40:57,111 INFO L290 TraceCheckUtils]: 63: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 05:40:57,111 INFO L290 TraceCheckUtils]: 62: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 05:40:57,111 INFO L290 TraceCheckUtils]: 61: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 05:40:57,111 INFO L272 TraceCheckUtils]: 60: Hoare triple {25016#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24706#true} is VALID [2022-04-28 05:40:57,112 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24706#true} {25016#(< ~counter~0 9)} #86#return; {25016#(< ~counter~0 9)} is VALID [2022-04-28 05:40:57,112 INFO L290 TraceCheckUtils]: 58: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 05:40:57,112 INFO L290 TraceCheckUtils]: 57: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 05:40:57,112 INFO L290 TraceCheckUtils]: 56: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 05:40:57,112 INFO L272 TraceCheckUtils]: 55: Hoare triple {25016#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24706#true} is VALID [2022-04-28 05:40:57,112 INFO L290 TraceCheckUtils]: 54: Hoare triple {25016#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {25016#(< ~counter~0 9)} is VALID [2022-04-28 05:40:57,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {25089#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25016#(< ~counter~0 9)} is VALID [2022-04-28 05:40:57,113 INFO L290 TraceCheckUtils]: 52: Hoare triple {25089#(< ~counter~0 8)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {25089#(< ~counter~0 8)} is VALID [2022-04-28 05:40:57,114 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24706#true} {25089#(< ~counter~0 8)} #92#return; {25089#(< ~counter~0 8)} is VALID [2022-04-28 05:40:57,114 INFO L290 TraceCheckUtils]: 50: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 05:40:57,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 05:40:57,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 05:40:57,114 INFO L272 TraceCheckUtils]: 47: Hoare triple {25089#(< ~counter~0 8)} 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)); {24706#true} is VALID [2022-04-28 05:40:57,115 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24706#true} {25089#(< ~counter~0 8)} #90#return; {25089#(< ~counter~0 8)} is VALID [2022-04-28 05:40:57,115 INFO L290 TraceCheckUtils]: 45: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 05:40:57,115 INFO L290 TraceCheckUtils]: 44: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 05:40:57,115 INFO L290 TraceCheckUtils]: 43: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 05:40:57,115 INFO L272 TraceCheckUtils]: 42: Hoare triple {25089#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24706#true} is VALID [2022-04-28 05:40:57,116 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24706#true} {25089#(< ~counter~0 8)} #88#return; {25089#(< ~counter~0 8)} is VALID [2022-04-28 05:40:57,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 05:40:57,116 INFO L290 TraceCheckUtils]: 39: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 05:40:57,116 INFO L290 TraceCheckUtils]: 38: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 05:40:57,116 INFO L272 TraceCheckUtils]: 37: Hoare triple {25089#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24706#true} is VALID [2022-04-28 05:40:57,116 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24706#true} {25089#(< ~counter~0 8)} #86#return; {25089#(< ~counter~0 8)} is VALID [2022-04-28 05:40:57,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 05:40:57,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 05:40:57,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 05:40:57,117 INFO L272 TraceCheckUtils]: 32: Hoare triple {25089#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24706#true} is VALID [2022-04-28 05:40:57,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {25089#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {25089#(< ~counter~0 8)} is VALID [2022-04-28 05:40:57,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {25159#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25089#(< ~counter~0 8)} is VALID [2022-04-28 05:40:57,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {25159#(< ~counter~0 7)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {25159#(< ~counter~0 7)} is VALID [2022-04-28 05:40:57,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {25159#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {25159#(< ~counter~0 7)} is VALID [2022-04-28 05:40:57,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {25169#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25159#(< ~counter~0 7)} is VALID [2022-04-28 05:40:57,119 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24706#true} {25169#(< ~counter~0 6)} #84#return; {25169#(< ~counter~0 6)} is VALID [2022-04-28 05:40:57,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 05:40:57,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 05:40:57,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 05:40:57,119 INFO L272 TraceCheckUtils]: 22: Hoare triple {25169#(< ~counter~0 6)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {24706#true} is VALID [2022-04-28 05:40:57,120 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {24706#true} {25169#(< ~counter~0 6)} #82#return; {25169#(< ~counter~0 6)} is VALID [2022-04-28 05:40:57,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 05:40:57,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 05:40:57,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 05:40:57,120 INFO L272 TraceCheckUtils]: 17: Hoare triple {25169#(< ~counter~0 6)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {24706#true} is VALID [2022-04-28 05:40:57,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {25169#(< ~counter~0 6)} ~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; {25169#(< ~counter~0 6)} is VALID [2022-04-28 05:40:57,121 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24706#true} {25169#(< ~counter~0 6)} #80#return; {25169#(< ~counter~0 6)} is VALID [2022-04-28 05:40:57,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 05:40:57,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 05:40:57,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 05:40:57,121 INFO L272 TraceCheckUtils]: 11: Hoare triple {25169#(< ~counter~0 6)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24706#true} is VALID [2022-04-28 05:40:57,121 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24706#true} {25169#(< ~counter~0 6)} #78#return; {25169#(< ~counter~0 6)} is VALID [2022-04-28 05:40:57,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 05:40:57,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 05:40:57,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 05:40:57,122 INFO L272 TraceCheckUtils]: 6: Hoare triple {25169#(< ~counter~0 6)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24706#true} is VALID [2022-04-28 05:40:57,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {25169#(< ~counter~0 6)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {25169#(< ~counter~0 6)} is VALID [2022-04-28 05:40:57,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {25169#(< ~counter~0 6)} call #t~ret8 := main(); {25169#(< ~counter~0 6)} is VALID [2022-04-28 05:40:57,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25169#(< ~counter~0 6)} {24706#true} #98#return; {25169#(< ~counter~0 6)} is VALID [2022-04-28 05:40:57,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {25169#(< ~counter~0 6)} assume true; {25169#(< ~counter~0 6)} is VALID [2022-04-28 05:40:57,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {24706#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);~counter~0 := 0; {25169#(< ~counter~0 6)} is VALID [2022-04-28 05:40:57,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {24706#true} call ULTIMATE.init(); {24706#true} is VALID [2022-04-28 05:40:57,124 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 05:40:57,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:40:57,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006234360] [2022-04-28 05:40:57,124 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:40:57,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948034070] [2022-04-28 05:40:57,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948034070] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:40:57,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:40:57,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 05:40:57,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:40:57,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1163382233] [2022-04-28 05:40:57,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1163382233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:40:57,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:40:57,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:40:57,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928585731] [2022-04-28 05:40:57,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:40:57,125 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 89 [2022-04-28 05:40:57,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:40:57,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:57,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:57,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:40:57,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:57,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:40:57,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:40:57,175 INFO L87 Difference]: Start difference. First operand 293 states and 404 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:57,967 INFO L93 Difference]: Finished difference Result 463 states and 647 transitions. [2022-04-28 05:40:57,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:40:57,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 89 [2022-04-28 05:40:57,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:40:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-04-28 05:40:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-04-28 05:40:57,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 133 transitions. [2022-04-28 05:40:58,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:58,076 INFO L225 Difference]: With dead ends: 463 [2022-04-28 05:40:58,076 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 05:40:58,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2022-04-28 05:40:58,078 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 44 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:40:58,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 171 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:40:58,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 05:40:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2022-04-28 05:40:58,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:40:58,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:40:58,612 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:40:58,612 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:40:58,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:58,618 INFO L93 Difference]: Finished difference Result 329 states and 435 transitions. [2022-04-28 05:40:58,618 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 435 transitions. [2022-04-28 05:40:58,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:58,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:58,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 329 states. [2022-04-28 05:40:58,620 INFO L87 Difference]: Start difference. First operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 329 states. [2022-04-28 05:40:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:58,625 INFO L93 Difference]: Finished difference Result 329 states and 435 transitions. [2022-04-28 05:40:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 435 transitions. [2022-04-28 05:40:58,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:58,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:58,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:40:58,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:40:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:40:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 433 transitions. [2022-04-28 05:40:58,634 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 433 transitions. Word has length 89 [2022-04-28 05:40:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:40:58,634 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 433 transitions. [2022-04-28 05:40:58,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:58,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 433 transitions. [2022-04-28 05:40:59,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 433 transitions. [2022-04-28 05:40:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 05:40:59,186 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:40:59,186 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:40:59,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 05:40:59,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 05:40:59,387 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:40:59,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:40:59,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 1 times [2022-04-28 05:40:59,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:59,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1881288589] [2022-04-28 05:40:59,388 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:40:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 2 times [2022-04-28 05:40:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:40:59,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728848172] [2022-04-28 05:40:59,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:40:59,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:40:59,401 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:40:59,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1557046415] [2022-04-28 05:40:59,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:40:59,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:40:59,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:40:59,402 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:40:59,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 05:40:59,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:40:59,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:40:59,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-28 05:40:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:40:59,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:41:03,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {27497#true} call ULTIMATE.init(); {27497#true} is VALID [2022-04-28 05:41:03,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {27497#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);~counter~0 := 0; {27497#true} is VALID [2022-04-28 05:41:03,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 05:41:03,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27497#true} {27497#true} #98#return; {27497#true} is VALID [2022-04-28 05:41:03,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {27497#true} call #t~ret8 := main(); {27497#true} is VALID [2022-04-28 05:41:03,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {27497#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {27497#true} is VALID [2022-04-28 05:41:03,394 INFO L272 TraceCheckUtils]: 6: Hoare triple {27497#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {27497#true} is VALID [2022-04-28 05:41:03,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 05:41:03,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 05:41:03,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 05:41:03,395 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27497#true} {27497#true} #78#return; {27497#true} is VALID [2022-04-28 05:41:03,395 INFO L272 TraceCheckUtils]: 11: Hoare triple {27497#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {27497#true} is VALID [2022-04-28 05:41:03,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {27497#true} ~cond := #in~cond; {27538#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:41:03,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {27538#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {27542#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:41:03,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {27542#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {27542#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:41:03,396 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {27542#(not (= |assume_abort_if_not_#in~cond| 0))} {27497#true} #80#return; {27549#(<= 1 main_~y~0)} is VALID [2022-04-28 05:41:03,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {27549#(<= 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; {27553#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:03,396 INFO L272 TraceCheckUtils]: 17: Hoare triple {27553#(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) (<= 1 main_~y~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)); {27497#true} is VALID [2022-04-28 05:41:03,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 05:41:03,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 05:41:03,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 05:41:03,397 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {27497#true} {27553#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #82#return; {27553#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:03,397 INFO L272 TraceCheckUtils]: 22: Hoare triple {27553#(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) (<= 1 main_~y~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)); {27497#true} is VALID [2022-04-28 05:41:03,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 05:41:03,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 05:41:03,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 05:41:03,398 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27497#true} {27553#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #84#return; {27553#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:03,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {27553#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27553#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:03,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {27553#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 10);havoc #t~post6; {27553#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:03,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {27553#(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) (<= 1 main_~y~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; {27593#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:03,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {27593#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27593#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:03,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {27593#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(#t~post7 < 10);havoc #t~post7; {27593#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:03,400 INFO L272 TraceCheckUtils]: 32: Hoare triple {27593#(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) (<= 1 main_~y~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)); {27497#true} is VALID [2022-04-28 05:41:03,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 05:41:03,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 05:41:03,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 05:41:03,401 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {27497#true} {27593#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #86#return; {27593#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:03,401 INFO L272 TraceCheckUtils]: 37: Hoare triple {27593#(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) (<= 1 main_~y~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)); {27497#true} is VALID [2022-04-28 05:41:03,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 05:41:03,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 05:41:03,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 05:41:03,402 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {27497#true} {27593#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #88#return; {27593#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:03,402 INFO L272 TraceCheckUtils]: 42: Hoare triple {27593#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27497#true} is VALID [2022-04-28 05:41:03,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 05:41:03,402 INFO L290 TraceCheckUtils]: 44: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 05:41:03,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 05:41:03,402 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {27497#true} {27593#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #90#return; {27593#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:03,402 INFO L272 TraceCheckUtils]: 47: Hoare triple {27593#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~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)); {27497#true} is VALID [2022-04-28 05:41:03,402 INFO L290 TraceCheckUtils]: 48: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 05:41:03,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 05:41:03,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 05:41:03,403 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {27497#true} {27593#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #92#return; {27593#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:03,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {27593#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {27663#(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_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:03,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {27663#(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_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27663#(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_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:03,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {27663#(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_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(#t~post7 < 10);havoc #t~post7; {27663#(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_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:03,405 INFO L272 TraceCheckUtils]: 55: Hoare triple {27663#(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_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~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)); {27497#true} is VALID [2022-04-28 05:41:03,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {27497#true} ~cond := #in~cond; {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:41:03,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:41:03,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:41:03,407 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} {27663#(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_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #86#return; {27687#(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_~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:41:03,407 INFO L272 TraceCheckUtils]: 60: Hoare triple {27687#(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_~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) (<= 1 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)); {27497#true} is VALID [2022-04-28 05:41:03,407 INFO L290 TraceCheckUtils]: 61: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 05:41:03,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 05:41:03,407 INFO L290 TraceCheckUtils]: 63: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 05:41:03,408 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {27497#true} {27687#(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_~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {27687#(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_~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:41:03,408 INFO L272 TraceCheckUtils]: 65: Hoare triple {27687#(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_~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) (<= 1 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)); {27497#true} is VALID [2022-04-28 05:41:03,408 INFO L290 TraceCheckUtils]: 66: Hoare triple {27497#true} ~cond := #in~cond; {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:41:03,408 INFO L290 TraceCheckUtils]: 67: Hoare triple {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:41:03,409 INFO L290 TraceCheckUtils]: 68: Hoare triple {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:41:03,409 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} {27687#(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_~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {27687#(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_~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:41:03,409 INFO L272 TraceCheckUtils]: 70: Hoare triple {27687#(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_~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) (<= 1 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)); {27497#true} is VALID [2022-04-28 05:41:03,410 INFO L290 TraceCheckUtils]: 71: Hoare triple {27497#true} ~cond := #in~cond; {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:41:03,410 INFO L290 TraceCheckUtils]: 72: Hoare triple {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:41:03,410 INFO L290 TraceCheckUtils]: 73: Hoare triple {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:41:03,411 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} {27687#(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_~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #92#return; {27687#(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_~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:41:03,411 INFO L290 TraceCheckUtils]: 75: Hoare triple {27687#(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_~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {27736#(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))))} is VALID [2022-04-28 05:41:03,412 INFO L290 TraceCheckUtils]: 76: Hoare triple {27736#(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))))} ~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; {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:03,412 INFO L290 TraceCheckUtils]: 77: Hoare triple {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:03,413 INFO L290 TraceCheckUtils]: 78: Hoare triple {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !!(#t~post6 < 10);havoc #t~post6; {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:03,413 INFO L290 TraceCheckUtils]: 79: Hoare triple {27740#(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_~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; {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:03,414 INFO L290 TraceCheckUtils]: 80: Hoare triple {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:03,414 INFO L290 TraceCheckUtils]: 81: Hoare triple {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !!(#t~post7 < 10);havoc #t~post7; {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:03,414 INFO L272 TraceCheckUtils]: 82: Hoare triple {27740#(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_~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)); {27497#true} is VALID [2022-04-28 05:41:03,414 INFO L290 TraceCheckUtils]: 83: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 05:41:03,414 INFO L290 TraceCheckUtils]: 84: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 05:41:03,414 INFO L290 TraceCheckUtils]: 85: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 05:41:03,415 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {27497#true} {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #86#return; {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:03,415 INFO L272 TraceCheckUtils]: 87: Hoare triple {27740#(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_~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)); {27497#true} is VALID [2022-04-28 05:41:03,415 INFO L290 TraceCheckUtils]: 88: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 05:41:03,415 INFO L290 TraceCheckUtils]: 89: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 05:41:03,415 INFO L290 TraceCheckUtils]: 90: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 05:41:03,416 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {27497#true} {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #88#return; {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:03,416 INFO L272 TraceCheckUtils]: 92: Hoare triple {27740#(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_~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)); {27497#true} is VALID [2022-04-28 05:41:03,416 INFO L290 TraceCheckUtils]: 93: Hoare triple {27497#true} ~cond := #in~cond; {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:41:03,416 INFO L290 TraceCheckUtils]: 94: Hoare triple {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:41:03,416 INFO L290 TraceCheckUtils]: 95: Hoare triple {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:41:03,417 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #90#return; {27801#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ 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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:03,419 INFO L272 TraceCheckUtils]: 97: Hoare triple {27801#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ 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_~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)); {27805#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:41:03,423 INFO L290 TraceCheckUtils]: 98: Hoare triple {27805#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27809#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:41:03,424 INFO L290 TraceCheckUtils]: 99: Hoare triple {27809#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27498#false} is VALID [2022-04-28 05:41:03,424 INFO L290 TraceCheckUtils]: 100: Hoare triple {27498#false} assume !false; {27498#false} is VALID [2022-04-28 05:41:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 84 proven. 53 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-04-28 05:41:03,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:41:44,358 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:42:18,826 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= c_main_~x~0 0)) (.cse3 (+ (* c_main_~q~0 c_main_~x~0 c_main_~k~0) c_main_~c~0 (* (- 1) c_main_~r~0 c_main_~y~0) (* c_main_~s~0 c_main_~y~0 c_main_~k~0)))) (and (or .cse0 (let ((.cse2 (+ c_main_~r~0 (* (- 1) (* c_main_~s~0 c_main_~k~0)))) (.cse1 (+ (div .cse3 c_main_~x~0) (* (- 1) c_main_~q~0 c_main_~k~0)))) (= (+ (* .cse1 c_main_~x~0) (* .cse2 c_main_~y~0) (* c_main_~c~0 c_main_~y~0)) (+ c_main_~c~0 (* c_main_~yy~0 .cse2) (* c_main_~xy~0 .cse1)))) (not (= (mod .cse3 c_main_~x~0) 0))) (or (forall ((main_~p~0 Int)) (let ((.cse5 (+ c_main_~r~0 (* (- 1) (* c_main_~s~0 c_main_~k~0)))) (.cse4 (+ main_~p~0 (* (- 1) c_main_~q~0 c_main_~k~0)))) (= (+ c_main_~c~0 (* c_main_~xy~0 .cse4) (* c_main_~yy~0 .cse5)) (+ (* .cse5 c_main_~y~0) (* .cse4 c_main_~x~0) (* c_main_~c~0 c_main_~y~0))))) (not .cse0) (not (= .cse3 0))))) (not (= (+ (* c_main_~q~0 c_main_~x~0) (* c_main_~s~0 c_main_~y~0) (* c_main_~b~0 c_main_~y~0)) (+ (* c_main_~q~0 c_main_~xy~0) (* c_main_~yy~0 c_main_~s~0) c_main_~b~0))) (<= c_main_~b~0 c_main_~c~0)) is different from true [2022-04-28 05:42:18,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:42:18,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728848172] [2022-04-28 05:42:18,827 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:42:18,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557046415] [2022-04-28 05:42:18,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557046415] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 05:42:18,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:42:18,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 05:42:18,828 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:42:18,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1881288589] [2022-04-28 05:42:18,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1881288589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:42:18,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:42:18,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 05:42:18,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569217265] [2022-04-28 05:42:18,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:42:18,828 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 101 [2022-04-28 05:42:18,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:42:18,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-28 05:42:18,910 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 05:42:18,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 05:42:18,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:42:18,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 05:42:18,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=339, Unknown=1, NotChecked=38, Total=462 [2022-04-28 05:42:18,911 INFO L87 Difference]: Start difference. First operand 327 states and 433 transitions. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-28 05:42:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:33,786 INFO L93 Difference]: Finished difference Result 339 states and 443 transitions. [2022-04-28 05:42:33,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 05:42:33,786 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 101 [2022-04-28 05:42:33,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:42:33,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-28 05:42:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-28 05:42:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-28 05:42:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-28 05:42:33,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 118 transitions. [2022-04-28 05:42:33,946 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 05:42:33,952 INFO L225 Difference]: With dead ends: 339 [2022-04-28 05:42:33,952 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 05:42:33,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=112, Invalid=491, Unknown=1, NotChecked=46, Total=650 [2022-04-28 05:42:33,953 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 57 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 05:42:33,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 315 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 05:42:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 05:42:34,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-04-28 05:42:34,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:42:34,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:34,502 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:34,502 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:34,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:34,508 INFO L93 Difference]: Finished difference Result 337 states and 441 transitions. [2022-04-28 05:42:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2022-04-28 05:42:34,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:42:34,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:42:34,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 337 states. [2022-04-28 05:42:34,509 INFO L87 Difference]: Start difference. First operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 337 states. [2022-04-28 05:42:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:34,515 INFO L93 Difference]: Finished difference Result 337 states and 441 transitions. [2022-04-28 05:42:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2022-04-28 05:42:34,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:42:34,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:42:34,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:42:34,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:42:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 439 transitions. [2022-04-28 05:42:34,523 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 439 transitions. Word has length 101 [2022-04-28 05:42:34,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:42:34,524 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 439 transitions. [2022-04-28 05:42:34,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-28 05:42:34,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 335 states and 439 transitions. [2022-04-28 05:42:35,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:42:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2022-04-28 05:42:35,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 05:42:35,144 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:42:35,144 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:42:35,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 05:42:35,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:42:35,345 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:42:35,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:42:35,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1524088572, now seen corresponding path program 5 times [2022-04-28 05:42:35,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:42:35,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [81021975] [2022-04-28 05:42:35,346 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:42:35,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1524088572, now seen corresponding path program 6 times [2022-04-28 05:42:35,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:42:35,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345688056] [2022-04-28 05:42:35,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:42:35,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:42:35,362 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:42:35,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [335310191] [2022-04-28 05:42:35,362 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:42:35,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:42:35,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:42:35,364 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:42:35,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 05:42:35,435 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 05:42:35,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:42:35,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 05:42:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:42:35,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:42:35,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {29932#true} call ULTIMATE.init(); {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {29932#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);~counter~0 := 0; {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29932#true} {29932#true} #98#return; {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {29932#true} call #t~ret8 := main(); {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {29932#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {29932#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29932#true} {29932#true} #78#return; {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L272 TraceCheckUtils]: 11: Hoare triple {29932#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29932#true} {29932#true} #80#return; {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {29932#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; {29932#true} is VALID [2022-04-28 05:42:35,679 INFO L272 TraceCheckUtils]: 17: Hoare triple {29932#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {29932#true} {29932#true} #82#return; {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L272 TraceCheckUtils]: 22: Hoare triple {29932#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29932#true} {29932#true} #84#return; {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {29932#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {29932#true} assume !!(#t~post6 < 10);havoc #t~post6; {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {29932#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L272 TraceCheckUtils]: 32: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:35,680 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29932#true} {29932#true} #86#return; {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L272 TraceCheckUtils]: 37: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29932#true} {29932#true} #88#return; {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L272 TraceCheckUtils]: 42: Hoare triple {29932#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L290 TraceCheckUtils]: 43: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L290 TraceCheckUtils]: 44: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L290 TraceCheckUtils]: 45: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29932#true} {29932#true} #90#return; {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L272 TraceCheckUtils]: 47: Hoare triple {29932#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)); {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L290 TraceCheckUtils]: 48: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L290 TraceCheckUtils]: 49: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L290 TraceCheckUtils]: 50: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {29932#true} {29932#true} #92#return; {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L290 TraceCheckUtils]: 52: Hoare triple {29932#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L290 TraceCheckUtils]: 53: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L290 TraceCheckUtils]: 54: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-28 05:42:35,681 INFO L272 TraceCheckUtils]: 55: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L290 TraceCheckUtils]: 56: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L290 TraceCheckUtils]: 57: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L290 TraceCheckUtils]: 58: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29932#true} {29932#true} #86#return; {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L272 TraceCheckUtils]: 60: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L290 TraceCheckUtils]: 61: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L290 TraceCheckUtils]: 62: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L290 TraceCheckUtils]: 63: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29932#true} {29932#true} #88#return; {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L272 TraceCheckUtils]: 65: Hoare triple {29932#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L290 TraceCheckUtils]: 66: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L290 TraceCheckUtils]: 67: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L290 TraceCheckUtils]: 68: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {29932#true} {29932#true} #90#return; {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L272 TraceCheckUtils]: 70: Hoare triple {29932#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)); {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L290 TraceCheckUtils]: 71: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L290 TraceCheckUtils]: 72: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L290 TraceCheckUtils]: 73: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29932#true} {29932#true} #92#return; {29932#true} is VALID [2022-04-28 05:42:35,682 INFO L290 TraceCheckUtils]: 75: Hoare triple {29932#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29932#true} is VALID [2022-04-28 05:42:35,683 INFO L290 TraceCheckUtils]: 76: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-28 05:42:35,683 INFO L290 TraceCheckUtils]: 77: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-28 05:42:35,683 INFO L272 TraceCheckUtils]: 78: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:35,683 INFO L290 TraceCheckUtils]: 79: Hoare triple {29932#true} ~cond := #in~cond; {30174#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:42:35,683 INFO L290 TraceCheckUtils]: 80: Hoare triple {30174#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:42:35,683 INFO L290 TraceCheckUtils]: 81: Hoare triple {30178#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:42:35,684 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30178#(not (= |__VERIFIER_assert_#in~cond| 0))} {29932#true} #86#return; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:35,684 INFO L272 TraceCheckUtils]: 83: Hoare triple {30185#(= 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)); {29932#true} is VALID [2022-04-28 05:42:35,684 INFO L290 TraceCheckUtils]: 84: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:35,684 INFO L290 TraceCheckUtils]: 85: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:35,684 INFO L290 TraceCheckUtils]: 86: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:35,685 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {29932#true} {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:35,685 INFO L272 TraceCheckUtils]: 88: Hoare triple {30185#(= 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)); {29932#true} is VALID [2022-04-28 05:42:35,685 INFO L290 TraceCheckUtils]: 89: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:35,685 INFO L290 TraceCheckUtils]: 90: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:35,685 INFO L290 TraceCheckUtils]: 91: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:35,686 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {29932#true} {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:35,686 INFO L272 TraceCheckUtils]: 93: Hoare triple {30185#(= 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)); {29932#true} is VALID [2022-04-28 05:42:35,686 INFO L290 TraceCheckUtils]: 94: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:35,686 INFO L290 TraceCheckUtils]: 95: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:35,686 INFO L290 TraceCheckUtils]: 96: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:35,686 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {29932#true} {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:35,688 INFO L290 TraceCheckUtils]: 98: Hoare triple {30185#(= 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; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:35,688 INFO L290 TraceCheckUtils]: 99: Hoare triple {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:35,689 INFO L290 TraceCheckUtils]: 100: Hoare triple {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:35,689 INFO L272 TraceCheckUtils]: 101: Hoare triple {30185#(= 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)); {30243#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:42:35,689 INFO L290 TraceCheckUtils]: 102: Hoare triple {30243#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30247#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:42:35,690 INFO L290 TraceCheckUtils]: 103: Hoare triple {30247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29933#false} is VALID [2022-04-28 05:42:35,690 INFO L290 TraceCheckUtils]: 104: Hoare triple {29933#false} assume !false; {29933#false} is VALID [2022-04-28 05:42:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 64 proven. 10 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-28 05:42:35,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:42:44,452 INFO L290 TraceCheckUtils]: 104: Hoare triple {29933#false} assume !false; {29933#false} is VALID [2022-04-28 05:42:44,452 INFO L290 TraceCheckUtils]: 103: Hoare triple {30247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29933#false} is VALID [2022-04-28 05:42:44,453 INFO L290 TraceCheckUtils]: 102: Hoare triple {30243#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30247#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:42:44,453 INFO L272 TraceCheckUtils]: 101: Hoare triple {30185#(= 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)); {30243#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:42:44,453 INFO L290 TraceCheckUtils]: 100: Hoare triple {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:44,454 INFO L290 TraceCheckUtils]: 99: Hoare triple {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:44,456 INFO L290 TraceCheckUtils]: 98: Hoare triple {30185#(= 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; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:44,456 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {29932#true} {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:44,456 INFO L290 TraceCheckUtils]: 96: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:44,456 INFO L290 TraceCheckUtils]: 95: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:44,457 INFO L290 TraceCheckUtils]: 94: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:44,457 INFO L272 TraceCheckUtils]: 93: Hoare triple {30185#(= 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)); {29932#true} is VALID [2022-04-28 05:42:44,457 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {29932#true} {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:44,457 INFO L290 TraceCheckUtils]: 91: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:44,457 INFO L290 TraceCheckUtils]: 90: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:44,457 INFO L290 TraceCheckUtils]: 89: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:44,457 INFO L272 TraceCheckUtils]: 88: Hoare triple {30185#(= 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)); {29932#true} is VALID [2022-04-28 05:42:44,458 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {29932#true} {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:44,458 INFO L290 TraceCheckUtils]: 86: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:44,458 INFO L290 TraceCheckUtils]: 85: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:44,458 INFO L290 TraceCheckUtils]: 84: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:44,458 INFO L272 TraceCheckUtils]: 83: Hoare triple {30185#(= 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)); {29932#true} is VALID [2022-04-28 05:42:44,459 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30178#(not (= |__VERIFIER_assert_#in~cond| 0))} {29932#true} #86#return; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:44,459 INFO L290 TraceCheckUtils]: 81: Hoare triple {30178#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:42:44,459 INFO L290 TraceCheckUtils]: 80: Hoare triple {30329#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {30178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:42:44,459 INFO L290 TraceCheckUtils]: 79: Hoare triple {29932#true} ~cond := #in~cond; {30329#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:42:44,459 INFO L272 TraceCheckUtils]: 78: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L290 TraceCheckUtils]: 77: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L290 TraceCheckUtils]: 76: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L290 TraceCheckUtils]: 75: Hoare triple {29932#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29932#true} {29932#true} #92#return; {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L290 TraceCheckUtils]: 73: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L290 TraceCheckUtils]: 72: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L290 TraceCheckUtils]: 71: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L272 TraceCheckUtils]: 70: Hoare triple {29932#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)); {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {29932#true} {29932#true} #90#return; {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L290 TraceCheckUtils]: 68: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L290 TraceCheckUtils]: 67: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L290 TraceCheckUtils]: 66: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L272 TraceCheckUtils]: 65: Hoare triple {29932#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29932#true} {29932#true} #88#return; {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L290 TraceCheckUtils]: 63: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L290 TraceCheckUtils]: 62: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L290 TraceCheckUtils]: 61: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L272 TraceCheckUtils]: 60: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29932#true} {29932#true} #86#return; {29932#true} is VALID [2022-04-28 05:42:44,460 INFO L290 TraceCheckUtils]: 58: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L290 TraceCheckUtils]: 57: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L272 TraceCheckUtils]: 55: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {29932#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {29932#true} {29932#true} #92#return; {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L290 TraceCheckUtils]: 50: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L290 TraceCheckUtils]: 49: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L272 TraceCheckUtils]: 47: Hoare triple {29932#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)); {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29932#true} {29932#true} #90#return; {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L290 TraceCheckUtils]: 43: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L272 TraceCheckUtils]: 42: Hoare triple {29932#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29932#true} {29932#true} #88#return; {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:44,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L272 TraceCheckUtils]: 37: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29932#true} {29932#true} #86#return; {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L272 TraceCheckUtils]: 32: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {29932#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {29932#true} assume !!(#t~post6 < 10);havoc #t~post6; {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {29932#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29932#true} {29932#true} #84#return; {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L272 TraceCheckUtils]: 22: Hoare triple {29932#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {29932#true} {29932#true} #82#return; {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:44,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L272 TraceCheckUtils]: 17: Hoare triple {29932#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {29932#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; {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29932#true} {29932#true} #80#return; {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L272 TraceCheckUtils]: 11: Hoare triple {29932#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29932#true} {29932#true} #78#return; {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L272 TraceCheckUtils]: 6: Hoare triple {29932#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {29932#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {29932#true} call #t~ret8 := main(); {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29932#true} {29932#true} #98#return; {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {29932#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);~counter~0 := 0; {29932#true} is VALID [2022-04-28 05:42:44,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {29932#true} call ULTIMATE.init(); {29932#true} is VALID [2022-04-28 05:42:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 64 proven. 10 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-28 05:42:44,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:42:44,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345688056] [2022-04-28 05:42:44,464 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:42:44,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335310191] [2022-04-28 05:42:44,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335310191] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:42:44,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:42:44,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-04-28 05:42:44,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:42:44,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [81021975] [2022-04-28 05:42:44,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [81021975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:42:44,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:42:44,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:42:44,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853223633] [2022-04-28 05:42:44,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:42:44,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2022-04-28 05:42:44,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:42:44,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:42:44,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:42:44,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:42:44,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:42:44,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:42:44,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:42:44,508 INFO L87 Difference]: Start difference. First operand 335 states and 439 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:42:45,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:45,277 INFO L93 Difference]: Finished difference Result 341 states and 444 transitions. [2022-04-28 05:42:45,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:42:45,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2022-04-28 05:42:45,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:42:45,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:42:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 05:42:45,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:42:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 05:42:45,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-28 05:42:45,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:42:45,338 INFO L225 Difference]: With dead ends: 341 [2022-04-28 05:42:45,338 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 05:42:45,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:42:45,339 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:42:45,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:42:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 05:42:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2022-04-28 05:42:45,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:42:45,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:45,923 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:45,924 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:45,929 INFO L93 Difference]: Finished difference Result 339 states and 442 transitions. [2022-04-28 05:42:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-28 05:42:45,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:42:45,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:42:45,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 339 states. [2022-04-28 05:42:45,931 INFO L87 Difference]: Start difference. First operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 339 states. [2022-04-28 05:42:45,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:45,936 INFO L93 Difference]: Finished difference Result 339 states and 442 transitions. [2022-04-28 05:42:45,936 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-28 05:42:45,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:42:45,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:42:45,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:42:45,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:42:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:45,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 442 transitions. [2022-04-28 05:42:45,946 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 442 transitions. Word has length 105 [2022-04-28 05:42:45,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:42:45,946 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 442 transitions. [2022-04-28 05:42:45,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:42:45,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 339 states and 442 transitions. [2022-04-28 05:42:46,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:42:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-28 05:42:46,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 05:42:46,554 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:42:46,554 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 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] [2022-04-28 05:42:46,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 05:42:46,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:42:46,772 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:42:46,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:42:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1026601615, now seen corresponding path program 3 times [2022-04-28 05:42:46,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:42:46,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [816085351] [2022-04-28 05:42:46,773 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:42:46,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1026601615, now seen corresponding path program 4 times [2022-04-28 05:42:46,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:42:46,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289451748] [2022-04-28 05:42:46,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:42:46,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:42:46,781 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:42:46,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979983921] [2022-04-28 05:42:46,781 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:42:46,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:42:46,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:42:46,782 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:42:46,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 05:42:46,837 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:42:46,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:42:46,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:42:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:42:46,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:42:47,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {32611#true} call ULTIMATE.init(); {32611#true} is VALID [2022-04-28 05:42:47,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {32611#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);~counter~0 := 0; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {32619#(<= ~counter~0 0)} assume true; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32619#(<= ~counter~0 0)} {32611#true} #98#return; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {32619#(<= ~counter~0 0)} call #t~ret8 := main(); {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {32619#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,202 INFO L272 TraceCheckUtils]: 6: Hoare triple {32619#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {32619#(<= ~counter~0 0)} ~cond := #in~cond; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {32619#(<= ~counter~0 0)} assume !(0 == ~cond); {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {32619#(<= ~counter~0 0)} assume true; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,203 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32619#(<= ~counter~0 0)} {32619#(<= ~counter~0 0)} #78#return; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,203 INFO L272 TraceCheckUtils]: 11: Hoare triple {32619#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {32619#(<= ~counter~0 0)} ~cond := #in~cond; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {32619#(<= ~counter~0 0)} assume !(0 == ~cond); {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {32619#(<= ~counter~0 0)} assume true; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,204 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32619#(<= ~counter~0 0)} {32619#(<= ~counter~0 0)} #80#return; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {32619#(<= ~counter~0 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; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,205 INFO L272 TraceCheckUtils]: 17: Hoare triple {32619#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {32619#(<= ~counter~0 0)} ~cond := #in~cond; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {32619#(<= ~counter~0 0)} assume !(0 == ~cond); {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {32619#(<= ~counter~0 0)} assume true; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,206 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {32619#(<= ~counter~0 0)} {32619#(<= ~counter~0 0)} #82#return; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,206 INFO L272 TraceCheckUtils]: 22: Hoare triple {32619#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {32619#(<= ~counter~0 0)} ~cond := #in~cond; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {32619#(<= ~counter~0 0)} assume !(0 == ~cond); {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {32619#(<= ~counter~0 0)} assume true; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,207 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {32619#(<= ~counter~0 0)} {32619#(<= ~counter~0 0)} #84#return; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:47,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {32619#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32698#(<= ~counter~0 1)} is VALID [2022-04-28 05:42:47,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {32698#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {32698#(<= ~counter~0 1)} is VALID [2022-04-28 05:42:47,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {32698#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {32698#(<= ~counter~0 1)} is VALID [2022-04-28 05:42:47,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {32698#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {32708#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,210 INFO L272 TraceCheckUtils]: 32: Hoare triple {32708#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {32708#(<= ~counter~0 2)} ~cond := #in~cond; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,211 INFO L290 TraceCheckUtils]: 34: Hoare triple {32708#(<= ~counter~0 2)} assume !(0 == ~cond); {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {32708#(<= ~counter~0 2)} assume true; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,211 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {32708#(<= ~counter~0 2)} {32708#(<= ~counter~0 2)} #86#return; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,212 INFO L272 TraceCheckUtils]: 37: Hoare triple {32708#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {32708#(<= ~counter~0 2)} ~cond := #in~cond; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {32708#(<= ~counter~0 2)} assume !(0 == ~cond); {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,213 INFO L290 TraceCheckUtils]: 40: Hoare triple {32708#(<= ~counter~0 2)} assume true; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,213 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {32708#(<= ~counter~0 2)} {32708#(<= ~counter~0 2)} #88#return; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,213 INFO L272 TraceCheckUtils]: 42: Hoare triple {32708#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,214 INFO L290 TraceCheckUtils]: 43: Hoare triple {32708#(<= ~counter~0 2)} ~cond := #in~cond; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,214 INFO L290 TraceCheckUtils]: 44: Hoare triple {32708#(<= ~counter~0 2)} assume !(0 == ~cond); {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {32708#(<= ~counter~0 2)} assume true; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,215 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {32708#(<= ~counter~0 2)} {32708#(<= ~counter~0 2)} #90#return; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,215 INFO L272 TraceCheckUtils]: 47: Hoare triple {32708#(<= ~counter~0 2)} 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)); {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {32708#(<= ~counter~0 2)} ~cond := #in~cond; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,216 INFO L290 TraceCheckUtils]: 49: Hoare triple {32708#(<= ~counter~0 2)} assume !(0 == ~cond); {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,216 INFO L290 TraceCheckUtils]: 50: Hoare triple {32708#(<= ~counter~0 2)} assume true; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,216 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {32708#(<= ~counter~0 2)} {32708#(<= ~counter~0 2)} #92#return; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,217 INFO L290 TraceCheckUtils]: 52: Hoare triple {32708#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:47,217 INFO L290 TraceCheckUtils]: 53: Hoare triple {32708#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,217 INFO L290 TraceCheckUtils]: 54: Hoare triple {32778#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,218 INFO L272 TraceCheckUtils]: 55: Hoare triple {32778#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,218 INFO L290 TraceCheckUtils]: 56: Hoare triple {32778#(<= ~counter~0 3)} ~cond := #in~cond; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,218 INFO L290 TraceCheckUtils]: 57: Hoare triple {32778#(<= ~counter~0 3)} assume !(0 == ~cond); {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,219 INFO L290 TraceCheckUtils]: 58: Hoare triple {32778#(<= ~counter~0 3)} assume true; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,219 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32778#(<= ~counter~0 3)} {32778#(<= ~counter~0 3)} #86#return; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,219 INFO L272 TraceCheckUtils]: 60: Hoare triple {32778#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,220 INFO L290 TraceCheckUtils]: 61: Hoare triple {32778#(<= ~counter~0 3)} ~cond := #in~cond; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,220 INFO L290 TraceCheckUtils]: 62: Hoare triple {32778#(<= ~counter~0 3)} assume !(0 == ~cond); {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,220 INFO L290 TraceCheckUtils]: 63: Hoare triple {32778#(<= ~counter~0 3)} assume true; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,221 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32778#(<= ~counter~0 3)} {32778#(<= ~counter~0 3)} #88#return; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,221 INFO L272 TraceCheckUtils]: 65: Hoare triple {32778#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,221 INFO L290 TraceCheckUtils]: 66: Hoare triple {32778#(<= ~counter~0 3)} ~cond := #in~cond; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,222 INFO L290 TraceCheckUtils]: 67: Hoare triple {32778#(<= ~counter~0 3)} assume !(0 == ~cond); {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,222 INFO L290 TraceCheckUtils]: 68: Hoare triple {32778#(<= ~counter~0 3)} assume true; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,222 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {32778#(<= ~counter~0 3)} {32778#(<= ~counter~0 3)} #90#return; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,223 INFO L272 TraceCheckUtils]: 70: Hoare triple {32778#(<= ~counter~0 3)} 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)); {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,223 INFO L290 TraceCheckUtils]: 71: Hoare triple {32778#(<= ~counter~0 3)} ~cond := #in~cond; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,223 INFO L290 TraceCheckUtils]: 72: Hoare triple {32778#(<= ~counter~0 3)} assume !(0 == ~cond); {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,224 INFO L290 TraceCheckUtils]: 73: Hoare triple {32778#(<= ~counter~0 3)} assume true; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,224 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {32778#(<= ~counter~0 3)} {32778#(<= ~counter~0 3)} #92#return; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,224 INFO L290 TraceCheckUtils]: 75: Hoare triple {32778#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:47,225 INFO L290 TraceCheckUtils]: 76: Hoare triple {32778#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,225 INFO L290 TraceCheckUtils]: 77: Hoare triple {32848#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,225 INFO L272 TraceCheckUtils]: 78: Hoare triple {32848#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,226 INFO L290 TraceCheckUtils]: 79: Hoare triple {32848#(<= ~counter~0 4)} ~cond := #in~cond; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,226 INFO L290 TraceCheckUtils]: 80: Hoare triple {32848#(<= ~counter~0 4)} assume !(0 == ~cond); {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,226 INFO L290 TraceCheckUtils]: 81: Hoare triple {32848#(<= ~counter~0 4)} assume true; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,227 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {32848#(<= ~counter~0 4)} {32848#(<= ~counter~0 4)} #86#return; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,227 INFO L272 TraceCheckUtils]: 83: Hoare triple {32848#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,227 INFO L290 TraceCheckUtils]: 84: Hoare triple {32848#(<= ~counter~0 4)} ~cond := #in~cond; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,228 INFO L290 TraceCheckUtils]: 85: Hoare triple {32848#(<= ~counter~0 4)} assume !(0 == ~cond); {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,228 INFO L290 TraceCheckUtils]: 86: Hoare triple {32848#(<= ~counter~0 4)} assume true; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,228 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32848#(<= ~counter~0 4)} {32848#(<= ~counter~0 4)} #88#return; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,229 INFO L272 TraceCheckUtils]: 88: Hoare triple {32848#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,229 INFO L290 TraceCheckUtils]: 89: Hoare triple {32848#(<= ~counter~0 4)} ~cond := #in~cond; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,229 INFO L290 TraceCheckUtils]: 90: Hoare triple {32848#(<= ~counter~0 4)} assume !(0 == ~cond); {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,229 INFO L290 TraceCheckUtils]: 91: Hoare triple {32848#(<= ~counter~0 4)} assume true; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,230 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32848#(<= ~counter~0 4)} {32848#(<= ~counter~0 4)} #90#return; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,230 INFO L272 TraceCheckUtils]: 93: Hoare triple {32848#(<= ~counter~0 4)} 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)); {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,231 INFO L290 TraceCheckUtils]: 94: Hoare triple {32848#(<= ~counter~0 4)} ~cond := #in~cond; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,231 INFO L290 TraceCheckUtils]: 95: Hoare triple {32848#(<= ~counter~0 4)} assume !(0 == ~cond); {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,231 INFO L290 TraceCheckUtils]: 96: Hoare triple {32848#(<= ~counter~0 4)} assume true; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,232 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {32848#(<= ~counter~0 4)} {32848#(<= ~counter~0 4)} #92#return; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,232 INFO L290 TraceCheckUtils]: 98: Hoare triple {32848#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,232 INFO L290 TraceCheckUtils]: 99: Hoare triple {32848#(<= ~counter~0 4)} ~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; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:47,233 INFO L290 TraceCheckUtils]: 100: Hoare triple {32848#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32921#(<= |main_#t~post6| 4)} is VALID [2022-04-28 05:42:47,233 INFO L290 TraceCheckUtils]: 101: Hoare triple {32921#(<= |main_#t~post6| 4)} assume !(#t~post6 < 10);havoc #t~post6; {32612#false} is VALID [2022-04-28 05:42:47,233 INFO L272 TraceCheckUtils]: 102: Hoare triple {32612#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {32612#false} is VALID [2022-04-28 05:42:47,233 INFO L290 TraceCheckUtils]: 103: Hoare triple {32612#false} ~cond := #in~cond; {32612#false} is VALID [2022-04-28 05:42:47,233 INFO L290 TraceCheckUtils]: 104: Hoare triple {32612#false} assume 0 == ~cond; {32612#false} is VALID [2022-04-28 05:42:47,233 INFO L290 TraceCheckUtils]: 105: Hoare triple {32612#false} assume !false; {32612#false} is VALID [2022-04-28 05:42:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 24 proven. 215 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-28 05:42:47,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:42:47,587 INFO L290 TraceCheckUtils]: 105: Hoare triple {32612#false} assume !false; {32612#false} is VALID [2022-04-28 05:42:47,587 INFO L290 TraceCheckUtils]: 104: Hoare triple {32612#false} assume 0 == ~cond; {32612#false} is VALID [2022-04-28 05:42:47,587 INFO L290 TraceCheckUtils]: 103: Hoare triple {32612#false} ~cond := #in~cond; {32612#false} is VALID [2022-04-28 05:42:47,587 INFO L272 TraceCheckUtils]: 102: Hoare triple {32612#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {32612#false} is VALID [2022-04-28 05:42:47,588 INFO L290 TraceCheckUtils]: 101: Hoare triple {32949#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {32612#false} is VALID [2022-04-28 05:42:47,588 INFO L290 TraceCheckUtils]: 100: Hoare triple {32953#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32949#(< |main_#t~post6| 10)} is VALID [2022-04-28 05:42:47,588 INFO L290 TraceCheckUtils]: 99: Hoare triple {32953#(< ~counter~0 10)} ~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; {32953#(< ~counter~0 10)} is VALID [2022-04-28 05:42:47,589 INFO L290 TraceCheckUtils]: 98: Hoare triple {32953#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {32953#(< ~counter~0 10)} is VALID [2022-04-28 05:42:47,589 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {32611#true} {32953#(< ~counter~0 10)} #92#return; {32953#(< ~counter~0 10)} is VALID [2022-04-28 05:42:47,589 INFO L290 TraceCheckUtils]: 96: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 05:42:47,589 INFO L290 TraceCheckUtils]: 95: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 05:42:47,589 INFO L290 TraceCheckUtils]: 94: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 05:42:47,589 INFO L272 TraceCheckUtils]: 93: Hoare triple {32953#(< ~counter~0 10)} 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)); {32611#true} is VALID [2022-04-28 05:42:47,590 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32611#true} {32953#(< ~counter~0 10)} #90#return; {32953#(< ~counter~0 10)} is VALID [2022-04-28 05:42:47,590 INFO L290 TraceCheckUtils]: 91: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 05:42:47,590 INFO L290 TraceCheckUtils]: 90: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 05:42:47,590 INFO L290 TraceCheckUtils]: 89: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 05:42:47,590 INFO L272 TraceCheckUtils]: 88: Hoare triple {32953#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32611#true} is VALID [2022-04-28 05:42:47,591 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32611#true} {32953#(< ~counter~0 10)} #88#return; {32953#(< ~counter~0 10)} is VALID [2022-04-28 05:42:47,591 INFO L290 TraceCheckUtils]: 86: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 05:42:47,591 INFO L290 TraceCheckUtils]: 85: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 05:42:47,591 INFO L290 TraceCheckUtils]: 84: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 05:42:47,591 INFO L272 TraceCheckUtils]: 83: Hoare triple {32953#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32611#true} is VALID [2022-04-28 05:42:47,591 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {32611#true} {32953#(< ~counter~0 10)} #86#return; {32953#(< ~counter~0 10)} is VALID [2022-04-28 05:42:47,591 INFO L290 TraceCheckUtils]: 81: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 05:42:47,591 INFO L290 TraceCheckUtils]: 80: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 05:42:47,591 INFO L290 TraceCheckUtils]: 79: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 05:42:47,591 INFO L272 TraceCheckUtils]: 78: Hoare triple {32953#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32611#true} is VALID [2022-04-28 05:42:47,592 INFO L290 TraceCheckUtils]: 77: Hoare triple {32953#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {32953#(< ~counter~0 10)} is VALID [2022-04-28 05:42:47,593 INFO L290 TraceCheckUtils]: 76: Hoare triple {33026#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32953#(< ~counter~0 10)} is VALID [2022-04-28 05:42:47,593 INFO L290 TraceCheckUtils]: 75: Hoare triple {33026#(< ~counter~0 9)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {33026#(< ~counter~0 9)} is VALID [2022-04-28 05:42:47,593 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {32611#true} {33026#(< ~counter~0 9)} #92#return; {33026#(< ~counter~0 9)} is VALID [2022-04-28 05:42:47,593 INFO L290 TraceCheckUtils]: 73: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 05:42:47,593 INFO L290 TraceCheckUtils]: 72: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 05:42:47,593 INFO L290 TraceCheckUtils]: 71: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 05:42:47,594 INFO L272 TraceCheckUtils]: 70: Hoare triple {33026#(< ~counter~0 9)} 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)); {32611#true} is VALID [2022-04-28 05:42:47,594 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {32611#true} {33026#(< ~counter~0 9)} #90#return; {33026#(< ~counter~0 9)} is VALID [2022-04-28 05:42:47,594 INFO L290 TraceCheckUtils]: 68: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 05:42:47,594 INFO L290 TraceCheckUtils]: 67: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 05:42:47,594 INFO L290 TraceCheckUtils]: 66: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 05:42:47,594 INFO L272 TraceCheckUtils]: 65: Hoare triple {33026#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32611#true} is VALID [2022-04-28 05:42:47,595 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32611#true} {33026#(< ~counter~0 9)} #88#return; {33026#(< ~counter~0 9)} is VALID [2022-04-28 05:42:47,595 INFO L290 TraceCheckUtils]: 63: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 05:42:47,595 INFO L290 TraceCheckUtils]: 62: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 05:42:47,595 INFO L290 TraceCheckUtils]: 61: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 05:42:47,595 INFO L272 TraceCheckUtils]: 60: Hoare triple {33026#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32611#true} is VALID [2022-04-28 05:42:47,595 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32611#true} {33026#(< ~counter~0 9)} #86#return; {33026#(< ~counter~0 9)} is VALID [2022-04-28 05:42:47,595 INFO L290 TraceCheckUtils]: 58: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 05:42:47,595 INFO L290 TraceCheckUtils]: 57: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 05:42:47,595 INFO L290 TraceCheckUtils]: 56: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 05:42:47,596 INFO L272 TraceCheckUtils]: 55: Hoare triple {33026#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32611#true} is VALID [2022-04-28 05:42:47,596 INFO L290 TraceCheckUtils]: 54: Hoare triple {33026#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {33026#(< ~counter~0 9)} is VALID [2022-04-28 05:42:47,596 INFO L290 TraceCheckUtils]: 53: Hoare triple {33096#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33026#(< ~counter~0 9)} is VALID [2022-04-28 05:42:47,597 INFO L290 TraceCheckUtils]: 52: Hoare triple {33096#(< ~counter~0 8)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {33096#(< ~counter~0 8)} is VALID [2022-04-28 05:42:47,597 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {32611#true} {33096#(< ~counter~0 8)} #92#return; {33096#(< ~counter~0 8)} is VALID [2022-04-28 05:42:47,597 INFO L290 TraceCheckUtils]: 50: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 05:42:47,597 INFO L290 TraceCheckUtils]: 49: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 05:42:47,597 INFO L290 TraceCheckUtils]: 48: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 05:42:47,597 INFO L272 TraceCheckUtils]: 47: Hoare triple {33096#(< ~counter~0 8)} 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)); {32611#true} is VALID [2022-04-28 05:42:47,598 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {32611#true} {33096#(< ~counter~0 8)} #90#return; {33096#(< ~counter~0 8)} is VALID [2022-04-28 05:42:47,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 05:42:47,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 05:42:47,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 05:42:47,598 INFO L272 TraceCheckUtils]: 42: Hoare triple {33096#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32611#true} is VALID [2022-04-28 05:42:47,598 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {32611#true} {33096#(< ~counter~0 8)} #88#return; {33096#(< ~counter~0 8)} is VALID [2022-04-28 05:42:47,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 05:42:47,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 05:42:47,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 05:42:47,599 INFO L272 TraceCheckUtils]: 37: Hoare triple {33096#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32611#true} is VALID [2022-04-28 05:42:47,599 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {32611#true} {33096#(< ~counter~0 8)} #86#return; {33096#(< ~counter~0 8)} is VALID [2022-04-28 05:42:47,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 05:42:47,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 05:42:47,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 05:42:47,599 INFO L272 TraceCheckUtils]: 32: Hoare triple {33096#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32611#true} is VALID [2022-04-28 05:42:47,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {33096#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {33096#(< ~counter~0 8)} is VALID [2022-04-28 05:42:47,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {33166#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33096#(< ~counter~0 8)} is VALID [2022-04-28 05:42:47,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {33166#(< ~counter~0 7)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {33166#(< ~counter~0 7)} is VALID [2022-04-28 05:42:47,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {33166#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {33166#(< ~counter~0 7)} is VALID [2022-04-28 05:42:47,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {33176#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33166#(< ~counter~0 7)} is VALID [2022-04-28 05:42:47,601 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {32611#true} {33176#(< ~counter~0 6)} #84#return; {33176#(< ~counter~0 6)} is VALID [2022-04-28 05:42:47,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 05:42:47,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 05:42:47,602 INFO L290 TraceCheckUtils]: 23: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 05:42:47,602 INFO L272 TraceCheckUtils]: 22: Hoare triple {33176#(< ~counter~0 6)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {32611#true} is VALID [2022-04-28 05:42:47,602 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {32611#true} {33176#(< ~counter~0 6)} #82#return; {33176#(< ~counter~0 6)} is VALID [2022-04-28 05:42:47,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 05:42:47,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 05:42:47,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 05:42:47,602 INFO L272 TraceCheckUtils]: 17: Hoare triple {33176#(< ~counter~0 6)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {32611#true} is VALID [2022-04-28 05:42:47,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {33176#(< ~counter~0 6)} ~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; {33176#(< ~counter~0 6)} is VALID [2022-04-28 05:42:47,603 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32611#true} {33176#(< ~counter~0 6)} #80#return; {33176#(< ~counter~0 6)} is VALID [2022-04-28 05:42:47,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 05:42:47,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 05:42:47,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 05:42:47,603 INFO L272 TraceCheckUtils]: 11: Hoare triple {33176#(< ~counter~0 6)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {32611#true} is VALID [2022-04-28 05:42:47,603 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32611#true} {33176#(< ~counter~0 6)} #78#return; {33176#(< ~counter~0 6)} is VALID [2022-04-28 05:42:47,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 05:42:47,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 05:42:47,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 05:42:47,604 INFO L272 TraceCheckUtils]: 6: Hoare triple {33176#(< ~counter~0 6)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {32611#true} is VALID [2022-04-28 05:42:47,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {33176#(< ~counter~0 6)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {33176#(< ~counter~0 6)} is VALID [2022-04-28 05:42:47,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {33176#(< ~counter~0 6)} call #t~ret8 := main(); {33176#(< ~counter~0 6)} is VALID [2022-04-28 05:42:47,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33176#(< ~counter~0 6)} {32611#true} #98#return; {33176#(< ~counter~0 6)} is VALID [2022-04-28 05:42:47,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {33176#(< ~counter~0 6)} assume true; {33176#(< ~counter~0 6)} is VALID [2022-04-28 05:42:47,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {32611#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);~counter~0 := 0; {33176#(< ~counter~0 6)} is VALID [2022-04-28 05:42:47,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {32611#true} call ULTIMATE.init(); {32611#true} is VALID [2022-04-28 05:42:47,605 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-28 05:42:47,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:42:47,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289451748] [2022-04-28 05:42:47,606 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:42:47,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979983921] [2022-04-28 05:42:47,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979983921] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:42:47,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:42:47,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 05:42:47,606 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:42:47,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [816085351] [2022-04-28 05:42:47,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [816085351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:42:47,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:42:47,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:42:47,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349780839] [2022-04-28 05:42:47,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:42:47,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 106 [2022-04-28 05:42:47,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:42:47,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:42:47,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:42:47,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:42:47,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:42:47,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:42:47,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:42:47,664 INFO L87 Difference]: Start difference. First operand 339 states and 442 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:42:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:48,507 INFO L93 Difference]: Finished difference Result 349 states and 452 transitions. [2022-04-28 05:42:48,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:42:48,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 106 [2022-04-28 05:42:48,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:42:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:42:48,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-28 05:42:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:42:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-28 05:42:48,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2022-04-28 05:42:48,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:42:48,619 INFO L225 Difference]: With dead ends: 349 [2022-04-28 05:42:48,619 INFO L226 Difference]: Without dead ends: 342 [2022-04-28 05:42:48,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2022-04-28 05:42:48,620 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 24 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:42:48,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 177 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:42:48,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-28 05:42:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-28 05:42:49,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:42:49,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:49,212 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:49,212 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:49,218 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2022-04-28 05:42:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-28 05:42:49,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:42:49,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:42:49,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 342 states. [2022-04-28 05:42:49,220 INFO L87 Difference]: Start difference. First operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 342 states. [2022-04-28 05:42:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:49,226 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2022-04-28 05:42:49,226 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-28 05:42:49,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:42:49,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:42:49,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:42:49,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:42:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 445 transitions. [2022-04-28 05:42:49,234 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 445 transitions. Word has length 106 [2022-04-28 05:42:49,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:42:49,234 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 445 transitions. [2022-04-28 05:42:49,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:42:49,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 445 transitions. [2022-04-28 05:42:49,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:42:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-28 05:42:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 05:42:49,840 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:42:49,840 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 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] [2022-04-28 05:42:49,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-28 05:42:50,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 05:42:50,043 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:42:50,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:42:50,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1761848073, now seen corresponding path program 3 times [2022-04-28 05:42:50,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:42:50,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [932285626] [2022-04-28 05:42:50,044 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:42:50,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1761848073, now seen corresponding path program 4 times [2022-04-28 05:42:50,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:42:50,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897986649] [2022-04-28 05:42:50,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:42:50,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:42:50,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:42:50,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [532578731] [2022-04-28 05:42:50,054 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:42:50,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:42:50,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:42:50,055 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:42:50,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 05:42:50,105 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:42:50,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:42:50,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 05:42:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:42:50,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:42:51,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {35332#true} call ULTIMATE.init(); {35332#true} is VALID [2022-04-28 05:42:51,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {35332#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);~counter~0 := 0; {35332#true} is VALID [2022-04-28 05:42:51,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 05:42:51,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35332#true} {35332#true} #98#return; {35332#true} is VALID [2022-04-28 05:42:51,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {35332#true} call #t~ret8 := main(); {35332#true} is VALID [2022-04-28 05:42:51,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {35332#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {35332#true} is VALID [2022-04-28 05:42:51,072 INFO L272 TraceCheckUtils]: 6: Hoare triple {35332#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {35332#true} is VALID [2022-04-28 05:42:51,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 05:42:51,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 05:42:51,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 05:42:51,072 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35332#true} {35332#true} #78#return; {35332#true} is VALID [2022-04-28 05:42:51,072 INFO L272 TraceCheckUtils]: 11: Hoare triple {35332#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35332#true} is VALID [2022-04-28 05:42:51,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 05:42:51,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 05:42:51,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 05:42:51,072 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35332#true} {35332#true} #80#return; {35332#true} is VALID [2022-04-28 05:42:51,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {35332#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; {35385#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,073 INFO L272 TraceCheckUtils]: 17: Hoare triple {35385#(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)); {35332#true} is VALID [2022-04-28 05:42:51,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 05:42:51,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 05:42:51,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 05:42:51,073 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35332#true} {35385#(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))} #82#return; {35385#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,073 INFO L272 TraceCheckUtils]: 22: Hoare triple {35385#(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)); {35332#true} is VALID [2022-04-28 05:42:51,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 05:42:51,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 05:42:51,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 05:42:51,074 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {35332#true} {35385#(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))} #84#return; {35385#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {35385#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35385#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {35385#(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 !!(#t~post6 < 10);havoc #t~post6; {35385#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {35385#(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; {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~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 !!(#t~post7 < 10);havoc #t~post7; {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,076 INFO L272 TraceCheckUtils]: 32: Hoare triple {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~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)); {35332#true} is VALID [2022-04-28 05:42:51,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 05:42:51,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 05:42:51,076 INFO L290 TraceCheckUtils]: 35: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 05:42:51,077 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {35332#true} {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~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))} #86#return; {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,077 INFO L272 TraceCheckUtils]: 37: Hoare triple {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~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)); {35332#true} is VALID [2022-04-28 05:42:51,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 05:42:51,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 05:42:51,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 05:42:51,078 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {35332#true} {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~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))} #88#return; {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,078 INFO L272 TraceCheckUtils]: 42: Hoare triple {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~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)); {35332#true} is VALID [2022-04-28 05:42:51,078 INFO L290 TraceCheckUtils]: 43: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 05:42:51,078 INFO L290 TraceCheckUtils]: 44: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 05:42:51,078 INFO L290 TraceCheckUtils]: 45: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 05:42:51,079 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35332#true} {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~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))} #90#return; {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,079 INFO L272 TraceCheckUtils]: 47: Hoare triple {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~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)); {35332#true} is VALID [2022-04-28 05:42:51,079 INFO L290 TraceCheckUtils]: 48: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 05:42:51,079 INFO L290 TraceCheckUtils]: 49: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 05:42:51,079 INFO L290 TraceCheckUtils]: 50: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 05:42:51,079 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {35332#true} {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~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))} #92#return; {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,081 INFO L290 TraceCheckUtils]: 52: Hoare triple {35425#(and (= main_~r~0 0) (= main_~c~0 main_~a~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; {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~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 05:42:51,081 INFO L290 TraceCheckUtils]: 53: Hoare triple {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~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 05:42:51,081 INFO L290 TraceCheckUtils]: 54: Hoare triple {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~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 !!(#t~post7 < 10);havoc #t~post7; {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~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 05:42:51,082 INFO L272 TraceCheckUtils]: 55: Hoare triple {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~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)); {35332#true} is VALID [2022-04-28 05:42:51,082 INFO L290 TraceCheckUtils]: 56: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 05:42:51,082 INFO L290 TraceCheckUtils]: 57: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 05:42:51,082 INFO L290 TraceCheckUtils]: 58: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 05:42:51,082 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {35332#true} {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~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 05:42:51,082 INFO L272 TraceCheckUtils]: 60: Hoare triple {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~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)); {35332#true} is VALID [2022-04-28 05:42:51,082 INFO L290 TraceCheckUtils]: 61: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 05:42:51,083 INFO L290 TraceCheckUtils]: 62: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 05:42:51,083 INFO L290 TraceCheckUtils]: 63: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 05:42:51,083 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35332#true} {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~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 05:42:51,083 INFO L272 TraceCheckUtils]: 65: Hoare triple {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~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 ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35332#true} is VALID [2022-04-28 05:42:51,083 INFO L290 TraceCheckUtils]: 66: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 05:42:51,083 INFO L290 TraceCheckUtils]: 67: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 05:42:51,083 INFO L290 TraceCheckUtils]: 68: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 05:42:51,084 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {35332#true} {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #90#return; {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~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 05:42:51,084 INFO L272 TraceCheckUtils]: 70: Hoare triple {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~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 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)); {35332#true} is VALID [2022-04-28 05:42:51,084 INFO L290 TraceCheckUtils]: 71: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 05:42:51,084 INFO L290 TraceCheckUtils]: 72: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 05:42:51,084 INFO L290 TraceCheckUtils]: 73: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 05:42:51,085 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {35332#true} {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #92#return; {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~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 05:42:51,086 INFO L290 TraceCheckUtils]: 75: Hoare triple {35495#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~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 !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {35565#(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_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,086 INFO L290 TraceCheckUtils]: 76: Hoare triple {35565#(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_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35565#(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_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,087 INFO L290 TraceCheckUtils]: 77: Hoare triple {35565#(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_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {35565#(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_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,087 INFO L272 TraceCheckUtils]: 78: Hoare triple {35565#(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_~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)); {35332#true} is VALID [2022-04-28 05:42:51,087 INFO L290 TraceCheckUtils]: 79: Hoare triple {35332#true} ~cond := #in~cond; {35578#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:42:51,087 INFO L290 TraceCheckUtils]: 80: Hoare triple {35578#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {35582#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:42:51,088 INFO L290 TraceCheckUtils]: 81: Hoare triple {35582#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35582#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:42:51,089 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {35582#(not (= |__VERIFIER_assert_#in~cond| 0))} {35565#(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_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,089 INFO L272 TraceCheckUtils]: 83: Hoare triple {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35332#true} is VALID [2022-04-28 05:42:51,089 INFO L290 TraceCheckUtils]: 84: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 05:42:51,089 INFO L290 TraceCheckUtils]: 85: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 05:42:51,089 INFO L290 TraceCheckUtils]: 86: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 05:42:51,089 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {35332#true} {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} #88#return; {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,090 INFO L272 TraceCheckUtils]: 88: Hoare triple {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35332#true} is VALID [2022-04-28 05:42:51,090 INFO L290 TraceCheckUtils]: 89: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 05:42:51,090 INFO L290 TraceCheckUtils]: 90: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 05:42:51,090 INFO L290 TraceCheckUtils]: 91: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 05:42:51,090 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {35332#true} {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} #90#return; {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,090 INFO L272 TraceCheckUtils]: 93: Hoare triple {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~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)); {35332#true} is VALID [2022-04-28 05:42:51,090 INFO L290 TraceCheckUtils]: 94: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 05:42:51,091 INFO L290 TraceCheckUtils]: 95: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 05:42:51,091 INFO L290 TraceCheckUtils]: 96: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 05:42:51,091 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {35332#true} {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} #92#return; {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,092 INFO L290 TraceCheckUtils]: 98: Hoare triple {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:42:51,093 INFO L290 TraceCheckUtils]: 99: Hoare triple {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 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; {35641#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-28 05:42:51,094 INFO L290 TraceCheckUtils]: 100: Hoare triple {35641#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35641#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-28 05:42:51,094 INFO L290 TraceCheckUtils]: 101: Hoare triple {35641#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {35641#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-28 05:42:51,094 INFO L290 TraceCheckUtils]: 102: Hoare triple {35641#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} assume !(0 != ~b~0); {35651#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= main_~q~0 1))} is VALID [2022-04-28 05:42:51,095 INFO L272 TraceCheckUtils]: 103: Hoare triple {35651#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {35655#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:42:51,095 INFO L290 TraceCheckUtils]: 104: Hoare triple {35655#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35659#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:42:51,096 INFO L290 TraceCheckUtils]: 105: Hoare triple {35659#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35333#false} is VALID [2022-04-28 05:42:51,096 INFO L290 TraceCheckUtils]: 106: Hoare triple {35333#false} assume !false; {35333#false} is VALID [2022-04-28 05:42:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 47 proven. 34 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-04-28 05:42:51,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:43:02,192 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:43:02,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:43:02,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897986649] [2022-04-28 05:43:02,289 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:43:02,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532578731] [2022-04-28 05:43:02,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532578731] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 05:43:02,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:43:02,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 05:43:02,290 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:43:02,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [932285626] [2022-04-28 05:43:02,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [932285626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:02,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:02,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:43:02,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373892454] [2022-04-28 05:43:02,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:43:02,290 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) Word has length 107 [2022-04-28 05:43:02,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:43:02,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-28 05:43:02,351 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 05:43:02,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:43:02,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:02,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:43:02,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-28 05:43:02,352 INFO L87 Difference]: Start difference. First operand 342 states and 445 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-28 05:43:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:05,029 INFO L93 Difference]: Finished difference Result 369 states and 485 transitions. [2022-04-28 05:43:05,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:43:05,029 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) Word has length 107 [2022-04-28 05:43:05,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:43:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-28 05:43:05,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2022-04-28 05:43:05,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-28 05:43:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2022-04-28 05:43:05,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 125 transitions. [2022-04-28 05:43:05,154 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 05:43:05,161 INFO L225 Difference]: With dead ends: 369 [2022-04-28 05:43:05,161 INFO L226 Difference]: Without dead ends: 366 [2022-04-28 05:43:05,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-04-28 05:43:05,162 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 33 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 05:43:05,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 352 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 05:43:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-04-28 05:43:05,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2022-04-28 05:43:05,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:43:05,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-04-28 05:43:05,767 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-04-28 05:43:05,767 INFO L87 Difference]: Start difference. First operand 366 states. Second operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-04-28 05:43:05,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:05,773 INFO L93 Difference]: Finished difference Result 366 states and 481 transitions. [2022-04-28 05:43:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 481 transitions. [2022-04-28 05:43:05,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:05,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:05,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) Second operand 366 states. [2022-04-28 05:43:05,774 INFO L87 Difference]: Start difference. First operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) Second operand 366 states. [2022-04-28 05:43:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:05,780 INFO L93 Difference]: Finished difference Result 366 states and 481 transitions. [2022-04-28 05:43:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 481 transitions. [2022-04-28 05:43:05,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:05,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:05,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:43:05,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:43:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-04-28 05:43:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 479 transitions. [2022-04-28 05:43:05,789 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 479 transitions. Word has length 107 [2022-04-28 05:43:05,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:43:05,789 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 479 transitions. [2022-04-28 05:43:05,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-28 05:43:05,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 479 transitions. [2022-04-28 05:43:06,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:06,439 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 479 transitions. [2022-04-28 05:43:06,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-28 05:43:06,440 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:43:06,440 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:43:06,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 05:43:06,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 05:43:06,640 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:43:06,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:43:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1514731471, now seen corresponding path program 5 times [2022-04-28 05:43:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:06,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1847248272] [2022-04-28 05:43:06,641 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:43:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1514731471, now seen corresponding path program 6 times [2022-04-28 05:43:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:43:06,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894948985] [2022-04-28 05:43:06,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:43:06,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:43:06,653 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:43:06,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1049286393] [2022-04-28 05:43:06,653 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:43:06,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:43:06,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:43:06,654 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:43:06,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 05:43:06,739 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:43:06,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:43:06,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 05:43:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:06,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:43:07,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {37950#true} call ULTIMATE.init(); {37950#true} is VALID [2022-04-28 05:43:07,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {37950#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);~counter~0 := 0; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {37958#(<= ~counter~0 0)} assume true; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37958#(<= ~counter~0 0)} {37950#true} #98#return; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {37958#(<= ~counter~0 0)} call #t~ret8 := main(); {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {37958#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,133 INFO L272 TraceCheckUtils]: 6: Hoare triple {37958#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {37958#(<= ~counter~0 0)} ~cond := #in~cond; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {37958#(<= ~counter~0 0)} assume !(0 == ~cond); {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {37958#(<= ~counter~0 0)} assume true; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,135 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37958#(<= ~counter~0 0)} {37958#(<= ~counter~0 0)} #78#return; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,135 INFO L272 TraceCheckUtils]: 11: Hoare triple {37958#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {37958#(<= ~counter~0 0)} ~cond := #in~cond; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {37958#(<= ~counter~0 0)} assume !(0 == ~cond); {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {37958#(<= ~counter~0 0)} assume true; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,136 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37958#(<= ~counter~0 0)} {37958#(<= ~counter~0 0)} #80#return; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {37958#(<= ~counter~0 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; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,136 INFO L272 TraceCheckUtils]: 17: Hoare triple {37958#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {37958#(<= ~counter~0 0)} ~cond := #in~cond; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {37958#(<= ~counter~0 0)} assume !(0 == ~cond); {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {37958#(<= ~counter~0 0)} assume true; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,138 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {37958#(<= ~counter~0 0)} {37958#(<= ~counter~0 0)} #82#return; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,138 INFO L272 TraceCheckUtils]: 22: Hoare triple {37958#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {37958#(<= ~counter~0 0)} ~cond := #in~cond; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {37958#(<= ~counter~0 0)} assume !(0 == ~cond); {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {37958#(<= ~counter~0 0)} assume true; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,139 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {37958#(<= ~counter~0 0)} {37958#(<= ~counter~0 0)} #84#return; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:07,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {37958#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38037#(<= ~counter~0 1)} is VALID [2022-04-28 05:43:07,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {38037#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {38037#(<= ~counter~0 1)} is VALID [2022-04-28 05:43:07,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {38037#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {38037#(<= ~counter~0 1)} is VALID [2022-04-28 05:43:07,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {38037#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {38047#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,142 INFO L272 TraceCheckUtils]: 32: Hoare triple {38047#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {38047#(<= ~counter~0 2)} ~cond := #in~cond; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {38047#(<= ~counter~0 2)} assume !(0 == ~cond); {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {38047#(<= ~counter~0 2)} assume true; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,143 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {38047#(<= ~counter~0 2)} {38047#(<= ~counter~0 2)} #86#return; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,143 INFO L272 TraceCheckUtils]: 37: Hoare triple {38047#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,143 INFO L290 TraceCheckUtils]: 38: Hoare triple {38047#(<= ~counter~0 2)} ~cond := #in~cond; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,144 INFO L290 TraceCheckUtils]: 39: Hoare triple {38047#(<= ~counter~0 2)} assume !(0 == ~cond); {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {38047#(<= ~counter~0 2)} assume true; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,144 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {38047#(<= ~counter~0 2)} {38047#(<= ~counter~0 2)} #88#return; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,145 INFO L272 TraceCheckUtils]: 42: Hoare triple {38047#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {38047#(<= ~counter~0 2)} ~cond := #in~cond; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {38047#(<= ~counter~0 2)} assume !(0 == ~cond); {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,146 INFO L290 TraceCheckUtils]: 45: Hoare triple {38047#(<= ~counter~0 2)} assume true; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,146 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {38047#(<= ~counter~0 2)} {38047#(<= ~counter~0 2)} #90#return; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,147 INFO L272 TraceCheckUtils]: 47: Hoare triple {38047#(<= ~counter~0 2)} 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)); {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {38047#(<= ~counter~0 2)} ~cond := #in~cond; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {38047#(<= ~counter~0 2)} assume !(0 == ~cond); {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {38047#(<= ~counter~0 2)} assume true; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,148 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {38047#(<= ~counter~0 2)} {38047#(<= ~counter~0 2)} #92#return; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,148 INFO L290 TraceCheckUtils]: 52: Hoare triple {38047#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,148 INFO L290 TraceCheckUtils]: 53: Hoare triple {38047#(<= ~counter~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; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:07,149 INFO L290 TraceCheckUtils]: 54: Hoare triple {38047#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38120#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:07,149 INFO L290 TraceCheckUtils]: 55: Hoare triple {38120#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {38120#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:07,149 INFO L290 TraceCheckUtils]: 56: Hoare triple {38120#(<= ~counter~0 3)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {38120#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:07,150 INFO L290 TraceCheckUtils]: 57: Hoare triple {38120#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,150 INFO L290 TraceCheckUtils]: 58: Hoare triple {38130#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,150 INFO L272 TraceCheckUtils]: 59: Hoare triple {38130#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {38130#(<= ~counter~0 4)} ~cond := #in~cond; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {38130#(<= ~counter~0 4)} assume !(0 == ~cond); {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {38130#(<= ~counter~0 4)} assume true; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,152 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {38130#(<= ~counter~0 4)} {38130#(<= ~counter~0 4)} #86#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,152 INFO L272 TraceCheckUtils]: 64: Hoare triple {38130#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,152 INFO L290 TraceCheckUtils]: 65: Hoare triple {38130#(<= ~counter~0 4)} ~cond := #in~cond; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,152 INFO L290 TraceCheckUtils]: 66: Hoare triple {38130#(<= ~counter~0 4)} assume !(0 == ~cond); {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,153 INFO L290 TraceCheckUtils]: 67: Hoare triple {38130#(<= ~counter~0 4)} assume true; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,153 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {38130#(<= ~counter~0 4)} {38130#(<= ~counter~0 4)} #88#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,154 INFO L272 TraceCheckUtils]: 69: Hoare triple {38130#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,154 INFO L290 TraceCheckUtils]: 70: Hoare triple {38130#(<= ~counter~0 4)} ~cond := #in~cond; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,154 INFO L290 TraceCheckUtils]: 71: Hoare triple {38130#(<= ~counter~0 4)} assume !(0 == ~cond); {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,154 INFO L290 TraceCheckUtils]: 72: Hoare triple {38130#(<= ~counter~0 4)} assume true; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,155 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {38130#(<= ~counter~0 4)} {38130#(<= ~counter~0 4)} #90#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,155 INFO L272 TraceCheckUtils]: 74: Hoare triple {38130#(<= ~counter~0 4)} 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)); {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,156 INFO L290 TraceCheckUtils]: 75: Hoare triple {38130#(<= ~counter~0 4)} ~cond := #in~cond; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,156 INFO L290 TraceCheckUtils]: 76: Hoare triple {38130#(<= ~counter~0 4)} assume !(0 == ~cond); {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,156 INFO L290 TraceCheckUtils]: 77: Hoare triple {38130#(<= ~counter~0 4)} assume true; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,157 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {38130#(<= ~counter~0 4)} {38130#(<= ~counter~0 4)} #92#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,157 INFO L290 TraceCheckUtils]: 79: Hoare triple {38130#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,157 INFO L290 TraceCheckUtils]: 80: Hoare triple {38130#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,158 INFO L290 TraceCheckUtils]: 81: Hoare triple {38200#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,158 INFO L272 TraceCheckUtils]: 82: Hoare triple {38200#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,158 INFO L290 TraceCheckUtils]: 83: Hoare triple {38200#(<= ~counter~0 5)} ~cond := #in~cond; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,158 INFO L290 TraceCheckUtils]: 84: Hoare triple {38200#(<= ~counter~0 5)} assume !(0 == ~cond); {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,159 INFO L290 TraceCheckUtils]: 85: Hoare triple {38200#(<= ~counter~0 5)} assume true; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,159 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {38200#(<= ~counter~0 5)} {38200#(<= ~counter~0 5)} #86#return; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,160 INFO L272 TraceCheckUtils]: 87: Hoare triple {38200#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,160 INFO L290 TraceCheckUtils]: 88: Hoare triple {38200#(<= ~counter~0 5)} ~cond := #in~cond; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,160 INFO L290 TraceCheckUtils]: 89: Hoare triple {38200#(<= ~counter~0 5)} assume !(0 == ~cond); {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,160 INFO L290 TraceCheckUtils]: 90: Hoare triple {38200#(<= ~counter~0 5)} assume true; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,161 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {38200#(<= ~counter~0 5)} {38200#(<= ~counter~0 5)} #88#return; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,161 INFO L272 TraceCheckUtils]: 92: Hoare triple {38200#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,161 INFO L290 TraceCheckUtils]: 93: Hoare triple {38200#(<= ~counter~0 5)} ~cond := #in~cond; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,162 INFO L290 TraceCheckUtils]: 94: Hoare triple {38200#(<= ~counter~0 5)} assume !(0 == ~cond); {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,162 INFO L290 TraceCheckUtils]: 95: Hoare triple {38200#(<= ~counter~0 5)} assume true; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,162 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {38200#(<= ~counter~0 5)} {38200#(<= ~counter~0 5)} #90#return; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,163 INFO L272 TraceCheckUtils]: 97: Hoare triple {38200#(<= ~counter~0 5)} 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)); {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,163 INFO L290 TraceCheckUtils]: 98: Hoare triple {38200#(<= ~counter~0 5)} ~cond := #in~cond; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,163 INFO L290 TraceCheckUtils]: 99: Hoare triple {38200#(<= ~counter~0 5)} assume !(0 == ~cond); {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,164 INFO L290 TraceCheckUtils]: 100: Hoare triple {38200#(<= ~counter~0 5)} assume true; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,164 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {38200#(<= ~counter~0 5)} {38200#(<= ~counter~0 5)} #92#return; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,164 INFO L290 TraceCheckUtils]: 102: Hoare triple {38200#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,165 INFO L290 TraceCheckUtils]: 103: Hoare triple {38200#(<= ~counter~0 5)} ~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; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,165 INFO L290 TraceCheckUtils]: 104: Hoare triple {38200#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38273#(<= |main_#t~post6| 5)} is VALID [2022-04-28 05:43:07,165 INFO L290 TraceCheckUtils]: 105: Hoare triple {38273#(<= |main_#t~post6| 5)} assume !(#t~post6 < 10);havoc #t~post6; {37951#false} is VALID [2022-04-28 05:43:07,165 INFO L272 TraceCheckUtils]: 106: Hoare triple {37951#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {37951#false} is VALID [2022-04-28 05:43:07,165 INFO L290 TraceCheckUtils]: 107: Hoare triple {37951#false} ~cond := #in~cond; {37951#false} is VALID [2022-04-28 05:43:07,165 INFO L290 TraceCheckUtils]: 108: Hoare triple {37951#false} assume 0 == ~cond; {37951#false} is VALID [2022-04-28 05:43:07,165 INFO L290 TraceCheckUtils]: 109: Hoare triple {37951#false} assume !false; {37951#false} is VALID [2022-04-28 05:43:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 24 proven. 221 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-28 05:43:07,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:43:07,533 INFO L290 TraceCheckUtils]: 109: Hoare triple {37951#false} assume !false; {37951#false} is VALID [2022-04-28 05:43:07,533 INFO L290 TraceCheckUtils]: 108: Hoare triple {37951#false} assume 0 == ~cond; {37951#false} is VALID [2022-04-28 05:43:07,533 INFO L290 TraceCheckUtils]: 107: Hoare triple {37951#false} ~cond := #in~cond; {37951#false} is VALID [2022-04-28 05:43:07,534 INFO L272 TraceCheckUtils]: 106: Hoare triple {37951#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {37951#false} is VALID [2022-04-28 05:43:07,534 INFO L290 TraceCheckUtils]: 105: Hoare triple {38301#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {37951#false} is VALID [2022-04-28 05:43:07,534 INFO L290 TraceCheckUtils]: 104: Hoare triple {38305#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38301#(< |main_#t~post6| 10)} is VALID [2022-04-28 05:43:07,534 INFO L290 TraceCheckUtils]: 103: Hoare triple {38305#(< ~counter~0 10)} ~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; {38305#(< ~counter~0 10)} is VALID [2022-04-28 05:43:07,535 INFO L290 TraceCheckUtils]: 102: Hoare triple {38305#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {38305#(< ~counter~0 10)} is VALID [2022-04-28 05:43:07,535 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {37950#true} {38305#(< ~counter~0 10)} #92#return; {38305#(< ~counter~0 10)} is VALID [2022-04-28 05:43:07,535 INFO L290 TraceCheckUtils]: 100: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 05:43:07,535 INFO L290 TraceCheckUtils]: 99: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 05:43:07,535 INFO L290 TraceCheckUtils]: 98: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 05:43:07,535 INFO L272 TraceCheckUtils]: 97: Hoare triple {38305#(< ~counter~0 10)} 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)); {37950#true} is VALID [2022-04-28 05:43:07,536 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {37950#true} {38305#(< ~counter~0 10)} #90#return; {38305#(< ~counter~0 10)} is VALID [2022-04-28 05:43:07,536 INFO L290 TraceCheckUtils]: 95: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 05:43:07,536 INFO L290 TraceCheckUtils]: 94: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 05:43:07,536 INFO L290 TraceCheckUtils]: 93: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 05:43:07,536 INFO L272 TraceCheckUtils]: 92: Hoare triple {38305#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {37950#true} is VALID [2022-04-28 05:43:07,536 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {37950#true} {38305#(< ~counter~0 10)} #88#return; {38305#(< ~counter~0 10)} is VALID [2022-04-28 05:43:07,537 INFO L290 TraceCheckUtils]: 90: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 05:43:07,537 INFO L290 TraceCheckUtils]: 89: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 05:43:07,537 INFO L290 TraceCheckUtils]: 88: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 05:43:07,537 INFO L272 TraceCheckUtils]: 87: Hoare triple {38305#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {37950#true} is VALID [2022-04-28 05:43:07,537 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {37950#true} {38305#(< ~counter~0 10)} #86#return; {38305#(< ~counter~0 10)} is VALID [2022-04-28 05:43:07,537 INFO L290 TraceCheckUtils]: 85: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 05:43:07,537 INFO L290 TraceCheckUtils]: 84: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 05:43:07,537 INFO L290 TraceCheckUtils]: 83: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 05:43:07,537 INFO L272 TraceCheckUtils]: 82: Hoare triple {38305#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {37950#true} is VALID [2022-04-28 05:43:07,538 INFO L290 TraceCheckUtils]: 81: Hoare triple {38305#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {38305#(< ~counter~0 10)} is VALID [2022-04-28 05:43:07,538 INFO L290 TraceCheckUtils]: 80: Hoare triple {38378#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38305#(< ~counter~0 10)} is VALID [2022-04-28 05:43:07,539 INFO L290 TraceCheckUtils]: 79: Hoare triple {38378#(< ~counter~0 9)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {38378#(< ~counter~0 9)} is VALID [2022-04-28 05:43:07,539 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {37950#true} {38378#(< ~counter~0 9)} #92#return; {38378#(< ~counter~0 9)} is VALID [2022-04-28 05:43:07,539 INFO L290 TraceCheckUtils]: 77: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 05:43:07,539 INFO L290 TraceCheckUtils]: 76: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 05:43:07,539 INFO L290 TraceCheckUtils]: 75: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 05:43:07,539 INFO L272 TraceCheckUtils]: 74: Hoare triple {38378#(< ~counter~0 9)} 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)); {37950#true} is VALID [2022-04-28 05:43:07,540 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {37950#true} {38378#(< ~counter~0 9)} #90#return; {38378#(< ~counter~0 9)} is VALID [2022-04-28 05:43:07,540 INFO L290 TraceCheckUtils]: 72: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 05:43:07,540 INFO L290 TraceCheckUtils]: 71: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 05:43:07,540 INFO L290 TraceCheckUtils]: 70: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 05:43:07,540 INFO L272 TraceCheckUtils]: 69: Hoare triple {38378#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {37950#true} is VALID [2022-04-28 05:43:07,541 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {37950#true} {38378#(< ~counter~0 9)} #88#return; {38378#(< ~counter~0 9)} is VALID [2022-04-28 05:43:07,541 INFO L290 TraceCheckUtils]: 67: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 05:43:07,541 INFO L290 TraceCheckUtils]: 66: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 05:43:07,541 INFO L290 TraceCheckUtils]: 65: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 05:43:07,541 INFO L272 TraceCheckUtils]: 64: Hoare triple {38378#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {37950#true} is VALID [2022-04-28 05:43:07,541 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37950#true} {38378#(< ~counter~0 9)} #86#return; {38378#(< ~counter~0 9)} is VALID [2022-04-28 05:43:07,541 INFO L290 TraceCheckUtils]: 62: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 05:43:07,541 INFO L290 TraceCheckUtils]: 61: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 05:43:07,541 INFO L290 TraceCheckUtils]: 60: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 05:43:07,541 INFO L272 TraceCheckUtils]: 59: Hoare triple {38378#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {37950#true} is VALID [2022-04-28 05:43:07,542 INFO L290 TraceCheckUtils]: 58: Hoare triple {38378#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {38378#(< ~counter~0 9)} is VALID [2022-04-28 05:43:07,542 INFO L290 TraceCheckUtils]: 57: Hoare triple {38448#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38378#(< ~counter~0 9)} is VALID [2022-04-28 05:43:07,542 INFO L290 TraceCheckUtils]: 56: Hoare triple {38448#(< ~counter~0 8)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {38448#(< ~counter~0 8)} is VALID [2022-04-28 05:43:07,543 INFO L290 TraceCheckUtils]: 55: Hoare triple {38448#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {38448#(< ~counter~0 8)} is VALID [2022-04-28 05:43:07,543 INFO L290 TraceCheckUtils]: 54: Hoare triple {38458#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38448#(< ~counter~0 8)} is VALID [2022-04-28 05:43:07,543 INFO L290 TraceCheckUtils]: 53: Hoare triple {38458#(< ~counter~0 7)} ~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; {38458#(< ~counter~0 7)} is VALID [2022-04-28 05:43:07,544 INFO L290 TraceCheckUtils]: 52: Hoare triple {38458#(< ~counter~0 7)} assume !(~c~0 >= ~b~0); {38458#(< ~counter~0 7)} is VALID [2022-04-28 05:43:07,544 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {37950#true} {38458#(< ~counter~0 7)} #92#return; {38458#(< ~counter~0 7)} is VALID [2022-04-28 05:43:07,544 INFO L290 TraceCheckUtils]: 50: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 05:43:07,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 05:43:07,544 INFO L290 TraceCheckUtils]: 48: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 05:43:07,544 INFO L272 TraceCheckUtils]: 47: Hoare triple {38458#(< ~counter~0 7)} 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)); {37950#true} is VALID [2022-04-28 05:43:07,545 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {37950#true} {38458#(< ~counter~0 7)} #90#return; {38458#(< ~counter~0 7)} is VALID [2022-04-28 05:43:07,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 05:43:07,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 05:43:07,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 05:43:07,545 INFO L272 TraceCheckUtils]: 42: Hoare triple {38458#(< ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {37950#true} is VALID [2022-04-28 05:43:07,545 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37950#true} {38458#(< ~counter~0 7)} #88#return; {38458#(< ~counter~0 7)} is VALID [2022-04-28 05:43:07,546 INFO L290 TraceCheckUtils]: 40: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 05:43:07,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 05:43:07,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 05:43:07,546 INFO L272 TraceCheckUtils]: 37: Hoare triple {38458#(< ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {37950#true} is VALID [2022-04-28 05:43:07,546 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {37950#true} {38458#(< ~counter~0 7)} #86#return; {38458#(< ~counter~0 7)} is VALID [2022-04-28 05:43:07,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 05:43:07,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 05:43:07,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 05:43:07,546 INFO L272 TraceCheckUtils]: 32: Hoare triple {38458#(< ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {37950#true} is VALID [2022-04-28 05:43:07,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {38458#(< ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {38458#(< ~counter~0 7)} is VALID [2022-04-28 05:43:07,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {38200#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38458#(< ~counter~0 7)} is VALID [2022-04-28 05:43:07,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {38200#(<= ~counter~0 5)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {38200#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {38130#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:07,548 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {37950#true} {38130#(<= ~counter~0 4)} #84#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 05:43:07,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 05:43:07,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 05:43:07,549 INFO L272 TraceCheckUtils]: 22: Hoare triple {38130#(<= ~counter~0 4)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {37950#true} is VALID [2022-04-28 05:43:07,549 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {37950#true} {38130#(<= ~counter~0 4)} #82#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 05:43:07,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 05:43:07,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 05:43:07,549 INFO L272 TraceCheckUtils]: 17: Hoare triple {38130#(<= ~counter~0 4)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {37950#true} is VALID [2022-04-28 05:43:07,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {38130#(<= ~counter~0 4)} ~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; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,550 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37950#true} {38130#(<= ~counter~0 4)} #80#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 05:43:07,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 05:43:07,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 05:43:07,550 INFO L272 TraceCheckUtils]: 11: Hoare triple {38130#(<= ~counter~0 4)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37950#true} is VALID [2022-04-28 05:43:07,550 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37950#true} {38130#(<= ~counter~0 4)} #78#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 05:43:07,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 05:43:07,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 05:43:07,551 INFO L272 TraceCheckUtils]: 6: Hoare triple {38130#(<= ~counter~0 4)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {37950#true} is VALID [2022-04-28 05:43:07,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {38130#(<= ~counter~0 4)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {38130#(<= ~counter~0 4)} call #t~ret8 := main(); {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38130#(<= ~counter~0 4)} {37950#true} #98#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {38130#(<= ~counter~0 4)} assume true; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {37950#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);~counter~0 := 0; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:07,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {37950#true} call ULTIMATE.init(); {37950#true} is VALID [2022-04-28 05:43:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 24 proven. 29 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-28 05:43:07,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:43:07,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894948985] [2022-04-28 05:43:07,552 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:43:07,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049286393] [2022-04-28 05:43:07,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049286393] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:43:07,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:43:07,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 05:43:07,553 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:43:07,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1847248272] [2022-04-28 05:43:07,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1847248272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:07,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:07,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:43:07,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121605344] [2022-04-28 05:43:07,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:43:07,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 110 [2022-04-28 05:43:07,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:43:07,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:43:07,609 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 05:43:07,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:43:07,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:07,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:43:07,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:43:07,610 INFO L87 Difference]: Start difference. First operand 364 states and 479 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:43:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:08,752 INFO L93 Difference]: Finished difference Result 434 states and 549 transitions. [2022-04-28 05:43:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:43:08,753 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 110 [2022-04-28 05:43:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:43:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:43:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2022-04-28 05:43:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:43:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2022-04-28 05:43:08,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 133 transitions. [2022-04-28 05:43:08,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:08,856 INFO L225 Difference]: With dead ends: 434 [2022-04-28 05:43:08,856 INFO L226 Difference]: Without dead ends: 425 [2022-04-28 05:43:08,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:43:08,857 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:43:08,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 185 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:43:08,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-04-28 05:43:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 423. [2022-04-28 05:43:09,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:43:09,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 425 states. Second operand has 423 states, 272 states have (on average 1.2022058823529411) internal successors, (327), 279 states have internal predecessors, (327), 106 states have call successors, (106), 45 states have call predecessors, (106), 44 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-28 05:43:09,521 INFO L74 IsIncluded]: Start isIncluded. First operand 425 states. Second operand has 423 states, 272 states have (on average 1.2022058823529411) internal successors, (327), 279 states have internal predecessors, (327), 106 states have call successors, (106), 45 states have call predecessors, (106), 44 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-28 05:43:09,521 INFO L87 Difference]: Start difference. First operand 425 states. Second operand has 423 states, 272 states have (on average 1.2022058823529411) internal successors, (327), 279 states have internal predecessors, (327), 106 states have call successors, (106), 45 states have call predecessors, (106), 44 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-28 05:43:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:09,529 INFO L93 Difference]: Finished difference Result 425 states and 538 transitions. [2022-04-28 05:43:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 538 transitions. [2022-04-28 05:43:09,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:09,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:09,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 423 states, 272 states have (on average 1.2022058823529411) internal successors, (327), 279 states have internal predecessors, (327), 106 states have call successors, (106), 45 states have call predecessors, (106), 44 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) Second operand 425 states. [2022-04-28 05:43:09,530 INFO L87 Difference]: Start difference. First operand has 423 states, 272 states have (on average 1.2022058823529411) internal successors, (327), 279 states have internal predecessors, (327), 106 states have call successors, (106), 45 states have call predecessors, (106), 44 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) Second operand 425 states. [2022-04-28 05:43:09,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:09,538 INFO L93 Difference]: Finished difference Result 425 states and 538 transitions. [2022-04-28 05:43:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 538 transitions. [2022-04-28 05:43:09,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:09,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:09,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:43:09,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:43:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 272 states have (on average 1.2022058823529411) internal successors, (327), 279 states have internal predecessors, (327), 106 states have call successors, (106), 45 states have call predecessors, (106), 44 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-28 05:43:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 536 transitions. [2022-04-28 05:43:09,549 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 536 transitions. Word has length 110 [2022-04-28 05:43:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:43:09,549 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 536 transitions. [2022-04-28 05:43:09,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:43:09,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 423 states and 536 transitions. [2022-04-28 05:43:10,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 536 edges. 536 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 536 transitions. [2022-04-28 05:43:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 05:43:10,279 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:43:10,279 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 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] [2022-04-28 05:43:10,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 05:43:10,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 05:43:10,480 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:43:10,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:43:10,480 INFO L85 PathProgramCache]: Analyzing trace with hash -289933735, now seen corresponding path program 5 times [2022-04-28 05:43:10,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:10,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1176905052] [2022-04-28 05:43:10,480 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:43:10,481 INFO L85 PathProgramCache]: Analyzing trace with hash -289933735, now seen corresponding path program 6 times [2022-04-28 05:43:10,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:43:10,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82992635] [2022-04-28 05:43:10,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:43:10,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:43:10,490 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:43:10,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844936449] [2022-04-28 05:43:10,490 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:43:10,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:43:10,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:43:10,491 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:43:10,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 05:43:10,548 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:43:10,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:43:10,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:43:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:10,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:43:10,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {41195#true} call ULTIMATE.init(); {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {41195#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);~counter~0 := 0; {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41195#true} {41195#true} #98#return; {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {41195#true} call #t~ret8 := main(); {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {41195#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L272 TraceCheckUtils]: 6: Hoare triple {41195#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41195#true} {41195#true} #78#return; {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L272 TraceCheckUtils]: 11: Hoare triple {41195#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41195#true} {41195#true} #80#return; {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {41195#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; {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L272 TraceCheckUtils]: 17: Hoare triple {41195#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:10,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41195#true} {41195#true} #82#return; {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L272 TraceCheckUtils]: 22: Hoare triple {41195#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41195#true} {41195#true} #84#return; {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {41195#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {41195#true} assume !!(#t~post6 < 10);havoc #t~post6; {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {41195#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {41195#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {41195#true} assume !!(#t~post7 < 10);havoc #t~post7; {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L272 TraceCheckUtils]: 32: Hoare triple {41195#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {41195#true} {41195#true} #86#return; {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L272 TraceCheckUtils]: 37: Hoare triple {41195#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:10,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:10,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:10,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,872 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {41195#true} {41195#true} #88#return; {41195#true} is VALID [2022-04-28 05:43:10,872 INFO L272 TraceCheckUtils]: 42: Hoare triple {41195#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:10,872 INFO L290 TraceCheckUtils]: 43: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:10,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:10,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,872 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {41195#true} {41195#true} #90#return; {41195#true} is VALID [2022-04-28 05:43:10,872 INFO L272 TraceCheckUtils]: 47: Hoare triple {41195#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)); {41195#true} is VALID [2022-04-28 05:43:10,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:10,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:10,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,872 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {41195#true} {41195#true} #92#return; {41195#true} is VALID [2022-04-28 05:43:10,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {41195#true} assume !(~c~0 >= ~b~0); {41356#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:43:10,873 INFO L290 TraceCheckUtils]: 53: Hoare triple {41356#(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; {41360#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:43:10,873 INFO L290 TraceCheckUtils]: 54: Hoare triple {41360#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41360#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:43:10,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {41360#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {41360#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:43:10,874 INFO L290 TraceCheckUtils]: 56: Hoare triple {41360#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:43:10,874 INFO L290 TraceCheckUtils]: 57: Hoare triple {41370#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:43:10,874 INFO L290 TraceCheckUtils]: 58: Hoare triple {41370#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:43:10,874 INFO L272 TraceCheckUtils]: 59: Hoare triple {41370#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:10,874 INFO L290 TraceCheckUtils]: 60: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:10,874 INFO L290 TraceCheckUtils]: 61: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:10,874 INFO L290 TraceCheckUtils]: 62: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,875 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {41195#true} {41370#(< main_~b~0 main_~c~0)} #86#return; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:43:10,875 INFO L272 TraceCheckUtils]: 64: Hoare triple {41370#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:10,875 INFO L290 TraceCheckUtils]: 65: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:10,875 INFO L290 TraceCheckUtils]: 66: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:10,875 INFO L290 TraceCheckUtils]: 67: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,876 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {41195#true} {41370#(< main_~b~0 main_~c~0)} #88#return; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:43:10,876 INFO L272 TraceCheckUtils]: 69: Hoare triple {41370#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:10,876 INFO L290 TraceCheckUtils]: 70: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:10,876 INFO L290 TraceCheckUtils]: 71: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:10,876 INFO L290 TraceCheckUtils]: 72: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,876 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {41195#true} {41370#(< main_~b~0 main_~c~0)} #90#return; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:43:10,876 INFO L272 TraceCheckUtils]: 74: Hoare triple {41370#(< 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)); {41195#true} is VALID [2022-04-28 05:43:10,876 INFO L290 TraceCheckUtils]: 75: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:10,876 INFO L290 TraceCheckUtils]: 76: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:10,876 INFO L290 TraceCheckUtils]: 77: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,877 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {41195#true} {41370#(< main_~b~0 main_~c~0)} #92#return; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:43:10,878 INFO L290 TraceCheckUtils]: 79: Hoare triple {41370#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {41440#(< 0 main_~c~0)} is VALID [2022-04-28 05:43:10,879 INFO L290 TraceCheckUtils]: 80: Hoare triple {41440#(< 0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41440#(< 0 main_~c~0)} is VALID [2022-04-28 05:43:10,879 INFO L290 TraceCheckUtils]: 81: Hoare triple {41440#(< 0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {41440#(< 0 main_~c~0)} is VALID [2022-04-28 05:43:10,879 INFO L272 TraceCheckUtils]: 82: Hoare triple {41440#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:10,879 INFO L290 TraceCheckUtils]: 83: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:10,879 INFO L290 TraceCheckUtils]: 84: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:10,879 INFO L290 TraceCheckUtils]: 85: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,879 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {41195#true} {41440#(< 0 main_~c~0)} #86#return; {41440#(< 0 main_~c~0)} is VALID [2022-04-28 05:43:10,880 INFO L272 TraceCheckUtils]: 87: Hoare triple {41440#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:10,880 INFO L290 TraceCheckUtils]: 88: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:10,880 INFO L290 TraceCheckUtils]: 89: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:10,880 INFO L290 TraceCheckUtils]: 90: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,880 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {41195#true} {41440#(< 0 main_~c~0)} #88#return; {41440#(< 0 main_~c~0)} is VALID [2022-04-28 05:43:10,880 INFO L272 TraceCheckUtils]: 92: Hoare triple {41440#(< 0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:10,880 INFO L290 TraceCheckUtils]: 93: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:10,880 INFO L290 TraceCheckUtils]: 94: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:10,880 INFO L290 TraceCheckUtils]: 95: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,881 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {41195#true} {41440#(< 0 main_~c~0)} #90#return; {41440#(< 0 main_~c~0)} is VALID [2022-04-28 05:43:10,881 INFO L272 TraceCheckUtils]: 97: Hoare triple {41440#(< 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)); {41195#true} is VALID [2022-04-28 05:43:10,881 INFO L290 TraceCheckUtils]: 98: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:10,881 INFO L290 TraceCheckUtils]: 99: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:10,881 INFO L290 TraceCheckUtils]: 100: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:10,882 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {41195#true} {41440#(< 0 main_~c~0)} #92#return; {41440#(< 0 main_~c~0)} is VALID [2022-04-28 05:43:10,882 INFO L290 TraceCheckUtils]: 102: Hoare triple {41440#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {41440#(< 0 main_~c~0)} is VALID [2022-04-28 05:43:10,882 INFO L290 TraceCheckUtils]: 103: Hoare triple {41440#(< 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; {41513#(< 0 main_~b~0)} is VALID [2022-04-28 05:43:10,883 INFO L290 TraceCheckUtils]: 104: Hoare triple {41513#(< 0 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41513#(< 0 main_~b~0)} is VALID [2022-04-28 05:43:10,883 INFO L290 TraceCheckUtils]: 105: Hoare triple {41513#(< 0 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {41513#(< 0 main_~b~0)} is VALID [2022-04-28 05:43:10,883 INFO L290 TraceCheckUtils]: 106: Hoare triple {41513#(< 0 main_~b~0)} assume !(0 != ~b~0); {41196#false} is VALID [2022-04-28 05:43:10,883 INFO L272 TraceCheckUtils]: 107: Hoare triple {41196#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {41196#false} is VALID [2022-04-28 05:43:10,883 INFO L290 TraceCheckUtils]: 108: Hoare triple {41196#false} ~cond := #in~cond; {41196#false} is VALID [2022-04-28 05:43:10,883 INFO L290 TraceCheckUtils]: 109: Hoare triple {41196#false} assume 0 == ~cond; {41196#false} is VALID [2022-04-28 05:43:10,883 INFO L290 TraceCheckUtils]: 110: Hoare triple {41196#false} assume !false; {41196#false} is VALID [2022-04-28 05:43:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 44 proven. 11 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-28 05:43:10,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:43:11,190 INFO L290 TraceCheckUtils]: 110: Hoare triple {41196#false} assume !false; {41196#false} is VALID [2022-04-28 05:43:11,190 INFO L290 TraceCheckUtils]: 109: Hoare triple {41196#false} assume 0 == ~cond; {41196#false} is VALID [2022-04-28 05:43:11,190 INFO L290 TraceCheckUtils]: 108: Hoare triple {41196#false} ~cond := #in~cond; {41196#false} is VALID [2022-04-28 05:43:11,190 INFO L272 TraceCheckUtils]: 107: Hoare triple {41196#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {41196#false} is VALID [2022-04-28 05:43:11,190 INFO L290 TraceCheckUtils]: 106: Hoare triple {41513#(< 0 main_~b~0)} assume !(0 != ~b~0); {41196#false} is VALID [2022-04-28 05:43:11,190 INFO L290 TraceCheckUtils]: 105: Hoare triple {41513#(< 0 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {41513#(< 0 main_~b~0)} is VALID [2022-04-28 05:43:11,191 INFO L290 TraceCheckUtils]: 104: Hoare triple {41513#(< 0 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41513#(< 0 main_~b~0)} is VALID [2022-04-28 05:43:11,191 INFO L290 TraceCheckUtils]: 103: Hoare triple {41440#(< 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; {41513#(< 0 main_~b~0)} is VALID [2022-04-28 05:43:11,191 INFO L290 TraceCheckUtils]: 102: Hoare triple {41440#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {41440#(< 0 main_~c~0)} is VALID [2022-04-28 05:43:11,192 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {41195#true} {41440#(< 0 main_~c~0)} #92#return; {41440#(< 0 main_~c~0)} is VALID [2022-04-28 05:43:11,192 INFO L290 TraceCheckUtils]: 100: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,192 INFO L290 TraceCheckUtils]: 99: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:11,192 INFO L290 TraceCheckUtils]: 98: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:11,192 INFO L272 TraceCheckUtils]: 97: Hoare triple {41440#(< 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)); {41195#true} is VALID [2022-04-28 05:43:11,193 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {41195#true} {41440#(< 0 main_~c~0)} #90#return; {41440#(< 0 main_~c~0)} is VALID [2022-04-28 05:43:11,193 INFO L290 TraceCheckUtils]: 95: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,193 INFO L290 TraceCheckUtils]: 94: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:11,193 INFO L290 TraceCheckUtils]: 93: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:11,193 INFO L272 TraceCheckUtils]: 92: Hoare triple {41440#(< 0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:11,193 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {41195#true} {41440#(< 0 main_~c~0)} #88#return; {41440#(< 0 main_~c~0)} is VALID [2022-04-28 05:43:11,193 INFO L290 TraceCheckUtils]: 90: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,194 INFO L290 TraceCheckUtils]: 89: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:11,194 INFO L290 TraceCheckUtils]: 88: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:11,194 INFO L272 TraceCheckUtils]: 87: Hoare triple {41440#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:11,194 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {41195#true} {41440#(< 0 main_~c~0)} #86#return; {41440#(< 0 main_~c~0)} is VALID [2022-04-28 05:43:11,194 INFO L290 TraceCheckUtils]: 85: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,194 INFO L290 TraceCheckUtils]: 84: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:11,194 INFO L290 TraceCheckUtils]: 83: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:11,194 INFO L272 TraceCheckUtils]: 82: Hoare triple {41440#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:11,194 INFO L290 TraceCheckUtils]: 81: Hoare triple {41440#(< 0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {41440#(< 0 main_~c~0)} is VALID [2022-04-28 05:43:11,195 INFO L290 TraceCheckUtils]: 80: Hoare triple {41440#(< 0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41440#(< 0 main_~c~0)} is VALID [2022-04-28 05:43:11,196 INFO L290 TraceCheckUtils]: 79: Hoare triple {41370#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {41440#(< 0 main_~c~0)} is VALID [2022-04-28 05:43:11,197 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {41195#true} {41370#(< main_~b~0 main_~c~0)} #92#return; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:43:11,197 INFO L290 TraceCheckUtils]: 77: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,197 INFO L290 TraceCheckUtils]: 76: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:11,197 INFO L290 TraceCheckUtils]: 75: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:11,197 INFO L272 TraceCheckUtils]: 74: Hoare triple {41370#(< 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)); {41195#true} is VALID [2022-04-28 05:43:11,197 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {41195#true} {41370#(< main_~b~0 main_~c~0)} #90#return; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:43:11,197 INFO L290 TraceCheckUtils]: 72: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,197 INFO L290 TraceCheckUtils]: 71: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:11,197 INFO L290 TraceCheckUtils]: 70: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:11,198 INFO L272 TraceCheckUtils]: 69: Hoare triple {41370#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:11,198 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {41195#true} {41370#(< main_~b~0 main_~c~0)} #88#return; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:43:11,198 INFO L290 TraceCheckUtils]: 67: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,198 INFO L290 TraceCheckUtils]: 66: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:11,198 INFO L290 TraceCheckUtils]: 65: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:11,198 INFO L272 TraceCheckUtils]: 64: Hoare triple {41370#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:11,199 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {41195#true} {41370#(< main_~b~0 main_~c~0)} #86#return; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:43:11,199 INFO L290 TraceCheckUtils]: 62: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,199 INFO L290 TraceCheckUtils]: 61: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:11,199 INFO L290 TraceCheckUtils]: 60: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:11,199 INFO L272 TraceCheckUtils]: 59: Hoare triple {41370#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:11,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {41370#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:43:11,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {41370#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:43:11,200 INFO L290 TraceCheckUtils]: 56: Hoare triple {41360#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:43:11,200 INFO L290 TraceCheckUtils]: 55: Hoare triple {41360#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {41360#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:43:11,200 INFO L290 TraceCheckUtils]: 54: Hoare triple {41360#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41360#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:43:11,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {41356#(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; {41360#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:43:11,201 INFO L290 TraceCheckUtils]: 52: Hoare triple {41195#true} assume !(~c~0 >= ~b~0); {41356#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:43:11,201 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {41195#true} {41195#true} #92#return; {41195#true} is VALID [2022-04-28 05:43:11,201 INFO L290 TraceCheckUtils]: 50: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:11,201 INFO L290 TraceCheckUtils]: 48: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:11,201 INFO L272 TraceCheckUtils]: 47: Hoare triple {41195#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)); {41195#true} is VALID [2022-04-28 05:43:11,201 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {41195#true} {41195#true} #90#return; {41195#true} is VALID [2022-04-28 05:43:11,201 INFO L290 TraceCheckUtils]: 45: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,201 INFO L290 TraceCheckUtils]: 44: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:11,201 INFO L290 TraceCheckUtils]: 43: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:11,201 INFO L272 TraceCheckUtils]: 42: Hoare triple {41195#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:11,201 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {41195#true} {41195#true} #88#return; {41195#true} is VALID [2022-04-28 05:43:11,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L272 TraceCheckUtils]: 37: Hoare triple {41195#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {41195#true} {41195#true} #86#return; {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L272 TraceCheckUtils]: 32: Hoare triple {41195#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {41195#true} assume !!(#t~post7 < 10);havoc #t~post7; {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {41195#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {41195#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {41195#true} assume !!(#t~post6 < 10);havoc #t~post6; {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {41195#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41195#true} {41195#true} #84#return; {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L272 TraceCheckUtils]: 22: Hoare triple {41195#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41195#true} {41195#true} #82#return; {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:11,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L272 TraceCheckUtils]: 17: Hoare triple {41195#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {41195#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; {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41195#true} {41195#true} #80#return; {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L272 TraceCheckUtils]: 11: Hoare triple {41195#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41195#true} {41195#true} #78#return; {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L272 TraceCheckUtils]: 6: Hoare triple {41195#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {41195#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {41195#true} call #t~ret8 := main(); {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41195#true} {41195#true} #98#return; {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {41195#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);~counter~0 := 0; {41195#true} is VALID [2022-04-28 05:43:11,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {41195#true} call ULTIMATE.init(); {41195#true} is VALID [2022-04-28 05:43:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 44 proven. 11 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-28 05:43:11,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:43:11,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82992635] [2022-04-28 05:43:11,204 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:43:11,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844936449] [2022-04-28 05:43:11,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844936449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:43:11,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:43:11,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-04-28 05:43:11,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:43:11,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1176905052] [2022-04-28 05:43:11,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1176905052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:11,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:11,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:43:11,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136062996] [2022-04-28 05:43:11,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:43:11,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 111 [2022-04-28 05:43:11,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:43:11,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-04-28 05:43:11,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:11,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:43:11,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:11,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:43:11,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 05:43:11,262 INFO L87 Difference]: Start difference. First operand 423 states and 536 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-04-28 05:43:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:13,451 INFO L93 Difference]: Finished difference Result 589 states and 810 transitions. [2022-04-28 05:43:13,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 05:43:13,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 111 [2022-04-28 05:43:13,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:43:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-04-28 05:43:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 178 transitions. [2022-04-28 05:43:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-04-28 05:43:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 178 transitions. [2022-04-28 05:43:13,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 178 transitions. [2022-04-28 05:43:13,610 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 05:43:13,633 INFO L225 Difference]: With dead ends: 589 [2022-04-28 05:43:13,633 INFO L226 Difference]: Without dead ends: 581 [2022-04-28 05:43:13,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 220 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-04-28 05:43:13,633 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 32 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 05:43:13,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 368 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 05:43:13,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-04-28 05:43:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 470. [2022-04-28 05:43:14,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:43:14,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 581 states. Second operand has 470 states, 301 states have (on average 1.2259136212624584) internal successors, (369), 306 states have internal predecessors, (369), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2022-04-28 05:43:14,507 INFO L74 IsIncluded]: Start isIncluded. First operand 581 states. Second operand has 470 states, 301 states have (on average 1.2259136212624584) internal successors, (369), 306 states have internal predecessors, (369), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2022-04-28 05:43:14,508 INFO L87 Difference]: Start difference. First operand 581 states. Second operand has 470 states, 301 states have (on average 1.2259136212624584) internal successors, (369), 306 states have internal predecessors, (369), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2022-04-28 05:43:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:14,522 INFO L93 Difference]: Finished difference Result 581 states and 798 transitions. [2022-04-28 05:43:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 798 transitions. [2022-04-28 05:43:14,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:14,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:14,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 470 states, 301 states have (on average 1.2259136212624584) internal successors, (369), 306 states have internal predecessors, (369), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) Second operand 581 states. [2022-04-28 05:43:14,526 INFO L87 Difference]: Start difference. First operand has 470 states, 301 states have (on average 1.2259136212624584) internal successors, (369), 306 states have internal predecessors, (369), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) Second operand 581 states. [2022-04-28 05:43:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:14,541 INFO L93 Difference]: Finished difference Result 581 states and 798 transitions. [2022-04-28 05:43:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 798 transitions. [2022-04-28 05:43:14,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:14,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:14,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:43:14,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:43:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 301 states have (on average 1.2259136212624584) internal successors, (369), 306 states have internal predecessors, (369), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2022-04-28 05:43:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 614 transitions. [2022-04-28 05:43:14,555 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 614 transitions. Word has length 111 [2022-04-28 05:43:14,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:43:14,555 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 614 transitions. [2022-04-28 05:43:14,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-04-28 05:43:14,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 470 states and 614 transitions. [2022-04-28 05:43:15,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 614 edges. 614 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 614 transitions. [2022-04-28 05:43:15,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-28 05:43:15,457 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:43:15,457 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:43:15,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 05:43:15,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 05:43:15,657 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:43:15,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:43:15,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1282766646, now seen corresponding path program 3 times [2022-04-28 05:43:15,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:15,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1172861520] [2022-04-28 05:43:15,658 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:43:15,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1282766646, now seen corresponding path program 4 times [2022-04-28 05:43:15,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:43:15,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919504768] [2022-04-28 05:43:15,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:43:15,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:43:15,669 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:43:15,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1045110476] [2022-04-28 05:43:15,669 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:43:15,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:43:15,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:43:15,670 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:43:15,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 05:43:15,726 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:43:15,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:43:15,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 05:43:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:15,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:43:16,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {45173#true} call ULTIMATE.init(); {45173#true} is VALID [2022-04-28 05:43:16,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {45173#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);~counter~0 := 0; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {45181#(<= ~counter~0 0)} assume true; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45181#(<= ~counter~0 0)} {45173#true} #98#return; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {45181#(<= ~counter~0 0)} call #t~ret8 := main(); {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {45181#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,130 INFO L272 TraceCheckUtils]: 6: Hoare triple {45181#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {45181#(<= ~counter~0 0)} ~cond := #in~cond; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {45181#(<= ~counter~0 0)} assume !(0 == ~cond); {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {45181#(<= ~counter~0 0)} assume true; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,131 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45181#(<= ~counter~0 0)} {45181#(<= ~counter~0 0)} #78#return; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,131 INFO L272 TraceCheckUtils]: 11: Hoare triple {45181#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {45181#(<= ~counter~0 0)} ~cond := #in~cond; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {45181#(<= ~counter~0 0)} assume !(0 == ~cond); {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {45181#(<= ~counter~0 0)} assume true; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,132 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45181#(<= ~counter~0 0)} {45181#(<= ~counter~0 0)} #80#return; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {45181#(<= ~counter~0 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; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,133 INFO L272 TraceCheckUtils]: 17: Hoare triple {45181#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {45181#(<= ~counter~0 0)} ~cond := #in~cond; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {45181#(<= ~counter~0 0)} assume !(0 == ~cond); {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {45181#(<= ~counter~0 0)} assume true; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,134 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {45181#(<= ~counter~0 0)} {45181#(<= ~counter~0 0)} #82#return; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,134 INFO L272 TraceCheckUtils]: 22: Hoare triple {45181#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {45181#(<= ~counter~0 0)} ~cond := #in~cond; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {45181#(<= ~counter~0 0)} assume !(0 == ~cond); {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {45181#(<= ~counter~0 0)} assume true; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,135 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {45181#(<= ~counter~0 0)} {45181#(<= ~counter~0 0)} #84#return; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:16,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {45181#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45260#(<= ~counter~0 1)} is VALID [2022-04-28 05:43:16,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {45260#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {45260#(<= ~counter~0 1)} is VALID [2022-04-28 05:43:16,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {45260#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {45260#(<= ~counter~0 1)} is VALID [2022-04-28 05:43:16,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {45260#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {45270#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,138 INFO L272 TraceCheckUtils]: 32: Hoare triple {45270#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {45270#(<= ~counter~0 2)} ~cond := #in~cond; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {45270#(<= ~counter~0 2)} assume !(0 == ~cond); {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {45270#(<= ~counter~0 2)} assume true; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,139 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {45270#(<= ~counter~0 2)} {45270#(<= ~counter~0 2)} #86#return; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,139 INFO L272 TraceCheckUtils]: 37: Hoare triple {45270#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {45270#(<= ~counter~0 2)} ~cond := #in~cond; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {45270#(<= ~counter~0 2)} assume !(0 == ~cond); {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {45270#(<= ~counter~0 2)} assume true; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,141 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {45270#(<= ~counter~0 2)} {45270#(<= ~counter~0 2)} #88#return; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,141 INFO L272 TraceCheckUtils]: 42: Hoare triple {45270#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {45270#(<= ~counter~0 2)} ~cond := #in~cond; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,142 INFO L290 TraceCheckUtils]: 44: Hoare triple {45270#(<= ~counter~0 2)} assume !(0 == ~cond); {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,142 INFO L290 TraceCheckUtils]: 45: Hoare triple {45270#(<= ~counter~0 2)} assume true; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,142 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {45270#(<= ~counter~0 2)} {45270#(<= ~counter~0 2)} #90#return; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,143 INFO L272 TraceCheckUtils]: 47: Hoare triple {45270#(<= ~counter~0 2)} 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)); {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,143 INFO L290 TraceCheckUtils]: 48: Hoare triple {45270#(<= ~counter~0 2)} ~cond := #in~cond; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,143 INFO L290 TraceCheckUtils]: 49: Hoare triple {45270#(<= ~counter~0 2)} assume !(0 == ~cond); {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,143 INFO L290 TraceCheckUtils]: 50: Hoare triple {45270#(<= ~counter~0 2)} assume true; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,144 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {45270#(<= ~counter~0 2)} {45270#(<= ~counter~0 2)} #92#return; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,144 INFO L290 TraceCheckUtils]: 52: Hoare triple {45270#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:16,145 INFO L290 TraceCheckUtils]: 53: Hoare triple {45270#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,145 INFO L290 TraceCheckUtils]: 54: Hoare triple {45340#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,145 INFO L272 TraceCheckUtils]: 55: Hoare triple {45340#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,146 INFO L290 TraceCheckUtils]: 56: Hoare triple {45340#(<= ~counter~0 3)} ~cond := #in~cond; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,146 INFO L290 TraceCheckUtils]: 57: Hoare triple {45340#(<= ~counter~0 3)} assume !(0 == ~cond); {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,146 INFO L290 TraceCheckUtils]: 58: Hoare triple {45340#(<= ~counter~0 3)} assume true; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,147 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {45340#(<= ~counter~0 3)} {45340#(<= ~counter~0 3)} #86#return; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,147 INFO L272 TraceCheckUtils]: 60: Hoare triple {45340#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,147 INFO L290 TraceCheckUtils]: 61: Hoare triple {45340#(<= ~counter~0 3)} ~cond := #in~cond; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,147 INFO L290 TraceCheckUtils]: 62: Hoare triple {45340#(<= ~counter~0 3)} assume !(0 == ~cond); {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,148 INFO L290 TraceCheckUtils]: 63: Hoare triple {45340#(<= ~counter~0 3)} assume true; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,148 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {45340#(<= ~counter~0 3)} {45340#(<= ~counter~0 3)} #88#return; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,149 INFO L272 TraceCheckUtils]: 65: Hoare triple {45340#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,149 INFO L290 TraceCheckUtils]: 66: Hoare triple {45340#(<= ~counter~0 3)} ~cond := #in~cond; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,149 INFO L290 TraceCheckUtils]: 67: Hoare triple {45340#(<= ~counter~0 3)} assume !(0 == ~cond); {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,149 INFO L290 TraceCheckUtils]: 68: Hoare triple {45340#(<= ~counter~0 3)} assume true; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,150 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {45340#(<= ~counter~0 3)} {45340#(<= ~counter~0 3)} #90#return; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,150 INFO L272 TraceCheckUtils]: 70: Hoare triple {45340#(<= ~counter~0 3)} 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)); {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,150 INFO L290 TraceCheckUtils]: 71: Hoare triple {45340#(<= ~counter~0 3)} ~cond := #in~cond; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,151 INFO L290 TraceCheckUtils]: 72: Hoare triple {45340#(<= ~counter~0 3)} assume !(0 == ~cond); {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,151 INFO L290 TraceCheckUtils]: 73: Hoare triple {45340#(<= ~counter~0 3)} assume true; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,151 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {45340#(<= ~counter~0 3)} {45340#(<= ~counter~0 3)} #92#return; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,152 INFO L290 TraceCheckUtils]: 75: Hoare triple {45340#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:16,152 INFO L290 TraceCheckUtils]: 76: Hoare triple {45340#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,153 INFO L290 TraceCheckUtils]: 77: Hoare triple {45410#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,153 INFO L272 TraceCheckUtils]: 78: Hoare triple {45410#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,153 INFO L290 TraceCheckUtils]: 79: Hoare triple {45410#(<= ~counter~0 4)} ~cond := #in~cond; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,153 INFO L290 TraceCheckUtils]: 80: Hoare triple {45410#(<= ~counter~0 4)} assume !(0 == ~cond); {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,154 INFO L290 TraceCheckUtils]: 81: Hoare triple {45410#(<= ~counter~0 4)} assume true; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,154 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {45410#(<= ~counter~0 4)} {45410#(<= ~counter~0 4)} #86#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,154 INFO L272 TraceCheckUtils]: 83: Hoare triple {45410#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,155 INFO L290 TraceCheckUtils]: 84: Hoare triple {45410#(<= ~counter~0 4)} ~cond := #in~cond; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,155 INFO L290 TraceCheckUtils]: 85: Hoare triple {45410#(<= ~counter~0 4)} assume !(0 == ~cond); {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,155 INFO L290 TraceCheckUtils]: 86: Hoare triple {45410#(<= ~counter~0 4)} assume true; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,156 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {45410#(<= ~counter~0 4)} {45410#(<= ~counter~0 4)} #88#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,156 INFO L272 TraceCheckUtils]: 88: Hoare triple {45410#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,156 INFO L290 TraceCheckUtils]: 89: Hoare triple {45410#(<= ~counter~0 4)} ~cond := #in~cond; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,157 INFO L290 TraceCheckUtils]: 90: Hoare triple {45410#(<= ~counter~0 4)} assume !(0 == ~cond); {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,157 INFO L290 TraceCheckUtils]: 91: Hoare triple {45410#(<= ~counter~0 4)} assume true; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,157 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {45410#(<= ~counter~0 4)} {45410#(<= ~counter~0 4)} #90#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,158 INFO L272 TraceCheckUtils]: 93: Hoare triple {45410#(<= ~counter~0 4)} 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)); {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,158 INFO L290 TraceCheckUtils]: 94: Hoare triple {45410#(<= ~counter~0 4)} ~cond := #in~cond; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,158 INFO L290 TraceCheckUtils]: 95: Hoare triple {45410#(<= ~counter~0 4)} assume !(0 == ~cond); {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,158 INFO L290 TraceCheckUtils]: 96: Hoare triple {45410#(<= ~counter~0 4)} assume true; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,159 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {45410#(<= ~counter~0 4)} {45410#(<= ~counter~0 4)} #92#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,159 INFO L290 TraceCheckUtils]: 98: Hoare triple {45410#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,159 INFO L290 TraceCheckUtils]: 99: Hoare triple {45410#(<= ~counter~0 4)} ~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; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,160 INFO L290 TraceCheckUtils]: 100: Hoare triple {45410#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45483#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:16,160 INFO L290 TraceCheckUtils]: 101: Hoare triple {45483#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {45483#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:16,160 INFO L290 TraceCheckUtils]: 102: Hoare triple {45483#(<= ~counter~0 5)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {45483#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:16,161 INFO L290 TraceCheckUtils]: 103: Hoare triple {45483#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45493#(<= |main_#t~post7| 5)} is VALID [2022-04-28 05:43:16,161 INFO L290 TraceCheckUtils]: 104: Hoare triple {45493#(<= |main_#t~post7| 5)} assume !(#t~post7 < 10);havoc #t~post7; {45174#false} is VALID [2022-04-28 05:43:16,161 INFO L290 TraceCheckUtils]: 105: Hoare triple {45174#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; {45174#false} is VALID [2022-04-28 05:43:16,161 INFO L290 TraceCheckUtils]: 106: Hoare triple {45174#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45174#false} is VALID [2022-04-28 05:43:16,161 INFO L290 TraceCheckUtils]: 107: Hoare triple {45174#false} assume !(#t~post6 < 10);havoc #t~post6; {45174#false} is VALID [2022-04-28 05:43:16,161 INFO L272 TraceCheckUtils]: 108: Hoare triple {45174#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {45174#false} is VALID [2022-04-28 05:43:16,161 INFO L290 TraceCheckUtils]: 109: Hoare triple {45174#false} ~cond := #in~cond; {45174#false} is VALID [2022-04-28 05:43:16,161 INFO L290 TraceCheckUtils]: 110: Hoare triple {45174#false} assume 0 == ~cond; {45174#false} is VALID [2022-04-28 05:43:16,161 INFO L290 TraceCheckUtils]: 111: Hoare triple {45174#false} assume !false; {45174#false} is VALID [2022-04-28 05:43:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 29 proven. 222 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-28 05:43:16,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:43:16,524 INFO L290 TraceCheckUtils]: 111: Hoare triple {45174#false} assume !false; {45174#false} is VALID [2022-04-28 05:43:16,524 INFO L290 TraceCheckUtils]: 110: Hoare triple {45174#false} assume 0 == ~cond; {45174#false} is VALID [2022-04-28 05:43:16,524 INFO L290 TraceCheckUtils]: 109: Hoare triple {45174#false} ~cond := #in~cond; {45174#false} is VALID [2022-04-28 05:43:16,524 INFO L272 TraceCheckUtils]: 108: Hoare triple {45174#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {45174#false} is VALID [2022-04-28 05:43:16,524 INFO L290 TraceCheckUtils]: 107: Hoare triple {45174#false} assume !(#t~post6 < 10);havoc #t~post6; {45174#false} is VALID [2022-04-28 05:43:16,524 INFO L290 TraceCheckUtils]: 106: Hoare triple {45174#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45174#false} is VALID [2022-04-28 05:43:16,524 INFO L290 TraceCheckUtils]: 105: Hoare triple {45174#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; {45174#false} is VALID [2022-04-28 05:43:16,525 INFO L290 TraceCheckUtils]: 104: Hoare triple {45539#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {45174#false} is VALID [2022-04-28 05:43:16,525 INFO L290 TraceCheckUtils]: 103: Hoare triple {45543#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45539#(< |main_#t~post7| 10)} is VALID [2022-04-28 05:43:16,525 INFO L290 TraceCheckUtils]: 102: Hoare triple {45543#(< ~counter~0 10)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {45543#(< ~counter~0 10)} is VALID [2022-04-28 05:43:16,525 INFO L290 TraceCheckUtils]: 101: Hoare triple {45543#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {45543#(< ~counter~0 10)} is VALID [2022-04-28 05:43:16,526 INFO L290 TraceCheckUtils]: 100: Hoare triple {45553#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45543#(< ~counter~0 10)} is VALID [2022-04-28 05:43:16,527 INFO L290 TraceCheckUtils]: 99: Hoare triple {45553#(< ~counter~0 9)} ~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; {45553#(< ~counter~0 9)} is VALID [2022-04-28 05:43:16,527 INFO L290 TraceCheckUtils]: 98: Hoare triple {45553#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {45553#(< ~counter~0 9)} is VALID [2022-04-28 05:43:16,527 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {45173#true} {45553#(< ~counter~0 9)} #92#return; {45553#(< ~counter~0 9)} is VALID [2022-04-28 05:43:16,528 INFO L290 TraceCheckUtils]: 96: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 05:43:16,528 INFO L290 TraceCheckUtils]: 95: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 05:43:16,528 INFO L290 TraceCheckUtils]: 94: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 05:43:16,528 INFO L272 TraceCheckUtils]: 93: Hoare triple {45553#(< ~counter~0 9)} 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)); {45173#true} is VALID [2022-04-28 05:43:16,530 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {45173#true} {45553#(< ~counter~0 9)} #90#return; {45553#(< ~counter~0 9)} is VALID [2022-04-28 05:43:16,530 INFO L290 TraceCheckUtils]: 91: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 05:43:16,530 INFO L290 TraceCheckUtils]: 90: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 05:43:16,530 INFO L290 TraceCheckUtils]: 89: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 05:43:16,530 INFO L272 TraceCheckUtils]: 88: Hoare triple {45553#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45173#true} is VALID [2022-04-28 05:43:16,530 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {45173#true} {45553#(< ~counter~0 9)} #88#return; {45553#(< ~counter~0 9)} is VALID [2022-04-28 05:43:16,530 INFO L290 TraceCheckUtils]: 86: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 05:43:16,530 INFO L290 TraceCheckUtils]: 85: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 05:43:16,530 INFO L290 TraceCheckUtils]: 84: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 05:43:16,531 INFO L272 TraceCheckUtils]: 83: Hoare triple {45553#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45173#true} is VALID [2022-04-28 05:43:16,531 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {45173#true} {45553#(< ~counter~0 9)} #86#return; {45553#(< ~counter~0 9)} is VALID [2022-04-28 05:43:16,531 INFO L290 TraceCheckUtils]: 81: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 05:43:16,531 INFO L290 TraceCheckUtils]: 80: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 05:43:16,531 INFO L290 TraceCheckUtils]: 79: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 05:43:16,531 INFO L272 TraceCheckUtils]: 78: Hoare triple {45553#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45173#true} is VALID [2022-04-28 05:43:16,532 INFO L290 TraceCheckUtils]: 77: Hoare triple {45553#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {45553#(< ~counter~0 9)} is VALID [2022-04-28 05:43:16,532 INFO L290 TraceCheckUtils]: 76: Hoare triple {45626#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45553#(< ~counter~0 9)} is VALID [2022-04-28 05:43:16,533 INFO L290 TraceCheckUtils]: 75: Hoare triple {45626#(< ~counter~0 8)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {45626#(< ~counter~0 8)} is VALID [2022-04-28 05:43:16,533 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {45173#true} {45626#(< ~counter~0 8)} #92#return; {45626#(< ~counter~0 8)} is VALID [2022-04-28 05:43:16,533 INFO L290 TraceCheckUtils]: 73: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 05:43:16,533 INFO L290 TraceCheckUtils]: 72: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 05:43:16,533 INFO L290 TraceCheckUtils]: 71: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 05:43:16,533 INFO L272 TraceCheckUtils]: 70: Hoare triple {45626#(< ~counter~0 8)} 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)); {45173#true} is VALID [2022-04-28 05:43:16,534 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {45173#true} {45626#(< ~counter~0 8)} #90#return; {45626#(< ~counter~0 8)} is VALID [2022-04-28 05:43:16,534 INFO L290 TraceCheckUtils]: 68: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 05:43:16,534 INFO L290 TraceCheckUtils]: 67: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 05:43:16,534 INFO L290 TraceCheckUtils]: 66: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 05:43:16,534 INFO L272 TraceCheckUtils]: 65: Hoare triple {45626#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45173#true} is VALID [2022-04-28 05:43:16,535 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {45173#true} {45626#(< ~counter~0 8)} #88#return; {45626#(< ~counter~0 8)} is VALID [2022-04-28 05:43:16,535 INFO L290 TraceCheckUtils]: 63: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 05:43:16,535 INFO L290 TraceCheckUtils]: 62: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 05:43:16,535 INFO L290 TraceCheckUtils]: 61: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 05:43:16,535 INFO L272 TraceCheckUtils]: 60: Hoare triple {45626#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45173#true} is VALID [2022-04-28 05:43:16,535 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {45173#true} {45626#(< ~counter~0 8)} #86#return; {45626#(< ~counter~0 8)} is VALID [2022-04-28 05:43:16,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 05:43:16,535 INFO L290 TraceCheckUtils]: 57: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 05:43:16,536 INFO L290 TraceCheckUtils]: 56: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 05:43:16,536 INFO L272 TraceCheckUtils]: 55: Hoare triple {45626#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45173#true} is VALID [2022-04-28 05:43:16,536 INFO L290 TraceCheckUtils]: 54: Hoare triple {45626#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {45626#(< ~counter~0 8)} is VALID [2022-04-28 05:43:16,536 INFO L290 TraceCheckUtils]: 53: Hoare triple {45696#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45626#(< ~counter~0 8)} is VALID [2022-04-28 05:43:16,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {45696#(< ~counter~0 7)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {45696#(< ~counter~0 7)} is VALID [2022-04-28 05:43:16,537 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {45173#true} {45696#(< ~counter~0 7)} #92#return; {45696#(< ~counter~0 7)} is VALID [2022-04-28 05:43:16,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 05:43:16,537 INFO L290 TraceCheckUtils]: 49: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 05:43:16,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 05:43:16,538 INFO L272 TraceCheckUtils]: 47: Hoare triple {45696#(< ~counter~0 7)} 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)); {45173#true} is VALID [2022-04-28 05:43:16,538 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {45173#true} {45696#(< ~counter~0 7)} #90#return; {45696#(< ~counter~0 7)} is VALID [2022-04-28 05:43:16,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 05:43:16,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 05:43:16,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 05:43:16,538 INFO L272 TraceCheckUtils]: 42: Hoare triple {45696#(< ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45173#true} is VALID [2022-04-28 05:43:16,539 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {45173#true} {45696#(< ~counter~0 7)} #88#return; {45696#(< ~counter~0 7)} is VALID [2022-04-28 05:43:16,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 05:43:16,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 05:43:16,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 05:43:16,539 INFO L272 TraceCheckUtils]: 37: Hoare triple {45696#(< ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45173#true} is VALID [2022-04-28 05:43:16,539 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {45173#true} {45696#(< ~counter~0 7)} #86#return; {45696#(< ~counter~0 7)} is VALID [2022-04-28 05:43:16,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 05:43:16,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 05:43:16,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 05:43:16,540 INFO L272 TraceCheckUtils]: 32: Hoare triple {45696#(< ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45173#true} is VALID [2022-04-28 05:43:16,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {45696#(< ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {45696#(< ~counter~0 7)} is VALID [2022-04-28 05:43:16,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {45483#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45696#(< ~counter~0 7)} is VALID [2022-04-28 05:43:16,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {45483#(<= ~counter~0 5)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {45483#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:16,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {45483#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {45483#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:16,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {45410#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45483#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:16,542 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {45173#true} {45410#(<= ~counter~0 4)} #84#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 05:43:16,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 05:43:16,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 05:43:16,542 INFO L272 TraceCheckUtils]: 22: Hoare triple {45410#(<= ~counter~0 4)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {45173#true} is VALID [2022-04-28 05:43:16,543 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {45173#true} {45410#(<= ~counter~0 4)} #82#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 05:43:16,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 05:43:16,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 05:43:16,543 INFO L272 TraceCheckUtils]: 17: Hoare triple {45410#(<= ~counter~0 4)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {45173#true} is VALID [2022-04-28 05:43:16,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {45410#(<= ~counter~0 4)} ~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; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,543 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45173#true} {45410#(<= ~counter~0 4)} #80#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 05:43:16,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 05:43:16,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 05:43:16,544 INFO L272 TraceCheckUtils]: 11: Hoare triple {45410#(<= ~counter~0 4)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {45173#true} is VALID [2022-04-28 05:43:16,544 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45173#true} {45410#(<= ~counter~0 4)} #78#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 05:43:16,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 05:43:16,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 05:43:16,544 INFO L272 TraceCheckUtils]: 6: Hoare triple {45410#(<= ~counter~0 4)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {45173#true} is VALID [2022-04-28 05:43:16,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {45410#(<= ~counter~0 4)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {45410#(<= ~counter~0 4)} call #t~ret8 := main(); {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45410#(<= ~counter~0 4)} {45173#true} #98#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {45410#(<= ~counter~0 4)} assume true; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {45173#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);~counter~0 := 0; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:16,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {45173#true} call ULTIMATE.init(); {45173#true} is VALID [2022-04-28 05:43:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-28 05:43:16,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:43:16,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919504768] [2022-04-28 05:43:16,546 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:43:16,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045110476] [2022-04-28 05:43:16,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045110476] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:43:16,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:43:16,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 05:43:16,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:43:16,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1172861520] [2022-04-28 05:43:16,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1172861520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:16,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:16,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:43:16,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848249313] [2022-04-28 05:43:16,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:43:16,547 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 112 [2022-04-28 05:43:16,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:43:16,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:43:16,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:16,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:43:16,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:16,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:43:16,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:43:16,614 INFO L87 Difference]: Start difference. First operand 470 states and 614 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:43:17,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:17,782 INFO L93 Difference]: Finished difference Result 644 states and 881 transitions. [2022-04-28 05:43:17,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:43:17,782 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 112 [2022-04-28 05:43:17,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:43:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:43:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 152 transitions. [2022-04-28 05:43:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:43:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 152 transitions. [2022-04-28 05:43:17,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 152 transitions. [2022-04-28 05:43:17,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:17,911 INFO L225 Difference]: With dead ends: 644 [2022-04-28 05:43:17,911 INFO L226 Difference]: Without dead ends: 474 [2022-04-28 05:43:17,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=187, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:43:17,912 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 54 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:43:17,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 204 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:43:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-04-28 05:43:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-04-28 05:43:18,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:43:18,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 474 states. Second operand has 474 states, 305 states have (on average 1.2163934426229508) internal successors, (371), 310 states have internal predecessors, (371), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2022-04-28 05:43:18,774 INFO L74 IsIncluded]: Start isIncluded. First operand 474 states. Second operand has 474 states, 305 states have (on average 1.2163934426229508) internal successors, (371), 310 states have internal predecessors, (371), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2022-04-28 05:43:18,775 INFO L87 Difference]: Start difference. First operand 474 states. Second operand has 474 states, 305 states have (on average 1.2163934426229508) internal successors, (371), 310 states have internal predecessors, (371), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2022-04-28 05:43:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:18,786 INFO L93 Difference]: Finished difference Result 474 states and 616 transitions. [2022-04-28 05:43:18,786 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 616 transitions. [2022-04-28 05:43:18,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:18,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:18,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 474 states, 305 states have (on average 1.2163934426229508) internal successors, (371), 310 states have internal predecessors, (371), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) Second operand 474 states. [2022-04-28 05:43:18,787 INFO L87 Difference]: Start difference. First operand has 474 states, 305 states have (on average 1.2163934426229508) internal successors, (371), 310 states have internal predecessors, (371), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) Second operand 474 states. [2022-04-28 05:43:18,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:18,796 INFO L93 Difference]: Finished difference Result 474 states and 616 transitions. [2022-04-28 05:43:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 616 transitions. [2022-04-28 05:43:18,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:18,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:18,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:43:18,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:43:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 305 states have (on average 1.2163934426229508) internal successors, (371), 310 states have internal predecessors, (371), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2022-04-28 05:43:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 616 transitions. [2022-04-28 05:43:18,820 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 616 transitions. Word has length 112 [2022-04-28 05:43:18,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:43:18,821 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 616 transitions. [2022-04-28 05:43:18,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:43:18,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 474 states and 616 transitions. [2022-04-28 05:43:19,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 616 edges. 616 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 616 transitions. [2022-04-28 05:43:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 05:43:19,727 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:43:19,727 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:43:19,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 05:43:19,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 05:43:19,927 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:43:19,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:43:19,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1546024104, now seen corresponding path program 5 times [2022-04-28 05:43:19,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:19,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1013694478] [2022-04-28 05:43:19,928 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:43:19,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1546024104, now seen corresponding path program 6 times [2022-04-28 05:43:19,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:43:19,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415537177] [2022-04-28 05:43:19,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:43:19,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:43:19,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:43:19,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [681623845] [2022-04-28 05:43:19,937 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:43:19,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:43:19,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:43:19,938 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:43:19,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 05:43:20,016 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 05:43:20,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:43:20,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 05:43:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:20,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:43:20,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {49050#true} call ULTIMATE.init(); {49050#true} is VALID [2022-04-28 05:43:20,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {49050#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);~counter~0 := 0; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {49058#(<= ~counter~0 0)} assume true; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49058#(<= ~counter~0 0)} {49050#true} #98#return; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {49058#(<= ~counter~0 0)} call #t~ret8 := main(); {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {49058#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,437 INFO L272 TraceCheckUtils]: 6: Hoare triple {49058#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {49058#(<= ~counter~0 0)} ~cond := #in~cond; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {49058#(<= ~counter~0 0)} assume !(0 == ~cond); {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {49058#(<= ~counter~0 0)} assume true; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,438 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {49058#(<= ~counter~0 0)} {49058#(<= ~counter~0 0)} #78#return; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,438 INFO L272 TraceCheckUtils]: 11: Hoare triple {49058#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {49058#(<= ~counter~0 0)} ~cond := #in~cond; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {49058#(<= ~counter~0 0)} assume !(0 == ~cond); {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {49058#(<= ~counter~0 0)} assume true; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,439 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {49058#(<= ~counter~0 0)} {49058#(<= ~counter~0 0)} #80#return; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {49058#(<= ~counter~0 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; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,440 INFO L272 TraceCheckUtils]: 17: Hoare triple {49058#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {49058#(<= ~counter~0 0)} ~cond := #in~cond; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {49058#(<= ~counter~0 0)} assume !(0 == ~cond); {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {49058#(<= ~counter~0 0)} assume true; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,441 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {49058#(<= ~counter~0 0)} {49058#(<= ~counter~0 0)} #82#return; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,441 INFO L272 TraceCheckUtils]: 22: Hoare triple {49058#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {49058#(<= ~counter~0 0)} ~cond := #in~cond; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {49058#(<= ~counter~0 0)} assume !(0 == ~cond); {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {49058#(<= ~counter~0 0)} assume true; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,445 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {49058#(<= ~counter~0 0)} {49058#(<= ~counter~0 0)} #84#return; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 05:43:20,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {49058#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49137#(<= ~counter~0 1)} is VALID [2022-04-28 05:43:20,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {49137#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {49137#(<= ~counter~0 1)} is VALID [2022-04-28 05:43:20,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {49137#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49137#(<= ~counter~0 1)} is VALID [2022-04-28 05:43:20,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {49137#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {49147#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,448 INFO L272 TraceCheckUtils]: 32: Hoare triple {49147#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {49147#(<= ~counter~0 2)} ~cond := #in~cond; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {49147#(<= ~counter~0 2)} assume !(0 == ~cond); {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,448 INFO L290 TraceCheckUtils]: 35: Hoare triple {49147#(<= ~counter~0 2)} assume true; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,449 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {49147#(<= ~counter~0 2)} {49147#(<= ~counter~0 2)} #86#return; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,449 INFO L272 TraceCheckUtils]: 37: Hoare triple {49147#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,449 INFO L290 TraceCheckUtils]: 38: Hoare triple {49147#(<= ~counter~0 2)} ~cond := #in~cond; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,450 INFO L290 TraceCheckUtils]: 39: Hoare triple {49147#(<= ~counter~0 2)} assume !(0 == ~cond); {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {49147#(<= ~counter~0 2)} assume true; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,450 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {49147#(<= ~counter~0 2)} {49147#(<= ~counter~0 2)} #88#return; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,451 INFO L272 TraceCheckUtils]: 42: Hoare triple {49147#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {49147#(<= ~counter~0 2)} ~cond := #in~cond; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {49147#(<= ~counter~0 2)} assume !(0 == ~cond); {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {49147#(<= ~counter~0 2)} assume true; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,452 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {49147#(<= ~counter~0 2)} {49147#(<= ~counter~0 2)} #90#return; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,452 INFO L272 TraceCheckUtils]: 47: Hoare triple {49147#(<= ~counter~0 2)} 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)); {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,453 INFO L290 TraceCheckUtils]: 48: Hoare triple {49147#(<= ~counter~0 2)} ~cond := #in~cond; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,453 INFO L290 TraceCheckUtils]: 49: Hoare triple {49147#(<= ~counter~0 2)} assume !(0 == ~cond); {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,453 INFO L290 TraceCheckUtils]: 50: Hoare triple {49147#(<= ~counter~0 2)} assume true; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,454 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {49147#(<= ~counter~0 2)} {49147#(<= ~counter~0 2)} #92#return; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,454 INFO L290 TraceCheckUtils]: 52: Hoare triple {49147#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,454 INFO L290 TraceCheckUtils]: 53: Hoare triple {49147#(<= ~counter~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; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 05:43:20,455 INFO L290 TraceCheckUtils]: 54: Hoare triple {49147#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:20,455 INFO L290 TraceCheckUtils]: 55: Hoare triple {49220#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:20,455 INFO L290 TraceCheckUtils]: 56: Hoare triple {49220#(<= ~counter~0 3)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:20,456 INFO L290 TraceCheckUtils]: 57: Hoare triple {49220#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,456 INFO L290 TraceCheckUtils]: 58: Hoare triple {49230#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,456 INFO L272 TraceCheckUtils]: 59: Hoare triple {49230#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,456 INFO L290 TraceCheckUtils]: 60: Hoare triple {49230#(<= ~counter~0 4)} ~cond := #in~cond; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,457 INFO L290 TraceCheckUtils]: 61: Hoare triple {49230#(<= ~counter~0 4)} assume !(0 == ~cond); {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,457 INFO L290 TraceCheckUtils]: 62: Hoare triple {49230#(<= ~counter~0 4)} assume true; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,457 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {49230#(<= ~counter~0 4)} {49230#(<= ~counter~0 4)} #86#return; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,458 INFO L272 TraceCheckUtils]: 64: Hoare triple {49230#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,458 INFO L290 TraceCheckUtils]: 65: Hoare triple {49230#(<= ~counter~0 4)} ~cond := #in~cond; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,458 INFO L290 TraceCheckUtils]: 66: Hoare triple {49230#(<= ~counter~0 4)} assume !(0 == ~cond); {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,458 INFO L290 TraceCheckUtils]: 67: Hoare triple {49230#(<= ~counter~0 4)} assume true; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,459 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {49230#(<= ~counter~0 4)} {49230#(<= ~counter~0 4)} #88#return; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,459 INFO L272 TraceCheckUtils]: 69: Hoare triple {49230#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,460 INFO L290 TraceCheckUtils]: 70: Hoare triple {49230#(<= ~counter~0 4)} ~cond := #in~cond; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,460 INFO L290 TraceCheckUtils]: 71: Hoare triple {49230#(<= ~counter~0 4)} assume !(0 == ~cond); {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,460 INFO L290 TraceCheckUtils]: 72: Hoare triple {49230#(<= ~counter~0 4)} assume true; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,461 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {49230#(<= ~counter~0 4)} {49230#(<= ~counter~0 4)} #90#return; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,461 INFO L272 TraceCheckUtils]: 74: Hoare triple {49230#(<= ~counter~0 4)} 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)); {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,461 INFO L290 TraceCheckUtils]: 75: Hoare triple {49230#(<= ~counter~0 4)} ~cond := #in~cond; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,462 INFO L290 TraceCheckUtils]: 76: Hoare triple {49230#(<= ~counter~0 4)} assume !(0 == ~cond); {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,462 INFO L290 TraceCheckUtils]: 77: Hoare triple {49230#(<= ~counter~0 4)} assume true; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,462 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {49230#(<= ~counter~0 4)} {49230#(<= ~counter~0 4)} #92#return; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,462 INFO L290 TraceCheckUtils]: 79: Hoare triple {49230#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,463 INFO L290 TraceCheckUtils]: 80: Hoare triple {49230#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,463 INFO L290 TraceCheckUtils]: 81: Hoare triple {49300#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,464 INFO L272 TraceCheckUtils]: 82: Hoare triple {49300#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,464 INFO L290 TraceCheckUtils]: 83: Hoare triple {49300#(<= ~counter~0 5)} ~cond := #in~cond; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,464 INFO L290 TraceCheckUtils]: 84: Hoare triple {49300#(<= ~counter~0 5)} assume !(0 == ~cond); {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,464 INFO L290 TraceCheckUtils]: 85: Hoare triple {49300#(<= ~counter~0 5)} assume true; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,465 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {49300#(<= ~counter~0 5)} {49300#(<= ~counter~0 5)} #86#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,465 INFO L272 TraceCheckUtils]: 87: Hoare triple {49300#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,466 INFO L290 TraceCheckUtils]: 88: Hoare triple {49300#(<= ~counter~0 5)} ~cond := #in~cond; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,466 INFO L290 TraceCheckUtils]: 89: Hoare triple {49300#(<= ~counter~0 5)} assume !(0 == ~cond); {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,466 INFO L290 TraceCheckUtils]: 90: Hoare triple {49300#(<= ~counter~0 5)} assume true; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,466 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {49300#(<= ~counter~0 5)} {49300#(<= ~counter~0 5)} #88#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,467 INFO L272 TraceCheckUtils]: 92: Hoare triple {49300#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,467 INFO L290 TraceCheckUtils]: 93: Hoare triple {49300#(<= ~counter~0 5)} ~cond := #in~cond; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,467 INFO L290 TraceCheckUtils]: 94: Hoare triple {49300#(<= ~counter~0 5)} assume !(0 == ~cond); {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,468 INFO L290 TraceCheckUtils]: 95: Hoare triple {49300#(<= ~counter~0 5)} assume true; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,468 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {49300#(<= ~counter~0 5)} {49300#(<= ~counter~0 5)} #90#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,469 INFO L272 TraceCheckUtils]: 97: Hoare triple {49300#(<= ~counter~0 5)} 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)); {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,469 INFO L290 TraceCheckUtils]: 98: Hoare triple {49300#(<= ~counter~0 5)} ~cond := #in~cond; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,469 INFO L290 TraceCheckUtils]: 99: Hoare triple {49300#(<= ~counter~0 5)} assume !(0 == ~cond); {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,469 INFO L290 TraceCheckUtils]: 100: Hoare triple {49300#(<= ~counter~0 5)} assume true; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,470 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {49300#(<= ~counter~0 5)} {49300#(<= ~counter~0 5)} #92#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,470 INFO L290 TraceCheckUtils]: 102: Hoare triple {49300#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,470 INFO L290 TraceCheckUtils]: 103: Hoare triple {49300#(<= ~counter~0 5)} ~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; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,471 INFO L290 TraceCheckUtils]: 104: Hoare triple {49300#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49373#(<= ~counter~0 6)} is VALID [2022-04-28 05:43:20,471 INFO L290 TraceCheckUtils]: 105: Hoare triple {49373#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {49373#(<= ~counter~0 6)} is VALID [2022-04-28 05:43:20,471 INFO L290 TraceCheckUtils]: 106: Hoare triple {49373#(<= ~counter~0 6)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49373#(<= ~counter~0 6)} is VALID [2022-04-28 05:43:20,472 INFO L290 TraceCheckUtils]: 107: Hoare triple {49373#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49383#(<= |main_#t~post7| 6)} is VALID [2022-04-28 05:43:20,472 INFO L290 TraceCheckUtils]: 108: Hoare triple {49383#(<= |main_#t~post7| 6)} assume !(#t~post7 < 10);havoc #t~post7; {49051#false} is VALID [2022-04-28 05:43:20,472 INFO L290 TraceCheckUtils]: 109: Hoare triple {49051#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; {49051#false} is VALID [2022-04-28 05:43:20,472 INFO L290 TraceCheckUtils]: 110: Hoare triple {49051#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49051#false} is VALID [2022-04-28 05:43:20,472 INFO L290 TraceCheckUtils]: 111: Hoare triple {49051#false} assume !(#t~post6 < 10);havoc #t~post6; {49051#false} is VALID [2022-04-28 05:43:20,472 INFO L272 TraceCheckUtils]: 112: Hoare triple {49051#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {49051#false} is VALID [2022-04-28 05:43:20,472 INFO L290 TraceCheckUtils]: 113: Hoare triple {49051#false} ~cond := #in~cond; {49051#false} is VALID [2022-04-28 05:43:20,472 INFO L290 TraceCheckUtils]: 114: Hoare triple {49051#false} assume 0 == ~cond; {49051#false} is VALID [2022-04-28 05:43:20,472 INFO L290 TraceCheckUtils]: 115: Hoare triple {49051#false} assume !false; {49051#false} is VALID [2022-04-28 05:43:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 229 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-28 05:43:20,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:43:20,861 INFO L290 TraceCheckUtils]: 115: Hoare triple {49051#false} assume !false; {49051#false} is VALID [2022-04-28 05:43:20,862 INFO L290 TraceCheckUtils]: 114: Hoare triple {49051#false} assume 0 == ~cond; {49051#false} is VALID [2022-04-28 05:43:20,862 INFO L290 TraceCheckUtils]: 113: Hoare triple {49051#false} ~cond := #in~cond; {49051#false} is VALID [2022-04-28 05:43:20,862 INFO L272 TraceCheckUtils]: 112: Hoare triple {49051#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {49051#false} is VALID [2022-04-28 05:43:20,862 INFO L290 TraceCheckUtils]: 111: Hoare triple {49051#false} assume !(#t~post6 < 10);havoc #t~post6; {49051#false} is VALID [2022-04-28 05:43:20,862 INFO L290 TraceCheckUtils]: 110: Hoare triple {49051#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49051#false} is VALID [2022-04-28 05:43:20,862 INFO L290 TraceCheckUtils]: 109: Hoare triple {49051#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; {49051#false} is VALID [2022-04-28 05:43:20,862 INFO L290 TraceCheckUtils]: 108: Hoare triple {49429#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {49051#false} is VALID [2022-04-28 05:43:20,862 INFO L290 TraceCheckUtils]: 107: Hoare triple {49433#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49429#(< |main_#t~post7| 10)} is VALID [2022-04-28 05:43:20,863 INFO L290 TraceCheckUtils]: 106: Hoare triple {49433#(< ~counter~0 10)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49433#(< ~counter~0 10)} is VALID [2022-04-28 05:43:20,863 INFO L290 TraceCheckUtils]: 105: Hoare triple {49433#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {49433#(< ~counter~0 10)} is VALID [2022-04-28 05:43:20,864 INFO L290 TraceCheckUtils]: 104: Hoare triple {49443#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49433#(< ~counter~0 10)} is VALID [2022-04-28 05:43:20,864 INFO L290 TraceCheckUtils]: 103: Hoare triple {49443#(< ~counter~0 9)} ~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; {49443#(< ~counter~0 9)} is VALID [2022-04-28 05:43:20,864 INFO L290 TraceCheckUtils]: 102: Hoare triple {49443#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {49443#(< ~counter~0 9)} is VALID [2022-04-28 05:43:20,865 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {49050#true} {49443#(< ~counter~0 9)} #92#return; {49443#(< ~counter~0 9)} is VALID [2022-04-28 05:43:20,865 INFO L290 TraceCheckUtils]: 100: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 05:43:20,865 INFO L290 TraceCheckUtils]: 99: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 05:43:20,865 INFO L290 TraceCheckUtils]: 98: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 05:43:20,865 INFO L272 TraceCheckUtils]: 97: Hoare triple {49443#(< ~counter~0 9)} 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)); {49050#true} is VALID [2022-04-28 05:43:20,866 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {49050#true} {49443#(< ~counter~0 9)} #90#return; {49443#(< ~counter~0 9)} is VALID [2022-04-28 05:43:20,866 INFO L290 TraceCheckUtils]: 95: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 05:43:20,866 INFO L290 TraceCheckUtils]: 94: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 05:43:20,866 INFO L290 TraceCheckUtils]: 93: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 05:43:20,866 INFO L272 TraceCheckUtils]: 92: Hoare triple {49443#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49050#true} is VALID [2022-04-28 05:43:20,866 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {49050#true} {49443#(< ~counter~0 9)} #88#return; {49443#(< ~counter~0 9)} is VALID [2022-04-28 05:43:20,866 INFO L290 TraceCheckUtils]: 90: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 05:43:20,866 INFO L290 TraceCheckUtils]: 89: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 05:43:20,867 INFO L290 TraceCheckUtils]: 88: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 05:43:20,867 INFO L272 TraceCheckUtils]: 87: Hoare triple {49443#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49050#true} is VALID [2022-04-28 05:43:20,887 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {49050#true} {49443#(< ~counter~0 9)} #86#return; {49443#(< ~counter~0 9)} is VALID [2022-04-28 05:43:20,887 INFO L290 TraceCheckUtils]: 85: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 05:43:20,888 INFO L290 TraceCheckUtils]: 84: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 05:43:20,888 INFO L290 TraceCheckUtils]: 83: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 05:43:20,888 INFO L272 TraceCheckUtils]: 82: Hoare triple {49443#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49050#true} is VALID [2022-04-28 05:43:20,888 INFO L290 TraceCheckUtils]: 81: Hoare triple {49443#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {49443#(< ~counter~0 9)} is VALID [2022-04-28 05:43:20,889 INFO L290 TraceCheckUtils]: 80: Hoare triple {49516#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49443#(< ~counter~0 9)} is VALID [2022-04-28 05:43:20,889 INFO L290 TraceCheckUtils]: 79: Hoare triple {49516#(< ~counter~0 8)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {49516#(< ~counter~0 8)} is VALID [2022-04-28 05:43:20,890 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {49050#true} {49516#(< ~counter~0 8)} #92#return; {49516#(< ~counter~0 8)} is VALID [2022-04-28 05:43:20,890 INFO L290 TraceCheckUtils]: 77: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 05:43:20,890 INFO L290 TraceCheckUtils]: 76: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 05:43:20,890 INFO L290 TraceCheckUtils]: 75: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 05:43:20,890 INFO L272 TraceCheckUtils]: 74: Hoare triple {49516#(< ~counter~0 8)} 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)); {49050#true} is VALID [2022-04-28 05:43:20,890 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {49050#true} {49516#(< ~counter~0 8)} #90#return; {49516#(< ~counter~0 8)} is VALID [2022-04-28 05:43:20,891 INFO L290 TraceCheckUtils]: 72: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 05:43:20,891 INFO L290 TraceCheckUtils]: 71: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 05:43:20,891 INFO L290 TraceCheckUtils]: 70: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 05:43:20,891 INFO L272 TraceCheckUtils]: 69: Hoare triple {49516#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49050#true} is VALID [2022-04-28 05:43:20,891 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {49050#true} {49516#(< ~counter~0 8)} #88#return; {49516#(< ~counter~0 8)} is VALID [2022-04-28 05:43:20,891 INFO L290 TraceCheckUtils]: 67: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 05:43:20,891 INFO L290 TraceCheckUtils]: 66: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 05:43:20,891 INFO L290 TraceCheckUtils]: 65: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 05:43:20,891 INFO L272 TraceCheckUtils]: 64: Hoare triple {49516#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49050#true} is VALID [2022-04-28 05:43:20,892 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {49050#true} {49516#(< ~counter~0 8)} #86#return; {49516#(< ~counter~0 8)} is VALID [2022-04-28 05:43:20,892 INFO L290 TraceCheckUtils]: 62: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 05:43:20,892 INFO L290 TraceCheckUtils]: 61: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 05:43:20,892 INFO L290 TraceCheckUtils]: 60: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 05:43:20,892 INFO L272 TraceCheckUtils]: 59: Hoare triple {49516#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49050#true} is VALID [2022-04-28 05:43:20,892 INFO L290 TraceCheckUtils]: 58: Hoare triple {49516#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {49516#(< ~counter~0 8)} is VALID [2022-04-28 05:43:20,893 INFO L290 TraceCheckUtils]: 57: Hoare triple {49373#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49516#(< ~counter~0 8)} is VALID [2022-04-28 05:43:20,893 INFO L290 TraceCheckUtils]: 56: Hoare triple {49373#(<= ~counter~0 6)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49373#(<= ~counter~0 6)} is VALID [2022-04-28 05:43:20,893 INFO L290 TraceCheckUtils]: 55: Hoare triple {49373#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {49373#(<= ~counter~0 6)} is VALID [2022-04-28 05:43:20,894 INFO L290 TraceCheckUtils]: 54: Hoare triple {49300#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49373#(<= ~counter~0 6)} is VALID [2022-04-28 05:43:20,894 INFO L290 TraceCheckUtils]: 53: Hoare triple {49300#(<= ~counter~0 5)} ~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; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,894 INFO L290 TraceCheckUtils]: 52: Hoare triple {49300#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,895 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {49050#true} {49300#(<= ~counter~0 5)} #92#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,895 INFO L290 TraceCheckUtils]: 50: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 05:43:20,895 INFO L290 TraceCheckUtils]: 49: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 05:43:20,895 INFO L290 TraceCheckUtils]: 48: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 05:43:20,895 INFO L272 TraceCheckUtils]: 47: Hoare triple {49300#(<= ~counter~0 5)} 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)); {49050#true} is VALID [2022-04-28 05:43:20,896 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {49050#true} {49300#(<= ~counter~0 5)} #90#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 05:43:20,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 05:43:20,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 05:43:20,896 INFO L272 TraceCheckUtils]: 42: Hoare triple {49300#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49050#true} is VALID [2022-04-28 05:43:20,896 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {49050#true} {49300#(<= ~counter~0 5)} #88#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 05:43:20,896 INFO L290 TraceCheckUtils]: 39: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 05:43:20,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 05:43:20,896 INFO L272 TraceCheckUtils]: 37: Hoare triple {49300#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49050#true} is VALID [2022-04-28 05:43:20,897 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {49050#true} {49300#(<= ~counter~0 5)} #86#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,897 INFO L290 TraceCheckUtils]: 35: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 05:43:20,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 05:43:20,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 05:43:20,897 INFO L272 TraceCheckUtils]: 32: Hoare triple {49300#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49050#true} is VALID [2022-04-28 05:43:20,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {49300#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {49230#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 05:43:20,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {49230#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {49230#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {49220#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 05:43:20,899 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {49050#true} {49220#(<= ~counter~0 3)} #84#return; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:20,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 05:43:20,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 05:43:20,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 05:43:20,899 INFO L272 TraceCheckUtils]: 22: Hoare triple {49220#(<= ~counter~0 3)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {49050#true} is VALID [2022-04-28 05:43:20,900 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {49050#true} {49220#(<= ~counter~0 3)} #82#return; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:20,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 05:43:20,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 05:43:20,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 05:43:20,900 INFO L272 TraceCheckUtils]: 17: Hoare triple {49220#(<= ~counter~0 3)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {49050#true} is VALID [2022-04-28 05:43:20,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {49220#(<= ~counter~0 3)} ~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; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:20,900 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {49050#true} {49220#(<= ~counter~0 3)} #80#return; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:20,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 05:43:20,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 05:43:20,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 05:43:20,901 INFO L272 TraceCheckUtils]: 11: Hoare triple {49220#(<= ~counter~0 3)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {49050#true} is VALID [2022-04-28 05:43:20,901 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {49050#true} {49220#(<= ~counter~0 3)} #78#return; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:20,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 05:43:20,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 05:43:20,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 05:43:20,901 INFO L272 TraceCheckUtils]: 6: Hoare triple {49220#(<= ~counter~0 3)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {49050#true} is VALID [2022-04-28 05:43:20,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {49220#(<= ~counter~0 3)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:20,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {49220#(<= ~counter~0 3)} call #t~ret8 := main(); {49220#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:20,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49220#(<= ~counter~0 3)} {49050#true} #98#return; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:20,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {49220#(<= ~counter~0 3)} assume true; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:20,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {49050#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);~counter~0 := 0; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 05:43:20,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {49050#true} call ULTIMATE.init(); {49050#true} is VALID [2022-04-28 05:43:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 37 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-28 05:43:20,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:43:20,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415537177] [2022-04-28 05:43:20,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:43:20,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681623845] [2022-04-28 05:43:20,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681623845] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:43:20,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:43:20,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 05:43:20,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:43:20,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1013694478] [2022-04-28 05:43:20,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1013694478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:20,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:20,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:43:20,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730789058] [2022-04-28 05:43:20,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:43:20,904 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 116 [2022-04-28 05:43:20,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:43:20,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:43:20,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:20,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:43:20,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:20,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:43:20,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:43:20,962 INFO L87 Difference]: Start difference. First operand 474 states and 616 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:43:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:22,342 INFO L93 Difference]: Finished difference Result 731 states and 966 transitions. [2022-04-28 05:43:22,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 05:43:22,342 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 116 [2022-04-28 05:43:22,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:43:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:43:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 175 transitions. [2022-04-28 05:43:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:43:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 175 transitions. [2022-04-28 05:43:22,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 175 transitions. [2022-04-28 05:43:22,470 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 05:43:22,484 INFO L225 Difference]: With dead ends: 731 [2022-04-28 05:43:22,484 INFO L226 Difference]: Without dead ends: 561 [2022-04-28 05:43:22,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2022-04-28 05:43:22,485 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 77 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:43:22,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 220 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:43:22,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-04-28 05:43:23,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 553. [2022-04-28 05:43:23,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:43:23,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 561 states. Second operand has 553 states, 361 states have (on average 1.1911357340720221) internal successors, (430), 367 states have internal predecessors, (430), 133 states have call successors, (133), 59 states have call predecessors, (133), 58 states have return successors, (129), 126 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-28 05:43:23,456 INFO L74 IsIncluded]: Start isIncluded. First operand 561 states. Second operand has 553 states, 361 states have (on average 1.1911357340720221) internal successors, (430), 367 states have internal predecessors, (430), 133 states have call successors, (133), 59 states have call predecessors, (133), 58 states have return successors, (129), 126 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-28 05:43:23,456 INFO L87 Difference]: Start difference. First operand 561 states. Second operand has 553 states, 361 states have (on average 1.1911357340720221) internal successors, (430), 367 states have internal predecessors, (430), 133 states have call successors, (133), 59 states have call predecessors, (133), 58 states have return successors, (129), 126 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-28 05:43:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:23,467 INFO L93 Difference]: Finished difference Result 561 states and 699 transitions. [2022-04-28 05:43:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 699 transitions. [2022-04-28 05:43:23,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:23,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:23,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 553 states, 361 states have (on average 1.1911357340720221) internal successors, (430), 367 states have internal predecessors, (430), 133 states have call successors, (133), 59 states have call predecessors, (133), 58 states have return successors, (129), 126 states have call predecessors, (129), 129 states have call successors, (129) Second operand 561 states. [2022-04-28 05:43:23,469 INFO L87 Difference]: Start difference. First operand has 553 states, 361 states have (on average 1.1911357340720221) internal successors, (430), 367 states have internal predecessors, (430), 133 states have call successors, (133), 59 states have call predecessors, (133), 58 states have return successors, (129), 126 states have call predecessors, (129), 129 states have call successors, (129) Second operand 561 states. [2022-04-28 05:43:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:23,480 INFO L93 Difference]: Finished difference Result 561 states and 699 transitions. [2022-04-28 05:43:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 699 transitions. [2022-04-28 05:43:23,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:23,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:23,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:43:23,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:43:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 361 states have (on average 1.1911357340720221) internal successors, (430), 367 states have internal predecessors, (430), 133 states have call successors, (133), 59 states have call predecessors, (133), 58 states have return successors, (129), 126 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-28 05:43:23,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 692 transitions. [2022-04-28 05:43:23,496 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 692 transitions. Word has length 116 [2022-04-28 05:43:23,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:43:23,496 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 692 transitions. [2022-04-28 05:43:23,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:43:23,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 553 states and 692 transitions. [2022-04-28 05:43:24,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 692 edges. 692 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 692 transitions. [2022-04-28 05:43:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 05:43:24,522 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:43:24,523 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-04-28 05:43:24,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 05:43:24,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:43:24,723 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:43:24,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:43:24,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1978671899, now seen corresponding path program 3 times [2022-04-28 05:43:24,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:24,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [673194658] [2022-04-28 05:43:24,724 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:43:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1978671899, now seen corresponding path program 4 times [2022-04-28 05:43:24,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:43:24,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125672812] [2022-04-28 05:43:24,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:43:24,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:43:24,733 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:43:24,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058724036] [2022-04-28 05:43:24,733 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:43:24,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:43:24,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:43:24,735 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:43:24,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 05:43:24,793 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:43:24,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:43:24,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 05:43:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:24,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:43:25,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {53459#true} call ULTIMATE.init(); {53459#true} is VALID [2022-04-28 05:43:25,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {53459#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);~counter~0 := 0; {53459#true} is VALID [2022-04-28 05:43:25,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53459#true} {53459#true} #98#return; {53459#true} is VALID [2022-04-28 05:43:25,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {53459#true} call #t~ret8 := main(); {53459#true} is VALID [2022-04-28 05:43:25,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {53459#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {53459#true} is VALID [2022-04-28 05:43:25,025 INFO L272 TraceCheckUtils]: 6: Hoare triple {53459#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:25,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:25,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:25,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,025 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {53459#true} {53459#true} #78#return; {53459#true} is VALID [2022-04-28 05:43:25,025 INFO L272 TraceCheckUtils]: 11: Hoare triple {53459#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {53459#true} {53459#true} #80#return; {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {53459#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; {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L272 TraceCheckUtils]: 17: Hoare triple {53459#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {53459#true} {53459#true} #82#return; {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L272 TraceCheckUtils]: 22: Hoare triple {53459#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {53459#true} {53459#true} #84#return; {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {53459#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {53459#true} assume !!(#t~post6 < 10);havoc #t~post6; {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {53459#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-28 05:43:25,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L272 TraceCheckUtils]: 32: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L272 TraceCheckUtils]: 37: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L290 TraceCheckUtils]: 39: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L290 TraceCheckUtils]: 40: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L272 TraceCheckUtils]: 42: Hoare triple {53459#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L290 TraceCheckUtils]: 43: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L290 TraceCheckUtils]: 44: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {53459#true} {53459#true} #90#return; {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L272 TraceCheckUtils]: 47: Hoare triple {53459#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)); {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L290 TraceCheckUtils]: 50: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,027 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {53459#true} {53459#true} #92#return; {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L290 TraceCheckUtils]: 52: Hoare triple {53459#true} assume !(~c~0 >= ~b~0); {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L290 TraceCheckUtils]: 53: Hoare triple {53459#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; {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L290 TraceCheckUtils]: 54: Hoare triple {53459#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L290 TraceCheckUtils]: 55: Hoare triple {53459#true} assume !!(#t~post6 < 10);havoc #t~post6; {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L290 TraceCheckUtils]: 56: Hoare triple {53459#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L290 TraceCheckUtils]: 57: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L290 TraceCheckUtils]: 58: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L272 TraceCheckUtils]: 59: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L290 TraceCheckUtils]: 60: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L290 TraceCheckUtils]: 61: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L290 TraceCheckUtils]: 62: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L272 TraceCheckUtils]: 64: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L290 TraceCheckUtils]: 65: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L290 TraceCheckUtils]: 66: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L290 TraceCheckUtils]: 67: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L272 TraceCheckUtils]: 69: Hoare triple {53459#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L290 TraceCheckUtils]: 70: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:25,028 INFO L290 TraceCheckUtils]: 71: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L290 TraceCheckUtils]: 72: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {53459#true} {53459#true} #90#return; {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L272 TraceCheckUtils]: 74: Hoare triple {53459#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)); {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L290 TraceCheckUtils]: 75: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L290 TraceCheckUtils]: 76: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L290 TraceCheckUtils]: 77: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {53459#true} {53459#true} #92#return; {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L290 TraceCheckUtils]: 79: Hoare triple {53459#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L290 TraceCheckUtils]: 80: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L290 TraceCheckUtils]: 81: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L272 TraceCheckUtils]: 82: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L290 TraceCheckUtils]: 83: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L290 TraceCheckUtils]: 84: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L290 TraceCheckUtils]: 85: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L272 TraceCheckUtils]: 87: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L290 TraceCheckUtils]: 88: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:25,029 INFO L290 TraceCheckUtils]: 89: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:25,030 INFO L290 TraceCheckUtils]: 90: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,030 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-28 05:43:25,030 INFO L272 TraceCheckUtils]: 92: Hoare triple {53459#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:25,031 INFO L290 TraceCheckUtils]: 93: Hoare triple {53459#true} ~cond := #in~cond; {53743#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:43:25,031 INFO L290 TraceCheckUtils]: 94: Hoare triple {53743#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {53747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:43:25,032 INFO L290 TraceCheckUtils]: 95: Hoare triple {53747#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {53747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:43:25,032 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {53747#(not (= |__VERIFIER_assert_#in~cond| 0))} {53459#true} #90#return; {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:43:25,032 INFO L272 TraceCheckUtils]: 97: Hoare triple {53754#(= 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)); {53459#true} is VALID [2022-04-28 05:43:25,032 INFO L290 TraceCheckUtils]: 98: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:25,032 INFO L290 TraceCheckUtils]: 99: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:25,032 INFO L290 TraceCheckUtils]: 100: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,033 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {53459#true} {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:43:25,033 INFO L290 TraceCheckUtils]: 102: Hoare triple {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:43:25,034 INFO L290 TraceCheckUtils]: 103: Hoare triple {53754#(= 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; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:43:25,034 INFO L290 TraceCheckUtils]: 104: Hoare triple {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:43:25,034 INFO L290 TraceCheckUtils]: 105: Hoare triple {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:43:25,035 INFO L290 TraceCheckUtils]: 106: Hoare triple {53776#(= 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; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:43:25,035 INFO L290 TraceCheckUtils]: 107: Hoare triple {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:43:25,035 INFO L290 TraceCheckUtils]: 108: Hoare triple {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:43:25,035 INFO L272 TraceCheckUtils]: 109: Hoare triple {53776#(= 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)); {53459#true} is VALID [2022-04-28 05:43:25,035 INFO L290 TraceCheckUtils]: 110: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:25,036 INFO L290 TraceCheckUtils]: 111: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:25,036 INFO L290 TraceCheckUtils]: 112: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:25,036 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {53459#true} {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:43:25,037 INFO L272 TraceCheckUtils]: 114: Hoare triple {53776#(= 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)); {53810#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:43:25,037 INFO L290 TraceCheckUtils]: 115: Hoare triple {53810#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53814#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:43:25,037 INFO L290 TraceCheckUtils]: 116: Hoare triple {53814#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53460#false} is VALID [2022-04-28 05:43:25,037 INFO L290 TraceCheckUtils]: 117: Hoare triple {53460#false} assume !false; {53460#false} is VALID [2022-04-28 05:43:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 78 proven. 7 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2022-04-28 05:43:25,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:43:30,578 INFO L290 TraceCheckUtils]: 117: Hoare triple {53460#false} assume !false; {53460#false} is VALID [2022-04-28 05:43:30,578 INFO L290 TraceCheckUtils]: 116: Hoare triple {53814#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53460#false} is VALID [2022-04-28 05:43:30,578 INFO L290 TraceCheckUtils]: 115: Hoare triple {53810#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53814#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:43:30,579 INFO L272 TraceCheckUtils]: 114: Hoare triple {53776#(= 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)); {53810#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:43:30,579 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {53459#true} {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:43:30,579 INFO L290 TraceCheckUtils]: 112: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,580 INFO L290 TraceCheckUtils]: 111: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:30,580 INFO L290 TraceCheckUtils]: 110: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:30,580 INFO L272 TraceCheckUtils]: 109: Hoare triple {53776#(= 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)); {53459#true} is VALID [2022-04-28 05:43:30,580 INFO L290 TraceCheckUtils]: 108: Hoare triple {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:43:30,580 INFO L290 TraceCheckUtils]: 107: Hoare triple {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:43:30,581 INFO L290 TraceCheckUtils]: 106: Hoare triple {53776#(= 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; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:43:30,581 INFO L290 TraceCheckUtils]: 105: Hoare triple {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:43:30,581 INFO L290 TraceCheckUtils]: 104: Hoare triple {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:43:30,582 INFO L290 TraceCheckUtils]: 103: Hoare triple {53754#(= 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; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:43:30,582 INFO L290 TraceCheckUtils]: 102: Hoare triple {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:43:30,582 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {53459#true} {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:43:30,582 INFO L290 TraceCheckUtils]: 100: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,582 INFO L290 TraceCheckUtils]: 99: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:30,582 INFO L290 TraceCheckUtils]: 98: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:30,583 INFO L272 TraceCheckUtils]: 97: Hoare triple {53754#(= 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)); {53459#true} is VALID [2022-04-28 05:43:30,583 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {53747#(not (= |__VERIFIER_assert_#in~cond| 0))} {53459#true} #90#return; {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:43:30,583 INFO L290 TraceCheckUtils]: 95: Hoare triple {53747#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {53747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:43:30,584 INFO L290 TraceCheckUtils]: 94: Hoare triple {53893#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {53747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:43:30,584 INFO L290 TraceCheckUtils]: 93: Hoare triple {53459#true} ~cond := #in~cond; {53893#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:43:30,584 INFO L272 TraceCheckUtils]: 92: Hoare triple {53459#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:30,584 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-28 05:43:30,584 INFO L290 TraceCheckUtils]: 90: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,584 INFO L290 TraceCheckUtils]: 89: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:30,584 INFO L290 TraceCheckUtils]: 88: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:30,584 INFO L272 TraceCheckUtils]: 87: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:30,584 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-28 05:43:30,584 INFO L290 TraceCheckUtils]: 85: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,584 INFO L290 TraceCheckUtils]: 84: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:30,584 INFO L290 TraceCheckUtils]: 83: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L272 TraceCheckUtils]: 82: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L290 TraceCheckUtils]: 81: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L290 TraceCheckUtils]: 80: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L290 TraceCheckUtils]: 79: Hoare triple {53459#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {53459#true} {53459#true} #92#return; {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L290 TraceCheckUtils]: 77: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L290 TraceCheckUtils]: 76: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L290 TraceCheckUtils]: 75: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L272 TraceCheckUtils]: 74: Hoare triple {53459#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)); {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {53459#true} {53459#true} #90#return; {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L290 TraceCheckUtils]: 72: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L290 TraceCheckUtils]: 71: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L290 TraceCheckUtils]: 70: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L272 TraceCheckUtils]: 69: Hoare triple {53459#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L290 TraceCheckUtils]: 67: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L290 TraceCheckUtils]: 66: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L290 TraceCheckUtils]: 65: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L272 TraceCheckUtils]: 64: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-28 05:43:30,585 INFO L290 TraceCheckUtils]: 62: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L290 TraceCheckUtils]: 61: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L272 TraceCheckUtils]: 59: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L290 TraceCheckUtils]: 58: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L290 TraceCheckUtils]: 57: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L290 TraceCheckUtils]: 56: Hoare triple {53459#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L290 TraceCheckUtils]: 55: Hoare triple {53459#true} assume !!(#t~post6 < 10);havoc #t~post6; {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L290 TraceCheckUtils]: 54: Hoare triple {53459#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L290 TraceCheckUtils]: 53: Hoare triple {53459#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; {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L290 TraceCheckUtils]: 52: Hoare triple {53459#true} assume !(~c~0 >= ~b~0); {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {53459#true} {53459#true} #92#return; {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L290 TraceCheckUtils]: 50: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L272 TraceCheckUtils]: 47: Hoare triple {53459#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)); {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {53459#true} {53459#true} #90#return; {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L290 TraceCheckUtils]: 45: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L290 TraceCheckUtils]: 44: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L272 TraceCheckUtils]: 42: Hoare triple {53459#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:30,586 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L290 TraceCheckUtils]: 40: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L290 TraceCheckUtils]: 39: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L290 TraceCheckUtils]: 38: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L272 TraceCheckUtils]: 37: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L290 TraceCheckUtils]: 35: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L272 TraceCheckUtils]: 32: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {53459#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {53459#true} assume !!(#t~post6 < 10);havoc #t~post6; {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {53459#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {53459#true} {53459#true} #84#return; {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L272 TraceCheckUtils]: 22: Hoare triple {53459#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:30,587 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {53459#true} {53459#true} #82#return; {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L272 TraceCheckUtils]: 17: Hoare triple {53459#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {53459#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; {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {53459#true} {53459#true} #80#return; {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L272 TraceCheckUtils]: 11: Hoare triple {53459#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {53459#true} {53459#true} #78#return; {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L272 TraceCheckUtils]: 6: Hoare triple {53459#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {53459#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {53459#true} call #t~ret8 := main(); {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53459#true} {53459#true} #98#return; {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 05:43:30,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {53459#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);~counter~0 := 0; {53459#true} is VALID [2022-04-28 05:43:30,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {53459#true} call ULTIMATE.init(); {53459#true} is VALID [2022-04-28 05:43:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 78 proven. 7 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2022-04-28 05:43:30,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:43:30,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125672812] [2022-04-28 05:43:30,589 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:43:30,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058724036] [2022-04-28 05:43:30,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058724036] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:43:30,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:43:30,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 05:43:30,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:43:30,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [673194658] [2022-04-28 05:43:30,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [673194658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:30,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:30,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:43:30,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109359086] [2022-04-28 05:43:30,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:43:30,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 118 [2022-04-28 05:43:30,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:43:30,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-28 05:43:30,635 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 05:43:30,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:43:30,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:30,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:43:30,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:43:30,636 INFO L87 Difference]: Start difference. First operand 553 states and 692 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-28 05:43:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:32,187 INFO L93 Difference]: Finished difference Result 584 states and 734 transitions. [2022-04-28 05:43:32,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:43:32,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 118 [2022-04-28 05:43:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:43:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-28 05:43:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-04-28 05:43:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-28 05:43:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-04-28 05:43:32,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2022-04-28 05:43:32,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:32,267 INFO L225 Difference]: With dead ends: 584 [2022-04-28 05:43:32,267 INFO L226 Difference]: Without dead ends: 581 [2022-04-28 05:43:32,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 228 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 05:43:32,268 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 21 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:43:32,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 190 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:43:32,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-04-28 05:43:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 577. [2022-04-28 05:43:33,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:43:33,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 581 states. Second operand has 577 states, 380 states have (on average 1.2) internal successors, (456), 388 states have internal predecessors, (456), 137 states have call successors, (137), 60 states have call predecessors, (137), 59 states have return successors, (133), 128 states have call predecessors, (133), 133 states have call successors, (133) [2022-04-28 05:43:33,295 INFO L74 IsIncluded]: Start isIncluded. First operand 581 states. Second operand has 577 states, 380 states have (on average 1.2) internal successors, (456), 388 states have internal predecessors, (456), 137 states have call successors, (137), 60 states have call predecessors, (137), 59 states have return successors, (133), 128 states have call predecessors, (133), 133 states have call successors, (133) [2022-04-28 05:43:33,295 INFO L87 Difference]: Start difference. First operand 581 states. Second operand has 577 states, 380 states have (on average 1.2) internal successors, (456), 388 states have internal predecessors, (456), 137 states have call successors, (137), 60 states have call predecessors, (137), 59 states have return successors, (133), 128 states have call predecessors, (133), 133 states have call successors, (133) [2022-04-28 05:43:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:33,306 INFO L93 Difference]: Finished difference Result 581 states and 730 transitions. [2022-04-28 05:43:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 730 transitions. [2022-04-28 05:43:33,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:33,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:33,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 577 states, 380 states have (on average 1.2) internal successors, (456), 388 states have internal predecessors, (456), 137 states have call successors, (137), 60 states have call predecessors, (137), 59 states have return successors, (133), 128 states have call predecessors, (133), 133 states have call successors, (133) Second operand 581 states. [2022-04-28 05:43:33,308 INFO L87 Difference]: Start difference. First operand has 577 states, 380 states have (on average 1.2) internal successors, (456), 388 states have internal predecessors, (456), 137 states have call successors, (137), 60 states have call predecessors, (137), 59 states have return successors, (133), 128 states have call predecessors, (133), 133 states have call successors, (133) Second operand 581 states. [2022-04-28 05:43:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:33,319 INFO L93 Difference]: Finished difference Result 581 states and 730 transitions. [2022-04-28 05:43:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 730 transitions. [2022-04-28 05:43:33,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:33,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:33,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:43:33,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:43:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 380 states have (on average 1.2) internal successors, (456), 388 states have internal predecessors, (456), 137 states have call successors, (137), 60 states have call predecessors, (137), 59 states have return successors, (133), 128 states have call predecessors, (133), 133 states have call successors, (133) [2022-04-28 05:43:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 726 transitions. [2022-04-28 05:43:33,336 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 726 transitions. Word has length 118 [2022-04-28 05:43:33,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:43:33,336 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 726 transitions. [2022-04-28 05:43:33,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-28 05:43:33,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 577 states and 726 transitions. [2022-04-28 05:43:34,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 726 edges. 726 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 726 transitions. [2022-04-28 05:43:34,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-28 05:43:34,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:43:34,438 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 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] [2022-04-28 05:43:34,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 05:43:34,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-28 05:43:34,656 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:43:34,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:43:34,656 INFO L85 PathProgramCache]: Analyzing trace with hash 992936989, now seen corresponding path program 5 times [2022-04-28 05:43:34,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:34,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1529465231] [2022-04-28 05:43:34,657 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:43:34,657 INFO L85 PathProgramCache]: Analyzing trace with hash 992936989, now seen corresponding path program 6 times [2022-04-28 05:43:34,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:43:34,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806734844] [2022-04-28 05:43:34,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:43:34,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:43:34,665 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:43:34,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [374424256] [2022-04-28 05:43:34,665 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:43:34,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:43:34,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:43:34,666 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:43:34,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 05:43:35,053 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:43:35,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:43:35,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 05:43:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:35,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:43:53,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {57666#true} call ULTIMATE.init(); {57666#true} is VALID [2022-04-28 05:43:53,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {57666#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);~counter~0 := 0; {57666#true} is VALID [2022-04-28 05:43:53,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57666#true} {57666#true} #98#return; {57666#true} is VALID [2022-04-28 05:43:53,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {57666#true} call #t~ret8 := main(); {57666#true} is VALID [2022-04-28 05:43:53,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {57666#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {57666#true} is VALID [2022-04-28 05:43:53,576 INFO L272 TraceCheckUtils]: 6: Hoare triple {57666#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {57666#true} is VALID [2022-04-28 05:43:53,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {57666#true} ~cond := #in~cond; {57692#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:43:53,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {57692#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {57696#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:43:53,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {57696#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {57696#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:43:53,577 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {57696#(not (= |assume_abort_if_not_#in~cond| 0))} {57666#true} #78#return; {57703#(<= 1 main_~x~0)} is VALID [2022-04-28 05:43:53,577 INFO L272 TraceCheckUtils]: 11: Hoare triple {57703#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {57666#true} is VALID [2022-04-28 05:43:53,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 05:43:53,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 05:43:53,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,577 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {57666#true} {57703#(<= 1 main_~x~0)} #80#return; {57703#(<= 1 main_~x~0)} is VALID [2022-04-28 05:43:53,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {57703#(<= 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; {57722#(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_~p~0 1))} is VALID [2022-04-28 05:43:53,578 INFO L272 TraceCheckUtils]: 17: Hoare triple {57722#(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_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {57666#true} is VALID [2022-04-28 05:43:53,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 05:43:53,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 05:43:53,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,578 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {57666#true} {57722#(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_~p~0 1))} #82#return; {57722#(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_~p~0 1))} is VALID [2022-04-28 05:43:53,579 INFO L272 TraceCheckUtils]: 22: Hoare triple {57722#(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_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {57666#true} is VALID [2022-04-28 05:43:53,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {57666#true} ~cond := #in~cond; {57692#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:43:53,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {57692#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {57696#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:43:53,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {57696#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {57696#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:43:53,580 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {57696#(not (= |assume_abort_if_not_#in~cond| 0))} {57722#(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_~p~0 1))} #84#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,582 INFO L272 TraceCheckUtils]: 32: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {57666#true} is VALID [2022-04-28 05:43:53,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 05:43:53,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 05:43:53,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,583 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {57666#true} {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #86#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,583 INFO L272 TraceCheckUtils]: 37: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {57666#true} is VALID [2022-04-28 05:43:53,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 05:43:53,583 INFO L290 TraceCheckUtils]: 39: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 05:43:53,583 INFO L290 TraceCheckUtils]: 40: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,584 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {57666#true} {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #88#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,584 INFO L272 TraceCheckUtils]: 42: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {57666#true} is VALID [2022-04-28 05:43:53,584 INFO L290 TraceCheckUtils]: 43: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 05:43:53,584 INFO L290 TraceCheckUtils]: 44: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 05:43:53,584 INFO L290 TraceCheckUtils]: 45: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,584 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {57666#true} {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #90#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,585 INFO L272 TraceCheckUtils]: 47: Hoare triple {57753#(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_~yy~0 2147483647) (= 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)); {57666#true} is VALID [2022-04-28 05:43:53,585 INFO L290 TraceCheckUtils]: 48: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 05:43:53,585 INFO L290 TraceCheckUtils]: 49: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 05:43:53,585 INFO L290 TraceCheckUtils]: 50: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,585 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {57666#true} {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #92#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,586 INFO L290 TraceCheckUtils]: 52: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,586 INFO L290 TraceCheckUtils]: 53: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,586 INFO L290 TraceCheckUtils]: 54: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,587 INFO L272 TraceCheckUtils]: 55: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {57666#true} is VALID [2022-04-28 05:43:53,587 INFO L290 TraceCheckUtils]: 56: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 05:43:53,587 INFO L290 TraceCheckUtils]: 57: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 05:43:53,587 INFO L290 TraceCheckUtils]: 58: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,587 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {57666#true} {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #86#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,587 INFO L272 TraceCheckUtils]: 60: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {57666#true} is VALID [2022-04-28 05:43:53,587 INFO L290 TraceCheckUtils]: 61: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 05:43:53,587 INFO L290 TraceCheckUtils]: 62: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 05:43:53,588 INFO L290 TraceCheckUtils]: 63: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,588 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {57666#true} {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #88#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,588 INFO L272 TraceCheckUtils]: 65: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {57666#true} is VALID [2022-04-28 05:43:53,588 INFO L290 TraceCheckUtils]: 66: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 05:43:53,588 INFO L290 TraceCheckUtils]: 67: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 05:43:53,588 INFO L290 TraceCheckUtils]: 68: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,589 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {57666#true} {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #90#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,589 INFO L272 TraceCheckUtils]: 70: Hoare triple {57753#(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_~yy~0 2147483647) (= 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)); {57666#true} is VALID [2022-04-28 05:43:53,589 INFO L290 TraceCheckUtils]: 71: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 05:43:53,589 INFO L290 TraceCheckUtils]: 72: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 05:43:53,589 INFO L290 TraceCheckUtils]: 73: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,590 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {57666#true} {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #92#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,591 INFO L290 TraceCheckUtils]: 75: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,591 INFO L290 TraceCheckUtils]: 76: Hoare triple {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,592 INFO L290 TraceCheckUtils]: 77: Hoare triple {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,592 INFO L272 TraceCheckUtils]: 78: Hoare triple {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {57666#true} is VALID [2022-04-28 05:43:53,592 INFO L290 TraceCheckUtils]: 79: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 05:43:53,592 INFO L290 TraceCheckUtils]: 80: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 05:43:53,592 INFO L290 TraceCheckUtils]: 81: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,592 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {57666#true} {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} #86#return; {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,592 INFO L272 TraceCheckUtils]: 83: Hoare triple {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {57666#true} is VALID [2022-04-28 05:43:53,593 INFO L290 TraceCheckUtils]: 84: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 05:43:53,593 INFO L290 TraceCheckUtils]: 85: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 05:43:53,593 INFO L290 TraceCheckUtils]: 86: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,593 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {57666#true} {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} #88#return; {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,593 INFO L272 TraceCheckUtils]: 88: Hoare triple {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {57666#true} is VALID [2022-04-28 05:43:53,593 INFO L290 TraceCheckUtils]: 89: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 05:43:53,593 INFO L290 TraceCheckUtils]: 90: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 05:43:53,593 INFO L290 TraceCheckUtils]: 91: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,594 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {57666#true} {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} #90#return; {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,594 INFO L272 TraceCheckUtils]: 93: Hoare triple {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= 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)); {57666#true} is VALID [2022-04-28 05:43:53,594 INFO L290 TraceCheckUtils]: 94: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 05:43:53,594 INFO L290 TraceCheckUtils]: 95: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 05:43:53,594 INFO L290 TraceCheckUtils]: 96: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,595 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {57666#true} {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} #92#return; {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,595 INFO L290 TraceCheckUtils]: 98: Hoare triple {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~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_~yy~0 2147483647) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {57971#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (not (<= main_~y~0 main_~c~0)) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-28 05:43:53,596 INFO L290 TraceCheckUtils]: 99: Hoare triple {57971#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (not (<= main_~y~0 main_~c~0)) (<= 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_~yy~0 2147483647) (= 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; {57975#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-28 05:43:53,596 INFO L290 TraceCheckUtils]: 100: Hoare triple {57975#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57975#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-28 05:43:53,597 INFO L290 TraceCheckUtils]: 101: Hoare triple {57975#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} assume !!(#t~post6 < 10);havoc #t~post6; {57975#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-28 05:43:53,597 INFO L290 TraceCheckUtils]: 102: Hoare triple {57975#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-28 05:43:53,597 INFO L290 TraceCheckUtils]: 103: Hoare triple {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-28 05:43:53,598 INFO L290 TraceCheckUtils]: 104: Hoare triple {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} assume !!(#t~post7 < 10);havoc #t~post7; {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-28 05:43:53,598 INFO L272 TraceCheckUtils]: 105: Hoare triple {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {57666#true} is VALID [2022-04-28 05:43:53,598 INFO L290 TraceCheckUtils]: 106: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 05:43:53,598 INFO L290 TraceCheckUtils]: 107: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 05:43:53,598 INFO L290 TraceCheckUtils]: 108: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,598 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {57666#true} {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} #86#return; {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-28 05:43:53,599 INFO L272 TraceCheckUtils]: 110: Hoare triple {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {57666#true} is VALID [2022-04-28 05:43:53,599 INFO L290 TraceCheckUtils]: 111: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 05:43:53,599 INFO L290 TraceCheckUtils]: 112: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 05:43:53,599 INFO L290 TraceCheckUtils]: 113: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 05:43:53,599 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {57666#true} {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} #88#return; {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-28 05:43:53,599 INFO L272 TraceCheckUtils]: 115: Hoare triple {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {57666#true} is VALID [2022-04-28 05:43:53,600 INFO L290 TraceCheckUtils]: 116: Hoare triple {57666#true} ~cond := #in~cond; {58028#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:43:53,600 INFO L290 TraceCheckUtils]: 117: Hoare triple {58028#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {58032#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:43:53,600 INFO L290 TraceCheckUtils]: 118: Hoare triple {58032#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {58032#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:43:53,601 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {58032#(not (= |__VERIFIER_assert_#in~cond| 0))} {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} #90#return; {58039#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-28 05:43:53,605 INFO L272 TraceCheckUtils]: 120: Hoare triple {58039#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} 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)); {58043#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:43:53,605 INFO L290 TraceCheckUtils]: 121: Hoare triple {58043#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {58047#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:43:53,606 INFO L290 TraceCheckUtils]: 122: Hoare triple {58047#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {57667#false} is VALID [2022-04-28 05:43:53,606 INFO L290 TraceCheckUtils]: 123: Hoare triple {57667#false} assume !false; {57667#false} is VALID [2022-04-28 05:43:53,606 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2022-04-28 05:43:53,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:44:30,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:44:30,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806734844] [2022-04-28 05:44:30,340 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:44:30,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374424256] [2022-04-28 05:44:30,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374424256] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 05:44:30,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:44:30,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 05:44:30,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:44:30,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1529465231] [2022-04-28 05:44:30,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1529465231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:44:30,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:44:30,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 05:44:30,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723752633] [2022-04-28 05:44:30,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:44:30,341 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 124 [2022-04-28 05:44:30,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:44:30,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-28 05:44:30,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:44:30,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 05:44:30,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:44:30,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 05:44:30,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-04-28 05:44:30,420 INFO L87 Difference]: Start difference. First operand 577 states and 726 transitions. Second operand has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-28 05:44:45,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:45,269 INFO L93 Difference]: Finished difference Result 604 states and 757 transitions. [2022-04-28 05:44:45,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 05:44:45,269 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 124 [2022-04-28 05:44:45,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:44:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-28 05:44:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 111 transitions. [2022-04-28 05:44:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-28 05:44:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 111 transitions. [2022-04-28 05:44:45,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 111 transitions. [2022-04-28 05:44:45,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:44:45,424 INFO L225 Difference]: With dead ends: 604 [2022-04-28 05:44:45,424 INFO L226 Difference]: Without dead ends: 600 [2022-04-28 05:44:45,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2022-04-28 05:44:45,425 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 57 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 05:44:45,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 315 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 05:44:45,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-04-28 05:44:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 578. [2022-04-28 05:44:46,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:44:46,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 600 states. Second operand has 578 states, 384 states have (on average 1.1927083333333333) internal successors, (458), 391 states have internal predecessors, (458), 133 states have call successors, (133), 62 states have call predecessors, (133), 60 states have return successors, (129), 124 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-28 05:44:46,532 INFO L74 IsIncluded]: Start isIncluded. First operand 600 states. Second operand has 578 states, 384 states have (on average 1.1927083333333333) internal successors, (458), 391 states have internal predecessors, (458), 133 states have call successors, (133), 62 states have call predecessors, (133), 60 states have return successors, (129), 124 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-28 05:44:46,532 INFO L87 Difference]: Start difference. First operand 600 states. Second operand has 578 states, 384 states have (on average 1.1927083333333333) internal successors, (458), 391 states have internal predecessors, (458), 133 states have call successors, (133), 62 states have call predecessors, (133), 60 states have return successors, (129), 124 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-28 05:44:46,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:46,544 INFO L93 Difference]: Finished difference Result 600 states and 752 transitions. [2022-04-28 05:44:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 752 transitions. [2022-04-28 05:44:46,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:44:46,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:44:46,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 578 states, 384 states have (on average 1.1927083333333333) internal successors, (458), 391 states have internal predecessors, (458), 133 states have call successors, (133), 62 states have call predecessors, (133), 60 states have return successors, (129), 124 states have call predecessors, (129), 129 states have call successors, (129) Second operand 600 states. [2022-04-28 05:44:46,545 INFO L87 Difference]: Start difference. First operand has 578 states, 384 states have (on average 1.1927083333333333) internal successors, (458), 391 states have internal predecessors, (458), 133 states have call successors, (133), 62 states have call predecessors, (133), 60 states have return successors, (129), 124 states have call predecessors, (129), 129 states have call successors, (129) Second operand 600 states. [2022-04-28 05:44:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:46,557 INFO L93 Difference]: Finished difference Result 600 states and 752 transitions. [2022-04-28 05:44:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 752 transitions. [2022-04-28 05:44:46,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:44:46,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:44:46,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:44:46,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:44:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 384 states have (on average 1.1927083333333333) internal successors, (458), 391 states have internal predecessors, (458), 133 states have call successors, (133), 62 states have call predecessors, (133), 60 states have return successors, (129), 124 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-28 05:44:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 720 transitions. [2022-04-28 05:44:46,574 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 720 transitions. Word has length 124 [2022-04-28 05:44:46,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:44:46,574 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 720 transitions. [2022-04-28 05:44:46,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-28 05:44:46,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 578 states and 720 transitions. [2022-04-28 05:44:47,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 720 edges. 720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:44:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 720 transitions. [2022-04-28 05:44:47,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 05:44:47,786 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:44:47,786 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:44:47,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 05:44:47,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:44:47,986 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:44:47,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:44:47,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1110867224, now seen corresponding path program 7 times [2022-04-28 05:44:47,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:44:47,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [962522015] [2022-04-28 05:44:47,999 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:44:47,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1110867224, now seen corresponding path program 8 times [2022-04-28 05:44:47,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:44:47,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549985299] [2022-04-28 05:44:47,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:44:47,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:44:48,008 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:44:48,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [772403470] [2022-04-28 05:44:48,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:44:48,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:44:48,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:44:48,010 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:44:48,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 05:44:48,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:44:48,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:44:48,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-28 05:44:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:44:48,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:44:59,732 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:45:06,078 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:45:12,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {61782#true} call ULTIMATE.init(); {61782#true} is VALID [2022-04-28 05:45:12,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {61782#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);~counter~0 := 0; {61782#true} is VALID [2022-04-28 05:45:12,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:45:12,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61782#true} {61782#true} #98#return; {61782#true} is VALID [2022-04-28 05:45:12,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {61782#true} call #t~ret8 := main(); {61782#true} is VALID [2022-04-28 05:45:12,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {61782#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {61782#true} is VALID [2022-04-28 05:45:12,581 INFO L272 TraceCheckUtils]: 6: Hoare triple {61782#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:45:12,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:45:12,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:45:12,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:45:12,581 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {61782#true} {61782#true} #78#return; {61782#true} is VALID [2022-04-28 05:45:12,581 INFO L272 TraceCheckUtils]: 11: Hoare triple {61782#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:45:12,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:45:12,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:45:12,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:45:12,581 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {61782#true} {61782#true} #80#return; {61782#true} is VALID [2022-04-28 05:45:12,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {61782#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; {61835#(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))} is VALID [2022-04-28 05:45:12,581 INFO L272 TraceCheckUtils]: 17: Hoare triple {61835#(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))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:45:12,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:45:12,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:45:12,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:45:12,582 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {61782#true} {61835#(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))} #82#return; {61835#(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))} is VALID [2022-04-28 05:45:12,582 INFO L272 TraceCheckUtils]: 22: Hoare triple {61835#(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))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:45:12,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:45:12,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:45:12,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:45:12,583 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {61782#true} {61835#(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))} #84#return; {61835#(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))} is VALID [2022-04-28 05:45:12,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {61835#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61835#(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))} is VALID [2022-04-28 05:45:12,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {61835#(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))} assume !!(#t~post6 < 10);havoc #t~post6; {61835#(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))} is VALID [2022-04-28 05:45:12,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {61835#(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))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {61875#(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))} is VALID [2022-04-28 05:45:12,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {61875#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61875#(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))} is VALID [2022-04-28 05:45:12,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {61875#(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))} assume !!(#t~post7 < 10);havoc #t~post7; {61875#(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))} is VALID [2022-04-28 05:45:12,585 INFO L272 TraceCheckUtils]: 32: Hoare triple {61875#(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))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:45:12,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:45:12,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:45:12,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:45:12,585 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {61782#true} {61875#(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))} #86#return; {61875#(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))} is VALID [2022-04-28 05:45:12,585 INFO L272 TraceCheckUtils]: 37: Hoare triple {61875#(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))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:45:12,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:45:12,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:45:12,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:45:12,586 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {61782#true} {61875#(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))} #88#return; {61875#(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))} is VALID [2022-04-28 05:45:12,586 INFO L272 TraceCheckUtils]: 42: Hoare triple {61875#(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))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:45:12,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {61782#true} ~cond := #in~cond; {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:45:12,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:12,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:12,587 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} {61875#(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))} #90#return; {61875#(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))} is VALID [2022-04-28 05:45:12,588 INFO L272 TraceCheckUtils]: 47: Hoare triple {61875#(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))} 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)); {61782#true} is VALID [2022-04-28 05:45:12,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:45:12,588 INFO L290 TraceCheckUtils]: 49: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:45:12,588 INFO L290 TraceCheckUtils]: 50: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:45:12,588 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {61782#true} {61875#(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))} #92#return; {61875#(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))} is VALID [2022-04-28 05:45:12,589 INFO L290 TraceCheckUtils]: 52: Hoare triple {61875#(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))} assume !(~c~0 >= ~b~0); {61875#(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))} is VALID [2022-04-28 05:45:12,589 INFO L290 TraceCheckUtils]: 53: Hoare triple {61875#(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))} ~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; {61950#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:45:12,589 INFO L290 TraceCheckUtils]: 54: Hoare triple {61950#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61950#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:45:12,590 INFO L290 TraceCheckUtils]: 55: Hoare triple {61950#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(#t~post6 < 10);havoc #t~post6; {61950#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:45:12,590 INFO L290 TraceCheckUtils]: 56: Hoare triple {61950#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} is VALID [2022-04-28 05:45:12,590 INFO L290 TraceCheckUtils]: 57: Hoare triple {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} is VALID [2022-04-28 05:45:12,591 INFO L290 TraceCheckUtils]: 58: Hoare triple {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} assume !!(#t~post7 < 10);havoc #t~post7; {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} is VALID [2022-04-28 05:45:12,591 INFO L272 TraceCheckUtils]: 59: Hoare triple {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:45:12,591 INFO L290 TraceCheckUtils]: 60: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:45:12,591 INFO L290 TraceCheckUtils]: 61: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:45:12,591 INFO L290 TraceCheckUtils]: 62: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:45:12,592 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {61782#true} {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} #86#return; {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} is VALID [2022-04-28 05:45:12,592 INFO L272 TraceCheckUtils]: 64: Hoare triple {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:45:12,592 INFO L290 TraceCheckUtils]: 65: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:45:12,592 INFO L290 TraceCheckUtils]: 66: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:45:12,592 INFO L290 TraceCheckUtils]: 67: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:45:12,592 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {61782#true} {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} #88#return; {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} is VALID [2022-04-28 05:45:12,592 INFO L272 TraceCheckUtils]: 69: Hoare triple {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:45:12,593 INFO L290 TraceCheckUtils]: 70: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:45:12,593 INFO L290 TraceCheckUtils]: 71: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:45:12,593 INFO L290 TraceCheckUtils]: 72: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:45:12,593 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {61782#true} {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} #90#return; {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} is VALID [2022-04-28 05:45:12,593 INFO L272 TraceCheckUtils]: 74: Hoare triple {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} 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)); {61782#true} is VALID [2022-04-28 05:45:12,593 INFO L290 TraceCheckUtils]: 75: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:45:12,593 INFO L290 TraceCheckUtils]: 76: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:45:12,593 INFO L290 TraceCheckUtils]: 77: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:45:12,594 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {61782#true} {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} #92#return; {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} is VALID [2022-04-28 05:45:12,595 INFO L290 TraceCheckUtils]: 79: Hoare triple {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 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))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} is VALID [2022-04-28 05:45:12,595 INFO L290 TraceCheckUtils]: 80: Hoare triple {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} is VALID [2022-04-28 05:45:12,596 INFO L290 TraceCheckUtils]: 81: Hoare triple {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} is VALID [2022-04-28 05:45:12,596 INFO L272 TraceCheckUtils]: 82: Hoare triple {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:45:12,596 INFO L290 TraceCheckUtils]: 83: Hoare triple {61782#true} ~cond := #in~cond; {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:45:12,596 INFO L290 TraceCheckUtils]: 84: Hoare triple {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:12,596 INFO L290 TraceCheckUtils]: 85: Hoare triple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:12,597 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} #86#return; {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} is VALID [2022-04-28 05:45:12,597 INFO L272 TraceCheckUtils]: 87: Hoare triple {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:45:12,597 INFO L290 TraceCheckUtils]: 88: Hoare triple {61782#true} ~cond := #in~cond; {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:45:12,598 INFO L290 TraceCheckUtils]: 89: Hoare triple {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:12,598 INFO L290 TraceCheckUtils]: 90: Hoare triple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:12,599 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} #88#return; {62067#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-28 05:45:12,599 INFO L272 TraceCheckUtils]: 92: Hoare triple {62067#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:45:12,599 INFO L290 TraceCheckUtils]: 93: Hoare triple {61782#true} ~cond := #in~cond; {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:45:12,599 INFO L290 TraceCheckUtils]: 94: Hoare triple {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:12,600 INFO L290 TraceCheckUtils]: 95: Hoare triple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:12,601 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} {62067#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #90#return; {62083#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~y~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:45:12,602 INFO L272 TraceCheckUtils]: 97: Hoare triple {62083#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~y~0 (+ (* main_~q~0 main_~x~0) main_~c~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)); {61782#true} is VALID [2022-04-28 05:45:12,602 INFO L290 TraceCheckUtils]: 98: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:45:12,602 INFO L290 TraceCheckUtils]: 99: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:45:12,602 INFO L290 TraceCheckUtils]: 100: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:45:12,602 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {61782#true} {62083#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~y~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))))} #92#return; {62083#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~y~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:45:12,603 INFO L290 TraceCheckUtils]: 102: Hoare triple {62083#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~y~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {62083#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~y~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:45:12,605 INFO L290 TraceCheckUtils]: 103: Hoare triple {62083#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~y~0 (+ (* main_~q~0 main_~x~0) main_~c~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; {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} is VALID [2022-04-28 05:45:12,606 INFO L290 TraceCheckUtils]: 104: Hoare triple {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} is VALID [2022-04-28 05:45:12,606 INFO L290 TraceCheckUtils]: 105: Hoare triple {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} is VALID [2022-04-28 05:45:12,607 INFO L290 TraceCheckUtils]: 106: Hoare triple {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} is VALID [2022-04-28 05:45:12,607 INFO L290 TraceCheckUtils]: 107: Hoare triple {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} is VALID [2022-04-28 05:45:12,607 INFO L290 TraceCheckUtils]: 108: Hoare triple {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} is VALID [2022-04-28 05:45:12,608 INFO L272 TraceCheckUtils]: 109: Hoare triple {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:45:12,608 INFO L290 TraceCheckUtils]: 110: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:45:12,608 INFO L290 TraceCheckUtils]: 111: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:45:12,608 INFO L290 TraceCheckUtils]: 112: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:45:12,608 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {61782#true} {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} #86#return; {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} is VALID [2022-04-28 05:45:12,608 INFO L272 TraceCheckUtils]: 114: Hoare triple {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:45:12,608 INFO L290 TraceCheckUtils]: 115: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:45:12,608 INFO L290 TraceCheckUtils]: 116: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:45:12,608 INFO L290 TraceCheckUtils]: 117: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:45:12,609 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {61782#true} {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} #88#return; {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} is VALID [2022-04-28 05:45:12,611 INFO L272 TraceCheckUtils]: 119: Hoare triple {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {62154#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:45:12,611 INFO L290 TraceCheckUtils]: 120: Hoare triple {62154#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {62158#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:45:12,612 INFO L290 TraceCheckUtils]: 121: Hoare triple {62158#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {61783#false} is VALID [2022-04-28 05:45:12,612 INFO L290 TraceCheckUtils]: 122: Hoare triple {61783#false} assume !false; {61783#false} is VALID [2022-04-28 05:45:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 93 proven. 101 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-28 05:45:12,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:46:16,502 INFO L290 TraceCheckUtils]: 122: Hoare triple {61783#false} assume !false; {61783#false} is VALID [2022-04-28 05:46:16,503 INFO L290 TraceCheckUtils]: 121: Hoare triple {62158#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {61783#false} is VALID [2022-04-28 05:46:16,503 INFO L290 TraceCheckUtils]: 120: Hoare triple {62154#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {62158#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:46:16,503 INFO L272 TraceCheckUtils]: 119: Hoare triple {62174#(= 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)); {62154#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:46:16,504 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {61782#true} {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:46:16,504 INFO L290 TraceCheckUtils]: 117: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:46:16,504 INFO L290 TraceCheckUtils]: 116: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:46:16,504 INFO L290 TraceCheckUtils]: 115: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:46:16,504 INFO L272 TraceCheckUtils]: 114: Hoare triple {62174#(= 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)); {61782#true} is VALID [2022-04-28 05:46:16,505 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {61782#true} {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:46:16,505 INFO L290 TraceCheckUtils]: 112: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:46:16,505 INFO L290 TraceCheckUtils]: 111: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:46:16,505 INFO L290 TraceCheckUtils]: 110: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:46:16,505 INFO L272 TraceCheckUtils]: 109: Hoare triple {62174#(= 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)); {61782#true} is VALID [2022-04-28 05:46:16,505 INFO L290 TraceCheckUtils]: 108: Hoare triple {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:46:16,506 INFO L290 TraceCheckUtils]: 107: Hoare triple {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:46:16,506 INFO L290 TraceCheckUtils]: 106: Hoare triple {62174#(= 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; {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:46:16,506 INFO L290 TraceCheckUtils]: 105: Hoare triple {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:46:16,507 INFO L290 TraceCheckUtils]: 104: Hoare triple {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:46:18,509 WARN L290 TraceCheckUtils]: 103: Hoare triple {62223#(= (+ (* (+ (* (* 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; {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-28 05:46:18,509 INFO L290 TraceCheckUtils]: 102: Hoare triple {62223#(= (+ (* (+ (* (* 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); {62223#(= (+ (* (+ (* (* 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 05:46:18,510 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {61782#true} {62223#(= (+ (* (+ (* (* 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)} #92#return; {62223#(= (+ (* (+ (* (* 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 05:46:18,510 INFO L290 TraceCheckUtils]: 100: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:46:18,510 INFO L290 TraceCheckUtils]: 99: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:46:18,510 INFO L290 TraceCheckUtils]: 98: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:46:18,510 INFO L272 TraceCheckUtils]: 97: Hoare triple {62223#(= (+ (* (+ (* (* 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)); {61782#true} is VALID [2022-04-28 05:46:18,511 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} {62245#(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)))))} #90#return; {62223#(= (+ (* (+ (* (* 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 05:46:18,511 INFO L290 TraceCheckUtils]: 95: Hoare triple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:46:18,512 INFO L290 TraceCheckUtils]: 94: Hoare triple {62255#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:46:18,512 INFO L290 TraceCheckUtils]: 93: Hoare triple {61782#true} ~cond := #in~cond; {62255#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:46:18,512 INFO L272 TraceCheckUtils]: 92: Hoare triple {62245#(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)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:46:18,513 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} {62262#(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_~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)))))} #88#return; {62245#(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)))))} is VALID [2022-04-28 05:46:18,513 INFO L290 TraceCheckUtils]: 90: Hoare triple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:46:18,513 INFO L290 TraceCheckUtils]: 89: Hoare triple {62255#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:46:18,514 INFO L290 TraceCheckUtils]: 88: Hoare triple {61782#true} ~cond := #in~cond; {62255#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:46:18,514 INFO L272 TraceCheckUtils]: 87: Hoare triple {62262#(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_~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)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:46:18,585 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} {61782#true} #86#return; {62262#(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_~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)))))} is VALID [2022-04-28 05:46:18,585 INFO L290 TraceCheckUtils]: 85: Hoare triple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:46:18,586 INFO L290 TraceCheckUtils]: 84: Hoare triple {62255#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:46:18,586 INFO L290 TraceCheckUtils]: 83: Hoare triple {61782#true} ~cond := #in~cond; {62255#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:46:18,586 INFO L272 TraceCheckUtils]: 82: Hoare triple {61782#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:46:18,586 INFO L290 TraceCheckUtils]: 81: Hoare triple {61782#true} assume !!(#t~post7 < 10);havoc #t~post7; {61782#true} is VALID [2022-04-28 05:46:18,586 INFO L290 TraceCheckUtils]: 80: Hoare triple {61782#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61782#true} is VALID [2022-04-28 05:46:18,586 INFO L290 TraceCheckUtils]: 79: Hoare triple {61782#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {61782#true} is VALID [2022-04-28 05:46:18,586 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {61782#true} {61782#true} #92#return; {61782#true} is VALID [2022-04-28 05:46:18,586 INFO L290 TraceCheckUtils]: 77: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:46:18,586 INFO L290 TraceCheckUtils]: 76: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:46:18,586 INFO L290 TraceCheckUtils]: 75: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:46:18,586 INFO L272 TraceCheckUtils]: 74: Hoare triple {61782#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)); {61782#true} is VALID [2022-04-28 05:46:18,586 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {61782#true} {61782#true} #90#return; {61782#true} is VALID [2022-04-28 05:46:18,586 INFO L290 TraceCheckUtils]: 72: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L290 TraceCheckUtils]: 71: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L290 TraceCheckUtils]: 70: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L272 TraceCheckUtils]: 69: Hoare triple {61782#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {61782#true} {61782#true} #88#return; {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L290 TraceCheckUtils]: 67: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L290 TraceCheckUtils]: 66: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L290 TraceCheckUtils]: 65: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L272 TraceCheckUtils]: 64: Hoare triple {61782#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {61782#true} {61782#true} #86#return; {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L290 TraceCheckUtils]: 62: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L290 TraceCheckUtils]: 61: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L290 TraceCheckUtils]: 60: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L272 TraceCheckUtils]: 59: Hoare triple {61782#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L290 TraceCheckUtils]: 58: Hoare triple {61782#true} assume !!(#t~post7 < 10);havoc #t~post7; {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L290 TraceCheckUtils]: 57: Hoare triple {61782#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L290 TraceCheckUtils]: 56: Hoare triple {61782#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L290 TraceCheckUtils]: 55: Hoare triple {61782#true} assume !!(#t~post6 < 10);havoc #t~post6; {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L290 TraceCheckUtils]: 54: Hoare triple {61782#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L290 TraceCheckUtils]: 53: Hoare triple {61782#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; {61782#true} is VALID [2022-04-28 05:46:18,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {61782#true} assume !(~c~0 >= ~b~0); {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {61782#true} {61782#true} #92#return; {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L290 TraceCheckUtils]: 50: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L290 TraceCheckUtils]: 49: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L272 TraceCheckUtils]: 47: Hoare triple {61782#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)); {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {61782#true} {61782#true} #90#return; {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L290 TraceCheckUtils]: 43: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L272 TraceCheckUtils]: 42: Hoare triple {61782#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {61782#true} {61782#true} #88#return; {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L290 TraceCheckUtils]: 39: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L272 TraceCheckUtils]: 37: Hoare triple {61782#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {61782#true} {61782#true} #86#return; {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L290 TraceCheckUtils]: 34: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L272 TraceCheckUtils]: 32: Hoare triple {61782#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:46:18,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {61782#true} assume !!(#t~post7 < 10);havoc #t~post7; {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {61782#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {61782#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {61782#true} assume !!(#t~post6 < 10);havoc #t~post6; {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {61782#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {61782#true} {61782#true} #84#return; {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L272 TraceCheckUtils]: 22: Hoare triple {61782#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {61782#true} {61782#true} #82#return; {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L272 TraceCheckUtils]: 17: Hoare triple {61782#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {61782#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; {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {61782#true} {61782#true} #80#return; {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:46:18,589 INFO L272 TraceCheckUtils]: 11: Hoare triple {61782#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:46:18,590 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {61782#true} {61782#true} #78#return; {61782#true} is VALID [2022-04-28 05:46:18,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:46:18,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 05:46:18,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 05:46:18,590 INFO L272 TraceCheckUtils]: 6: Hoare triple {61782#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {61782#true} is VALID [2022-04-28 05:46:18,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {61782#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {61782#true} is VALID [2022-04-28 05:46:18,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {61782#true} call #t~ret8 := main(); {61782#true} is VALID [2022-04-28 05:46:18,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61782#true} {61782#true} #98#return; {61782#true} is VALID [2022-04-28 05:46:18,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 05:46:18,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {61782#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);~counter~0 := 0; {61782#true} is VALID [2022-04-28 05:46:18,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {61782#true} call ULTIMATE.init(); {61782#true} is VALID [2022-04-28 05:46:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 125 proven. 32 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2022-04-28 05:46:18,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:46:18,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549985299] [2022-04-28 05:46:18,591 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:46:18,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772403470] [2022-04-28 05:46:18,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772403470] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:46:18,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:46:18,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2022-04-28 05:46:18,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:46:18,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [962522015] [2022-04-28 05:46:18,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [962522015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:46:18,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:46:18,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 05:46:18,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086079557] [2022-04-28 05:46:18,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:46:18,591 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) Word has length 123 [2022-04-28 05:46:18,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:46:18,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-28 05:46:18,685 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 05:46:18,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 05:46:18,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:46:18,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 05:46:18,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-28 05:46:18,685 INFO L87 Difference]: Start difference. First operand 578 states and 720 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-28 05:46:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:46:22,235 INFO L93 Difference]: Finished difference Result 613 states and 769 transitions. [2022-04-28 05:46:22,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:46:22,235 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) Word has length 123 [2022-04-28 05:46:22,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:46:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-28 05:46:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2022-04-28 05:46:22,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-28 05:46:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2022-04-28 05:46:22,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 138 transitions. [2022-04-28 05:46:22,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:46:22,416 INFO L225 Difference]: With dead ends: 613 [2022-04-28 05:46:22,416 INFO L226 Difference]: Without dead ends: 611 [2022-04-28 05:46:22,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-04-28 05:46:22,416 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 39 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 05:46:22,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 363 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 05:46:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-04-28 05:46:23,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 605. [2022-04-28 05:46:23,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:46:23,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 611 states. Second operand has 605 states, 397 states have (on average 1.1964735516372795) internal successors, (475), 404 states have internal predecessors, (475), 145 states have call successors, (145), 64 states have call predecessors, (145), 62 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 05:46:23,619 INFO L74 IsIncluded]: Start isIncluded. First operand 611 states. Second operand has 605 states, 397 states have (on average 1.1964735516372795) internal successors, (475), 404 states have internal predecessors, (475), 145 states have call successors, (145), 64 states have call predecessors, (145), 62 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 05:46:23,619 INFO L87 Difference]: Start difference. First operand 611 states. Second operand has 605 states, 397 states have (on average 1.1964735516372795) internal successors, (475), 404 states have internal predecessors, (475), 145 states have call successors, (145), 64 states have call predecessors, (145), 62 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 05:46:23,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:46:23,632 INFO L93 Difference]: Finished difference Result 611 states and 767 transitions. [2022-04-28 05:46:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 767 transitions. [2022-04-28 05:46:23,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:46:23,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:46:23,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 605 states, 397 states have (on average 1.1964735516372795) internal successors, (475), 404 states have internal predecessors, (475), 145 states have call successors, (145), 64 states have call predecessors, (145), 62 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) Second operand 611 states. [2022-04-28 05:46:23,633 INFO L87 Difference]: Start difference. First operand has 605 states, 397 states have (on average 1.1964735516372795) internal successors, (475), 404 states have internal predecessors, (475), 145 states have call successors, (145), 64 states have call predecessors, (145), 62 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) Second operand 611 states. [2022-04-28 05:46:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:46:23,646 INFO L93 Difference]: Finished difference Result 611 states and 767 transitions. [2022-04-28 05:46:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 767 transitions. [2022-04-28 05:46:23,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:46:23,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:46:23,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:46:23,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:46:23,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 397 states have (on average 1.1964735516372795) internal successors, (475), 404 states have internal predecessors, (475), 145 states have call successors, (145), 64 states have call predecessors, (145), 62 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 05:46:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 761 transitions. [2022-04-28 05:46:23,665 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 761 transitions. Word has length 123 [2022-04-28 05:46:23,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:46:23,665 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 761 transitions. [2022-04-28 05:46:23,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-28 05:46:23,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 605 states and 761 transitions. [2022-04-28 05:46:25,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 761 edges. 761 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:46:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 761 transitions. [2022-04-28 05:46:25,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-28 05:46:25,062 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:46:25,062 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:46:25,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 05:46:25,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:46:25,271 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:46:25,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:46:25,272 INFO L85 PathProgramCache]: Analyzing trace with hash -270396677, now seen corresponding path program 9 times [2022-04-28 05:46:25,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:46:25,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [367708463] [2022-04-28 05:46:25,272 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:46:25,272 INFO L85 PathProgramCache]: Analyzing trace with hash -270396677, now seen corresponding path program 10 times [2022-04-28 05:46:25,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:46:25,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609093699] [2022-04-28 05:46:25,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:46:25,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:46:25,283 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:46:25,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980890875] [2022-04-28 05:46:25,283 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:46:25,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:46:25,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:46:25,284 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:46:25,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 05:46:25,346 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:46:25,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:46:25,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-28 05:46:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:46:25,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:46:26,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {66204#true} call ULTIMATE.init(); {66204#true} is VALID [2022-04-28 05:46:26,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {66204#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);~counter~0 := 0; {66204#true} is VALID [2022-04-28 05:46:26,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66204#true} {66204#true} #98#return; {66204#true} is VALID [2022-04-28 05:46:26,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {66204#true} call #t~ret8 := main(); {66204#true} is VALID [2022-04-28 05:46:26,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {66204#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {66204#true} is VALID [2022-04-28 05:46:26,733 INFO L272 TraceCheckUtils]: 6: Hoare triple {66204#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {66204#true} is VALID [2022-04-28 05:46:26,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:46:26,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:46:26,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,733 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {66204#true} {66204#true} #78#return; {66204#true} is VALID [2022-04-28 05:46:26,733 INFO L272 TraceCheckUtils]: 11: Hoare triple {66204#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {66204#true} is VALID [2022-04-28 05:46:26,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:46:26,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:46:26,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,733 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {66204#true} {66204#true} #80#return; {66204#true} is VALID [2022-04-28 05:46:26,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {66204#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; {66257#(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 05:46:26,734 INFO L272 TraceCheckUtils]: 17: Hoare triple {66257#(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)); {66204#true} is VALID [2022-04-28 05:46:26,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:46:26,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:46:26,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,734 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {66204#true} {66257#(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))} #82#return; {66257#(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 05:46:26,735 INFO L272 TraceCheckUtils]: 22: Hoare triple {66257#(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)); {66204#true} is VALID [2022-04-28 05:46:26,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:46:26,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:46:26,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,735 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {66204#true} {66257#(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))} #84#return; {66257#(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 05:46:26,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {66257#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66257#(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 05:46:26,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {66257#(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 !!(#t~post6 < 10);havoc #t~post6; {66257#(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 05:46:26,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {66257#(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; {66297#(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 05:46:26,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {66297#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66297#(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 05:46:26,738 INFO L290 TraceCheckUtils]: 31: Hoare triple {66297#(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 !!(#t~post7 < 10);havoc #t~post7; {66297#(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 05:46:26,738 INFO L272 TraceCheckUtils]: 32: Hoare triple {66297#(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)); {66204#true} is VALID [2022-04-28 05:46:26,738 INFO L290 TraceCheckUtils]: 33: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:46:26,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:46:26,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,738 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {66204#true} {66297#(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))} #86#return; {66297#(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 05:46:26,739 INFO L272 TraceCheckUtils]: 37: Hoare triple {66297#(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)); {66204#true} is VALID [2022-04-28 05:46:26,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {66204#true} ~cond := #in~cond; {66325#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:46:26,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {66325#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:46:26,739 INFO L290 TraceCheckUtils]: 40: Hoare triple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:46:26,740 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} {66297#(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))} #88#return; {66336#(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 05:46:26,740 INFO L272 TraceCheckUtils]: 42: Hoare triple {66336#(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)); {66204#true} is VALID [2022-04-28 05:46:26,741 INFO L290 TraceCheckUtils]: 43: Hoare triple {66204#true} ~cond := #in~cond; {66325#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:46:26,741 INFO L290 TraceCheckUtils]: 44: Hoare triple {66325#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:46:26,741 INFO L290 TraceCheckUtils]: 45: Hoare triple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:46:26,742 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} {66336#(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))} #90#return; {66336#(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 05:46:26,742 INFO L272 TraceCheckUtils]: 47: Hoare triple {66336#(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)); {66204#true} is VALID [2022-04-28 05:46:26,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:46:26,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:46:26,742 INFO L290 TraceCheckUtils]: 50: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,743 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {66204#true} {66336#(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))} #92#return; {66336#(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 05:46:26,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {66336#(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); {66336#(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 05:46:26,744 INFO L290 TraceCheckUtils]: 53: Hoare triple {66336#(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; {66373#(and (= main_~s~0 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_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:46:26,744 INFO L290 TraceCheckUtils]: 54: Hoare triple {66373#(and (= main_~s~0 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_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66373#(and (= main_~s~0 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_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:46:26,745 INFO L290 TraceCheckUtils]: 55: Hoare triple {66373#(and (= main_~s~0 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_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {66373#(and (= main_~s~0 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_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:46:26,745 INFO L290 TraceCheckUtils]: 56: Hoare triple {66373#(and (= main_~s~0 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_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {66383#(and (= main_~s~0 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_~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 05:46:26,745 INFO L290 TraceCheckUtils]: 57: Hoare triple {66383#(and (= main_~s~0 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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66383#(and (= main_~s~0 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_~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 05:46:26,746 INFO L290 TraceCheckUtils]: 58: Hoare triple {66383#(and (= main_~s~0 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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {66383#(and (= main_~s~0 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_~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 05:46:26,746 INFO L272 TraceCheckUtils]: 59: Hoare triple {66383#(and (= main_~s~0 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_~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)); {66204#true} is VALID [2022-04-28 05:46:26,746 INFO L290 TraceCheckUtils]: 60: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:46:26,746 INFO L290 TraceCheckUtils]: 61: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:46:26,746 INFO L290 TraceCheckUtils]: 62: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,747 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {66204#true} {66383#(and (= main_~s~0 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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {66383#(and (= main_~s~0 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_~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 05:46:26,747 INFO L272 TraceCheckUtils]: 64: Hoare triple {66383#(and (= main_~s~0 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_~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)); {66204#true} is VALID [2022-04-28 05:46:26,747 INFO L290 TraceCheckUtils]: 65: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:46:26,747 INFO L290 TraceCheckUtils]: 66: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:46:26,747 INFO L290 TraceCheckUtils]: 67: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,748 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {66204#true} {66383#(and (= main_~s~0 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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {66383#(and (= main_~s~0 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_~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 05:46:26,748 INFO L272 TraceCheckUtils]: 69: Hoare triple {66383#(and (= main_~s~0 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_~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)); {66204#true} is VALID [2022-04-28 05:46:26,748 INFO L290 TraceCheckUtils]: 70: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:46:26,748 INFO L290 TraceCheckUtils]: 71: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:46:26,748 INFO L290 TraceCheckUtils]: 72: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,748 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {66204#true} {66383#(and (= main_~s~0 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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {66383#(and (= main_~s~0 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_~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 05:46:26,748 INFO L272 TraceCheckUtils]: 74: Hoare triple {66383#(and (= main_~s~0 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_~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)); {66204#true} is VALID [2022-04-28 05:46:26,748 INFO L290 TraceCheckUtils]: 75: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:46:26,749 INFO L290 TraceCheckUtils]: 76: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:46:26,749 INFO L290 TraceCheckUtils]: 77: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,749 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {66204#true} {66383#(and (= main_~s~0 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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #92#return; {66383#(and (= main_~s~0 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_~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 05:46:26,750 INFO L290 TraceCheckUtils]: 79: Hoare triple {66383#(and (= main_~s~0 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_~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; {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= 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 05:46:26,750 INFO L290 TraceCheckUtils]: 80: Hoare triple {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= 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 05:46:26,751 INFO L290 TraceCheckUtils]: 81: Hoare triple {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= 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 05:46:26,751 INFO L272 TraceCheckUtils]: 82: Hoare triple {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= 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)); {66204#true} is VALID [2022-04-28 05:46:26,751 INFO L290 TraceCheckUtils]: 83: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:46:26,751 INFO L290 TraceCheckUtils]: 84: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:46:26,751 INFO L290 TraceCheckUtils]: 85: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,751 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {66204#true} {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= 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 05:46:26,752 INFO L272 TraceCheckUtils]: 87: Hoare triple {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= 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)); {66204#true} is VALID [2022-04-28 05:46:26,752 INFO L290 TraceCheckUtils]: 88: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:46:26,752 INFO L290 TraceCheckUtils]: 89: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:46:26,752 INFO L290 TraceCheckUtils]: 90: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,752 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {66204#true} {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= 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 05:46:26,752 INFO L272 TraceCheckUtils]: 92: Hoare triple {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= 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)); {66204#true} is VALID [2022-04-28 05:46:26,752 INFO L290 TraceCheckUtils]: 93: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:46:26,752 INFO L290 TraceCheckUtils]: 94: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:46:26,753 INFO L290 TraceCheckUtils]: 95: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,753 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {66204#true} {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= 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 05:46:26,753 INFO L272 TraceCheckUtils]: 97: Hoare triple {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= 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)); {66204#true} is VALID [2022-04-28 05:46:26,753 INFO L290 TraceCheckUtils]: 98: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:46:26,753 INFO L290 TraceCheckUtils]: 99: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:46:26,753 INFO L290 TraceCheckUtils]: 100: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,754 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {66204#true} {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #92#return; {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= 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 05:46:26,754 INFO L290 TraceCheckUtils]: 102: Hoare triple {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= 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); {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= 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 05:46:26,755 INFO L290 TraceCheckUtils]: 103: Hoare triple {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= 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; {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~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 05:46:26,755 INFO L290 TraceCheckUtils]: 104: Hoare triple {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~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 05:46:26,756 INFO L290 TraceCheckUtils]: 105: Hoare triple {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~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 05:46:26,756 INFO L290 TraceCheckUtils]: 106: Hoare triple {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= 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; {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~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 05:46:26,756 INFO L290 TraceCheckUtils]: 107: Hoare triple {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~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 05:46:26,757 INFO L290 TraceCheckUtils]: 108: Hoare triple {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~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 05:46:26,757 INFO L272 TraceCheckUtils]: 109: Hoare triple {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= 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)); {66204#true} is VALID [2022-04-28 05:46:26,757 INFO L290 TraceCheckUtils]: 110: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:46:26,757 INFO L290 TraceCheckUtils]: 111: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:46:26,757 INFO L290 TraceCheckUtils]: 112: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,758 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {66204#true} {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~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 05:46:26,758 INFO L272 TraceCheckUtils]: 114: Hoare triple {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= 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)); {66204#true} is VALID [2022-04-28 05:46:26,758 INFO L290 TraceCheckUtils]: 115: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:46:26,758 INFO L290 TraceCheckUtils]: 116: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:46:26,758 INFO L290 TraceCheckUtils]: 117: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:46:26,758 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {66204#true} {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~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 05:46:26,759 INFO L272 TraceCheckUtils]: 119: Hoare triple {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~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)); {66204#true} is VALID [2022-04-28 05:46:26,759 INFO L290 TraceCheckUtils]: 120: Hoare triple {66204#true} ~cond := #in~cond; {66325#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:46:26,759 INFO L290 TraceCheckUtils]: 121: Hoare triple {66325#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:46:26,759 INFO L290 TraceCheckUtils]: 122: Hoare triple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:46:26,760 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~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 05:46:26,762 INFO L272 TraceCheckUtils]: 124: Hoare triple {66526#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~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)); {66590#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:46:26,762 INFO L290 TraceCheckUtils]: 125: Hoare triple {66590#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {66594#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:46:26,763 INFO L290 TraceCheckUtils]: 126: Hoare triple {66594#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {66205#false} is VALID [2022-04-28 05:46:26,763 INFO L290 TraceCheckUtils]: 127: Hoare triple {66205#false} assume !false; {66205#false} is VALID [2022-04-28 05:46:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 69 proven. 118 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2022-04-28 05:46:26,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:47:25,834 INFO L290 TraceCheckUtils]: 127: Hoare triple {66205#false} assume !false; {66205#false} is VALID [2022-04-28 05:47:25,835 INFO L290 TraceCheckUtils]: 126: Hoare triple {66594#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {66205#false} is VALID [2022-04-28 05:47:25,835 INFO L290 TraceCheckUtils]: 125: Hoare triple {66590#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {66594#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:47:25,836 INFO L272 TraceCheckUtils]: 124: Hoare triple {66610#(= (+ (* 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)); {66590#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:47:25,836 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} {66614#(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)))))} #90#return; {66610#(= (+ (* 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 05:47:25,837 INFO L290 TraceCheckUtils]: 122: Hoare triple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:25,837 INFO L290 TraceCheckUtils]: 121: Hoare triple {66624#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:25,837 INFO L290 TraceCheckUtils]: 120: Hoare triple {66204#true} ~cond := #in~cond; {66624#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:47:25,837 INFO L272 TraceCheckUtils]: 119: Hoare triple {66614#(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)); {66204#true} is VALID [2022-04-28 05:47:25,838 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {66204#true} {66614#(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)))))} #88#return; {66614#(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 05:47:25,838 INFO L290 TraceCheckUtils]: 117: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:25,838 INFO L290 TraceCheckUtils]: 116: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:47:25,838 INFO L290 TraceCheckUtils]: 115: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:47:25,838 INFO L272 TraceCheckUtils]: 114: Hoare triple {66614#(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)); {66204#true} is VALID [2022-04-28 05:47:25,839 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {66204#true} {66614#(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)))))} #86#return; {66614#(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 05:47:25,839 INFO L290 TraceCheckUtils]: 112: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:25,839 INFO L290 TraceCheckUtils]: 111: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:47:25,839 INFO L290 TraceCheckUtils]: 110: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:47:25,839 INFO L272 TraceCheckUtils]: 109: Hoare triple {66614#(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)); {66204#true} is VALID [2022-04-28 05:47:25,839 INFO L290 TraceCheckUtils]: 108: Hoare triple {66614#(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 !!(#t~post7 < 10);havoc #t~post7; {66614#(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 05:47:25,840 INFO L290 TraceCheckUtils]: 107: Hoare triple {66614#(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)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66614#(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 05:47:25,840 INFO L290 TraceCheckUtils]: 106: Hoare triple {66614#(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; {66614#(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 05:47:25,840 INFO L290 TraceCheckUtils]: 105: Hoare triple {66614#(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 !!(#t~post6 < 10);havoc #t~post6; {66614#(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 05:47:25,841 INFO L290 TraceCheckUtils]: 104: Hoare triple {66614#(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)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66614#(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 05:47:27,843 WARN L290 TraceCheckUtils]: 103: Hoare triple {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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; {66614#(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 05:47:27,844 INFO L290 TraceCheckUtils]: 102: Hoare triple {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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)))} assume !(~c~0 >= ~b~0); {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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 05:47:27,845 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {66204#true} {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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)))} #92#return; {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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 05:47:27,845 INFO L290 TraceCheckUtils]: 100: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:27,845 INFO L290 TraceCheckUtils]: 99: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:47:27,845 INFO L290 TraceCheckUtils]: 98: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:47:27,845 INFO L272 TraceCheckUtils]: 97: Hoare triple {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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)))} 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)); {66204#true} is VALID [2022-04-28 05:47:27,846 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {66204#true} {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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)))} #90#return; {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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 05:47:27,846 INFO L290 TraceCheckUtils]: 95: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:27,846 INFO L290 TraceCheckUtils]: 94: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:47:27,846 INFO L290 TraceCheckUtils]: 93: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:47:27,846 INFO L272 TraceCheckUtils]: 92: Hoare triple {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {66204#true} is VALID [2022-04-28 05:47:27,846 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {66204#true} {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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)))} #88#return; {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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 05:47:27,847 INFO L290 TraceCheckUtils]: 90: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:27,847 INFO L290 TraceCheckUtils]: 89: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:47:27,847 INFO L290 TraceCheckUtils]: 88: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:47:27,847 INFO L272 TraceCheckUtils]: 87: Hoare triple {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {66204#true} is VALID [2022-04-28 05:47:27,847 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {66204#true} {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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)))} #86#return; {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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 05:47:27,847 INFO L290 TraceCheckUtils]: 85: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:27,847 INFO L290 TraceCheckUtils]: 84: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:47:27,848 INFO L290 TraceCheckUtils]: 83: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:47:27,848 INFO L272 TraceCheckUtils]: 82: Hoare triple {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {66204#true} is VALID [2022-04-28 05:47:27,848 INFO L290 TraceCheckUtils]: 81: Hoare triple {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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)))} assume !!(#t~post7 < 10);havoc #t~post7; {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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 05:47:27,848 INFO L290 TraceCheckUtils]: 80: Hoare triple {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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 05:47:29,851 WARN L290 TraceCheckUtils]: 79: Hoare triple {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {66676#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~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 UNKNOWN [2022-04-28 05:47:29,852 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {66204#true} {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} #92#return; {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} is VALID [2022-04-28 05:47:29,852 INFO L290 TraceCheckUtils]: 77: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:29,852 INFO L290 TraceCheckUtils]: 76: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:47:29,852 INFO L290 TraceCheckUtils]: 75: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:47:29,852 INFO L272 TraceCheckUtils]: 74: Hoare triple {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~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)); {66204#true} is VALID [2022-04-28 05:47:29,853 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {66204#true} {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} #90#return; {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} is VALID [2022-04-28 05:47:29,853 INFO L290 TraceCheckUtils]: 72: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:29,853 INFO L290 TraceCheckUtils]: 71: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:47:29,853 INFO L290 TraceCheckUtils]: 70: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:47:29,853 INFO L272 TraceCheckUtils]: 69: Hoare triple {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {66204#true} is VALID [2022-04-28 05:47:29,854 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {66204#true} {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} #88#return; {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} is VALID [2022-04-28 05:47:29,854 INFO L290 TraceCheckUtils]: 67: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:29,854 INFO L290 TraceCheckUtils]: 66: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:47:29,854 INFO L290 TraceCheckUtils]: 65: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:47:29,854 INFO L272 TraceCheckUtils]: 64: Hoare triple {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {66204#true} is VALID [2022-04-28 05:47:29,855 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {66204#true} {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} #86#return; {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} is VALID [2022-04-28 05:47:29,855 INFO L290 TraceCheckUtils]: 62: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:29,855 INFO L290 TraceCheckUtils]: 61: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:47:29,855 INFO L290 TraceCheckUtils]: 60: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:47:29,855 INFO L272 TraceCheckUtils]: 59: Hoare triple {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {66204#true} is VALID [2022-04-28 05:47:29,855 INFO L290 TraceCheckUtils]: 58: Hoare triple {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} assume !!(#t~post7 < 10);havoc #t~post7; {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} is VALID [2022-04-28 05:47:29,856 INFO L290 TraceCheckUtils]: 57: Hoare triple {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} is VALID [2022-04-28 05:47:29,901 INFO L290 TraceCheckUtils]: 56: Hoare triple {66819#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {66749#(or (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)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} is VALID [2022-04-28 05:47:29,902 INFO L290 TraceCheckUtils]: 55: Hoare triple {66819#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {66819#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} is VALID [2022-04-28 05:47:29,902 INFO L290 TraceCheckUtils]: 54: Hoare triple {66819#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66819#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} is VALID [2022-04-28 05:47:31,905 WARN L290 TraceCheckUtils]: 53: Hoare triple {66829#(or (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~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; {66819#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} is UNKNOWN [2022-04-28 05:47:31,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {66829#(or (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} assume !(~c~0 >= ~b~0); {66829#(or (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} is VALID [2022-04-28 05:47:31,907 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {66204#true} {66829#(or (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} #92#return; {66829#(or (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} is VALID [2022-04-28 05:47:31,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:31,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:47:31,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:47:31,907 INFO L272 TraceCheckUtils]: 47: Hoare triple {66829#(or (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~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)); {66204#true} is VALID [2022-04-28 05:47:31,908 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} {66851#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} #90#return; {66829#(or (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} is VALID [2022-04-28 05:47:31,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:31,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {66624#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:31,909 INFO L290 TraceCheckUtils]: 43: Hoare triple {66204#true} ~cond := #in~cond; {66624#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:47:31,909 INFO L272 TraceCheckUtils]: 42: Hoare triple {66851#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {66204#true} is VALID [2022-04-28 05:47:31,911 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} {66867#(or (not (= 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)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} #88#return; {66851#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} is VALID [2022-04-28 05:47:31,911 INFO L290 TraceCheckUtils]: 40: Hoare triple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:31,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {66624#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:31,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {66204#true} ~cond := #in~cond; {66624#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:47:31,911 INFO L272 TraceCheckUtils]: 37: Hoare triple {66867#(or (not (= 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)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {66204#true} is VALID [2022-04-28 05:47:31,912 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {66204#true} {66867#(or (not (= 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)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} #86#return; {66867#(or (not (= 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)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} is VALID [2022-04-28 05:47:31,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:31,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:47:31,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:47:31,912 INFO L272 TraceCheckUtils]: 32: Hoare triple {66867#(or (not (= 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)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {66204#true} is VALID [2022-04-28 05:47:31,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {66867#(or (not (= 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)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} assume !!(#t~post7 < 10);havoc #t~post7; {66867#(or (not (= 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)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} is VALID [2022-04-28 05:47:31,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {66867#(or (not (= 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)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66867#(or (not (= 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)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} is VALID [2022-04-28 05:47:31,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {66904#(or (not (= 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_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {66867#(or (not (= 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)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} is VALID [2022-04-28 05:47:31,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {66904#(or (not (= 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_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))))} assume !!(#t~post6 < 10);havoc #t~post6; {66904#(or (not (= 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_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))))} is VALID [2022-04-28 05:47:31,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {66904#(or (not (= 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_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66904#(or (not (= 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_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))))} is VALID [2022-04-28 05:47:31,916 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {66204#true} {66904#(or (not (= 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_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))))} #84#return; {66904#(or (not (= 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_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))))} is VALID [2022-04-28 05:47:31,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:31,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:47:31,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:47:31,916 INFO L272 TraceCheckUtils]: 22: Hoare triple {66904#(or (not (= 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_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {66204#true} is VALID [2022-04-28 05:47:31,917 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {66204#true} {66904#(or (not (= 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_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))))} #82#return; {66904#(or (not (= 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_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))))} is VALID [2022-04-28 05:47:31,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:31,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:47:31,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:47:31,917 INFO L272 TraceCheckUtils]: 17: Hoare triple {66904#(or (not (= 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_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {66204#true} is VALID [2022-04-28 05:47:31,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {66204#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; {66904#(or (not (= 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_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))))} is VALID [2022-04-28 05:47:31,919 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {66204#true} {66204#true} #80#return; {66204#true} is VALID [2022-04-28 05:47:31,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:31,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:47:31,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:47:31,919 INFO L272 TraceCheckUtils]: 11: Hoare triple {66204#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {66204#true} is VALID [2022-04-28 05:47:31,919 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {66204#true} {66204#true} #78#return; {66204#true} is VALID [2022-04-28 05:47:31,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:31,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 05:47:31,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 05:47:31,919 INFO L272 TraceCheckUtils]: 6: Hoare triple {66204#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {66204#true} is VALID [2022-04-28 05:47:31,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {66204#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {66204#true} is VALID [2022-04-28 05:47:31,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {66204#true} call #t~ret8 := main(); {66204#true} is VALID [2022-04-28 05:47:31,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66204#true} {66204#true} #98#return; {66204#true} is VALID [2022-04-28 05:47:31,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 05:47:31,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {66204#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);~counter~0 := 0; {66204#true} is VALID [2022-04-28 05:47:31,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {66204#true} call ULTIMATE.init(); {66204#true} is VALID [2022-04-28 05:47:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 79 proven. 108 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2022-04-28 05:47:31,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:47:31,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609093699] [2022-04-28 05:47:31,921 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:47:31,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980890875] [2022-04-28 05:47:31,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980890875] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:47:31,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:47:31,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 23 [2022-04-28 05:47:31,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:47:31,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [367708463] [2022-04-28 05:47:31,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [367708463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:47:31,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:47:31,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:47:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259253031] [2022-04-28 05:47:31,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:47:31,922 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) Word has length 128 [2022-04-28 05:47:31,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:47:31,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-28 05:47:32,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:47:32,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:47:32,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:47:32,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:47:32,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=386, Unknown=1, NotChecked=0, Total=506 [2022-04-28 05:47:32,037 INFO L87 Difference]: Start difference. First operand 605 states and 761 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-28 05:47:46,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:47:46,029 INFO L93 Difference]: Finished difference Result 617 states and 772 transitions. [2022-04-28 05:47:46,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 05:47:46,029 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) Word has length 128 [2022-04-28 05:47:46,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:47:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-28 05:47:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-28 05:47:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-28 05:47:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-28 05:47:46,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 138 transitions. [2022-04-28 05:47:46,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:47:46,265 INFO L225 Difference]: With dead ends: 617 [2022-04-28 05:47:46,265 INFO L226 Difference]: Without dead ends: 615 [2022-04-28 05:47:46,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=158, Invalid=543, Unknown=1, NotChecked=0, Total=702 [2022-04-28 05:47:46,266 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 37 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:47:46,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 369 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 05:47:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-04-28 05:47:47,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 609. [2022-04-28 05:47:47,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:47:47,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 615 states. Second operand has 609 states, 400 states have (on average 1.195) internal successors, (478), 407 states have internal predecessors, (478), 145 states have call successors, (145), 65 states have call predecessors, (145), 63 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 05:47:47,423 INFO L74 IsIncluded]: Start isIncluded. First operand 615 states. Second operand has 609 states, 400 states have (on average 1.195) internal successors, (478), 407 states have internal predecessors, (478), 145 states have call successors, (145), 65 states have call predecessors, (145), 63 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 05:47:47,423 INFO L87 Difference]: Start difference. First operand 615 states. Second operand has 609 states, 400 states have (on average 1.195) internal successors, (478), 407 states have internal predecessors, (478), 145 states have call successors, (145), 65 states have call predecessors, (145), 63 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 05:47:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:47:47,435 INFO L93 Difference]: Finished difference Result 615 states and 770 transitions. [2022-04-28 05:47:47,435 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 770 transitions. [2022-04-28 05:47:47,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:47:47,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:47:47,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 609 states, 400 states have (on average 1.195) internal successors, (478), 407 states have internal predecessors, (478), 145 states have call successors, (145), 65 states have call predecessors, (145), 63 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) Second operand 615 states. [2022-04-28 05:47:47,437 INFO L87 Difference]: Start difference. First operand has 609 states, 400 states have (on average 1.195) internal successors, (478), 407 states have internal predecessors, (478), 145 states have call successors, (145), 65 states have call predecessors, (145), 63 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) Second operand 615 states. [2022-04-28 05:47:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:47:47,448 INFO L93 Difference]: Finished difference Result 615 states and 770 transitions. [2022-04-28 05:47:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 770 transitions. [2022-04-28 05:47:47,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:47:47,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:47:47,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:47:47,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:47:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 400 states have (on average 1.195) internal successors, (478), 407 states have internal predecessors, (478), 145 states have call successors, (145), 65 states have call predecessors, (145), 63 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 05:47:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 764 transitions. [2022-04-28 05:47:47,467 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 764 transitions. Word has length 128 [2022-04-28 05:47:47,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:47:47,467 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 764 transitions. [2022-04-28 05:47:47,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-28 05:47:47,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 609 states and 764 transitions. [2022-04-28 05:47:48,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 764 edges. 764 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:47:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 764 transitions. [2022-04-28 05:47:48,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-28 05:47:48,927 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:47:48,927 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:47:48,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-28 05:47:49,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-28 05:47:49,127 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:47:49,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:47:49,128 INFO L85 PathProgramCache]: Analyzing trace with hash -677811269, now seen corresponding path program 7 times [2022-04-28 05:47:49,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:47:49,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1272115541] [2022-04-28 05:47:49,128 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:47:49,128 INFO L85 PathProgramCache]: Analyzing trace with hash -677811269, now seen corresponding path program 8 times [2022-04-28 05:47:49,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:47:49,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842511401] [2022-04-28 05:47:49,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:47:49,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:47:49,145 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:47:49,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366713917] [2022-04-28 05:47:49,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:47:49,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:47:49,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:47:49,146 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:47:49,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 05:47:49,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:47:49,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:47:49,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 05:47:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:47:49,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:47:50,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {70684#true} call ULTIMATE.init(); {70684#true} is VALID [2022-04-28 05:47:50,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {70684#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);~counter~0 := 0; {70684#true} is VALID [2022-04-28 05:47:50,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70684#true} {70684#true} #98#return; {70684#true} is VALID [2022-04-28 05:47:50,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {70684#true} call #t~ret8 := main(); {70684#true} is VALID [2022-04-28 05:47:50,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {70684#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {70684#true} is VALID [2022-04-28 05:47:50,465 INFO L272 TraceCheckUtils]: 6: Hoare triple {70684#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:47:50,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,465 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {70684#true} {70684#true} #78#return; {70684#true} is VALID [2022-04-28 05:47:50,465 INFO L272 TraceCheckUtils]: 11: Hoare triple {70684#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:47:50,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,465 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {70684#true} {70684#true} #80#return; {70684#true} is VALID [2022-04-28 05:47:50,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {70684#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; {70737#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,466 INFO L272 TraceCheckUtils]: 17: Hoare triple {70737#(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)); {70684#true} is VALID [2022-04-28 05:47:50,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,466 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {70684#true} {70737#(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))} #82#return; {70737#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,466 INFO L272 TraceCheckUtils]: 22: Hoare triple {70737#(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)); {70684#true} is VALID [2022-04-28 05:47:50,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,467 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {70684#true} {70737#(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))} #84#return; {70737#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {70737#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70737#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {70737#(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 !!(#t~post6 < 10);havoc #t~post6; {70737#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {70737#(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; {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~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 !!(#t~post7 < 10);havoc #t~post7; {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,469 INFO L272 TraceCheckUtils]: 32: Hoare triple {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~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)); {70684#true} is VALID [2022-04-28 05:47:50,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,470 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {70684#true} {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~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))} #86#return; {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,470 INFO L272 TraceCheckUtils]: 37: Hoare triple {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~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)); {70684#true} is VALID [2022-04-28 05:47:50,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,470 INFO L290 TraceCheckUtils]: 40: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,471 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {70684#true} {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~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))} #88#return; {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,471 INFO L272 TraceCheckUtils]: 42: Hoare triple {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~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)); {70684#true} is VALID [2022-04-28 05:47:50,471 INFO L290 TraceCheckUtils]: 43: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,471 INFO L290 TraceCheckUtils]: 44: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,472 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {70684#true} {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~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))} #90#return; {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,472 INFO L272 TraceCheckUtils]: 47: Hoare triple {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~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)); {70684#true} is VALID [2022-04-28 05:47:50,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,472 INFO L290 TraceCheckUtils]: 50: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,472 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {70684#true} {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~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))} #92#return; {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,475 INFO L290 TraceCheckUtils]: 52: Hoare triple {70777#(and (= main_~r~0 0) (= main_~c~0 main_~a~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; {70847#(and (= main_~r~0 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 05:47:50,475 INFO L290 TraceCheckUtils]: 53: Hoare triple {70847#(and (= main_~r~0 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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70847#(and (= main_~r~0 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 05:47:50,476 INFO L290 TraceCheckUtils]: 54: Hoare triple {70847#(and (= main_~r~0 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 !!(#t~post7 < 10);havoc #t~post7; {70847#(and (= main_~r~0 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 05:47:50,476 INFO L272 TraceCheckUtils]: 55: Hoare triple {70847#(and (= main_~r~0 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)); {70684#true} is VALID [2022-04-28 05:47:50,476 INFO L290 TraceCheckUtils]: 56: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,476 INFO L290 TraceCheckUtils]: 57: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,476 INFO L290 TraceCheckUtils]: 58: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,477 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {70684#true} {70847#(and (= main_~r~0 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))} #86#return; {70847#(and (= main_~r~0 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 05:47:50,477 INFO L272 TraceCheckUtils]: 60: Hoare triple {70847#(and (= main_~r~0 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)); {70684#true} is VALID [2022-04-28 05:47:50,477 INFO L290 TraceCheckUtils]: 61: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,477 INFO L290 TraceCheckUtils]: 62: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,477 INFO L290 TraceCheckUtils]: 63: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,477 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {70684#true} {70847#(and (= main_~r~0 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))} #88#return; {70847#(and (= main_~r~0 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 05:47:50,477 INFO L272 TraceCheckUtils]: 65: Hoare triple {70847#(and (= main_~r~0 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)); {70684#true} is VALID [2022-04-28 05:47:50,477 INFO L290 TraceCheckUtils]: 66: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,478 INFO L290 TraceCheckUtils]: 67: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,478 INFO L290 TraceCheckUtils]: 68: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,478 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {70684#true} {70847#(and (= main_~r~0 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))} #90#return; {70847#(and (= main_~r~0 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 05:47:50,478 INFO L272 TraceCheckUtils]: 70: Hoare triple {70847#(and (= main_~r~0 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)); {70684#true} is VALID [2022-04-28 05:47:50,478 INFO L290 TraceCheckUtils]: 71: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,478 INFO L290 TraceCheckUtils]: 72: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,478 INFO L290 TraceCheckUtils]: 73: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,479 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {70684#true} {70847#(and (= main_~r~0 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))} #92#return; {70847#(and (= main_~r~0 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 05:47:50,480 INFO L290 TraceCheckUtils]: 75: Hoare triple {70847#(and (= main_~r~0 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; {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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 05:47:50,481 INFO L290 TraceCheckUtils]: 76: Hoare triple {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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 05:47:50,481 INFO L290 TraceCheckUtils]: 77: Hoare triple {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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 !!(#t~post7 < 10);havoc #t~post7; {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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 05:47:50,481 INFO L272 TraceCheckUtils]: 78: Hoare triple {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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)); {70684#true} is VALID [2022-04-28 05:47:50,481 INFO L290 TraceCheckUtils]: 79: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,481 INFO L290 TraceCheckUtils]: 80: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,481 INFO L290 TraceCheckUtils]: 81: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,482 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {70684#true} {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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))} #86#return; {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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 05:47:50,482 INFO L272 TraceCheckUtils]: 83: Hoare triple {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:47:50,482 INFO L290 TraceCheckUtils]: 84: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,482 INFO L290 TraceCheckUtils]: 85: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,482 INFO L290 TraceCheckUtils]: 86: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,483 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {70684#true} {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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))} #88#return; {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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 05:47:50,483 INFO L272 TraceCheckUtils]: 88: Hoare triple {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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 ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:47:50,483 INFO L290 TraceCheckUtils]: 89: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,483 INFO L290 TraceCheckUtils]: 90: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,483 INFO L290 TraceCheckUtils]: 91: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,484 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {70684#true} {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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))} #90#return; {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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 05:47:50,484 INFO L272 TraceCheckUtils]: 93: Hoare triple {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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 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)); {70684#true} is VALID [2022-04-28 05:47:50,484 INFO L290 TraceCheckUtils]: 94: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,484 INFO L290 TraceCheckUtils]: 95: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,484 INFO L290 TraceCheckUtils]: 96: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,485 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {70684#true} {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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))} #92#return; {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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 05:47:50,486 INFO L290 TraceCheckUtils]: 98: Hoare triple {70917#(and (= main_~r~0 0) (= main_~s~0 1) (= 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 !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {70987#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,486 INFO L290 TraceCheckUtils]: 99: Hoare triple {70987#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) main_~a~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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70987#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,487 INFO L290 TraceCheckUtils]: 100: Hoare triple {70987#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) main_~a~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 !!(#t~post7 < 10);havoc #t~post7; {70987#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,487 INFO L272 TraceCheckUtils]: 101: Hoare triple {70987#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) main_~a~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)); {70684#true} is VALID [2022-04-28 05:47:50,487 INFO L290 TraceCheckUtils]: 102: Hoare triple {70684#true} ~cond := #in~cond; {71000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:47:50,487 INFO L290 TraceCheckUtils]: 103: Hoare triple {71000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:50,488 INFO L290 TraceCheckUtils]: 104: Hoare triple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:50,489 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} {70987#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) main_~a~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))} #86#return; {71011#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= (+ main_~c~0 (* main_~b~0 3)) main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,489 INFO L272 TraceCheckUtils]: 106: Hoare triple {71011#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= (+ main_~c~0 (* main_~b~0 3)) main_~a~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)); {70684#true} is VALID [2022-04-28 05:47:50,489 INFO L290 TraceCheckUtils]: 107: Hoare triple {70684#true} ~cond := #in~cond; {71000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:47:50,489 INFO L290 TraceCheckUtils]: 108: Hoare triple {71000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:50,489 INFO L290 TraceCheckUtils]: 109: Hoare triple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:50,491 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} {71011#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= (+ main_~c~0 (* main_~b~0 3)) main_~a~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))} #88#return; {71027#(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_~q~0 0) (= (* main_~b~0 main_~k~0) (* main_~b~0 3)) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,491 INFO L272 TraceCheckUtils]: 111: Hoare triple {71027#(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_~q~0 0) (= (* main_~b~0 main_~k~0) (* main_~b~0 3)) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:47:50,492 INFO L290 TraceCheckUtils]: 112: Hoare triple {70684#true} ~cond := #in~cond; {71000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:47:50,492 INFO L290 TraceCheckUtils]: 113: Hoare triple {71000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:50,492 INFO L290 TraceCheckUtils]: 114: Hoare triple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:50,493 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} {71027#(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_~q~0 0) (= (* main_~b~0 main_~k~0) (* main_~b~0 3)) (= main_~p~0 1))} #90#return; {71043#(and (= main_~r~0 0) (= main_~x~0 (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,493 INFO L272 TraceCheckUtils]: 116: Hoare triple {71043#(and (= main_~r~0 0) (= main_~x~0 (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 1) (= 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)); {70684#true} is VALID [2022-04-28 05:47:50,493 INFO L290 TraceCheckUtils]: 117: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:47:50,493 INFO L290 TraceCheckUtils]: 118: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:47:50,493 INFO L290 TraceCheckUtils]: 119: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:47:50,494 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {70684#true} {71043#(and (= main_~r~0 0) (= main_~x~0 (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #92#return; {71043#(and (= main_~r~0 0) (= main_~x~0 (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,495 INFO L290 TraceCheckUtils]: 121: Hoare triple {71043#(and (= main_~r~0 0) (= main_~x~0 (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {71043#(and (= main_~r~0 0) (= main_~x~0 (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:47:50,497 INFO L290 TraceCheckUtils]: 122: Hoare triple {71043#(and (= main_~r~0 0) (= main_~x~0 (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= (+ (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 1) (= 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; {71065#(and (= (+ (* main_~y~0 (* (- 1) main_~s~0) 1) (* main_~x~0 (* (- 1) main_~s~0) 0)) (* main_~y~0 3)) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-28 05:47:50,498 INFO L290 TraceCheckUtils]: 123: Hoare triple {71065#(and (= (+ (* main_~y~0 (* (- 1) main_~s~0) 1) (* main_~x~0 (* (- 1) main_~s~0) 0)) (* main_~y~0 3)) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {71065#(and (= (+ (* main_~y~0 (* (- 1) main_~s~0) 1) (* main_~x~0 (* (- 1) main_~s~0) 0)) (* main_~y~0 3)) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-28 05:47:50,498 INFO L290 TraceCheckUtils]: 124: Hoare triple {71065#(and (= (+ (* main_~y~0 (* (- 1) main_~s~0) 1) (* main_~x~0 (* (- 1) main_~s~0) 0)) (* main_~y~0 3)) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {71065#(and (= (+ (* main_~y~0 (* (- 1) main_~s~0) 1) (* main_~x~0 (* (- 1) main_~s~0) 0)) (* main_~y~0 3)) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-28 05:47:50,499 INFO L290 TraceCheckUtils]: 125: Hoare triple {71065#(and (= (+ (* main_~y~0 (* (- 1) main_~s~0) 1) (* main_~x~0 (* (- 1) main_~s~0) 0)) (* main_~y~0 3)) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} assume !(0 != ~b~0); {71075#(and (= (+ (* main_~y~0 (* (- 1) main_~s~0) 1) (* main_~x~0 (* (- 1) main_~s~0) 0)) (* main_~y~0 3)) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= main_~q~0 1))} is VALID [2022-04-28 05:47:50,499 INFO L272 TraceCheckUtils]: 126: Hoare triple {71075#(and (= (+ (* main_~y~0 (* (- 1) main_~s~0) 1) (* main_~x~0 (* (- 1) main_~s~0) 0)) (* main_~y~0 3)) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {71079#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:47:50,500 INFO L290 TraceCheckUtils]: 127: Hoare triple {71079#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {71083#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:47:50,500 INFO L290 TraceCheckUtils]: 128: Hoare triple {71083#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {70685#false} is VALID [2022-04-28 05:47:50,500 INFO L290 TraceCheckUtils]: 129: Hoare triple {70685#false} assume !false; {70685#false} is VALID [2022-04-28 05:47:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 137 proven. 57 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2022-04-28 05:47:50,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:49:54,429 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:50:27,924 INFO L290 TraceCheckUtils]: 129: Hoare triple {70685#false} assume !false; {70685#false} is VALID [2022-04-28 05:50:27,924 INFO L290 TraceCheckUtils]: 128: Hoare triple {71083#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {70685#false} is VALID [2022-04-28 05:50:27,925 INFO L290 TraceCheckUtils]: 127: Hoare triple {71079#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {71083#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:50:27,925 INFO L272 TraceCheckUtils]: 126: Hoare triple {71099#(= (+ (* 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)); {71079#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:50:27,926 INFO L290 TraceCheckUtils]: 125: Hoare triple {71103#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {71099#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-28 05:50:27,926 INFO L290 TraceCheckUtils]: 124: Hoare triple {71103#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !!(#t~post6 < 10);havoc #t~post6; {71103#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-28 05:50:27,926 INFO L290 TraceCheckUtils]: 123: Hoare triple {71103#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {71103#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-28 05:50:29,026 INFO L290 TraceCheckUtils]: 122: Hoare triple {71113#(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; {71103#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-28 05:50:29,027 INFO L290 TraceCheckUtils]: 121: Hoare triple {71113#(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))} assume !(~c~0 >= ~b~0); {71113#(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 05:50:29,027 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {70684#true} {71113#(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))} #92#return; {71113#(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 05:50:29,027 INFO L290 TraceCheckUtils]: 119: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,027 INFO L290 TraceCheckUtils]: 118: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,027 INFO L290 TraceCheckUtils]: 117: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,027 INFO L272 TraceCheckUtils]: 116: Hoare triple {71113#(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))} 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)); {70684#true} is VALID [2022-04-28 05:50:29,028 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} {71135#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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))} #90#return; {71113#(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 05:50:29,028 INFO L290 TraceCheckUtils]: 114: Hoare triple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:29,029 INFO L290 TraceCheckUtils]: 113: Hoare triple {71145#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:29,029 INFO L290 TraceCheckUtils]: 112: Hoare triple {70684#true} ~cond := #in~cond; {71145#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:50:29,029 INFO L272 TraceCheckUtils]: 111: Hoare triple {71135#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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)); {70684#true} is VALID [2022-04-28 05:50:29,030 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} {71152#(or (not (= main_~c~0 0)) (not (= 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_~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))} #88#return; {71135#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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 05:50:29,030 INFO L290 TraceCheckUtils]: 109: Hoare triple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:29,030 INFO L290 TraceCheckUtils]: 108: Hoare triple {71145#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:29,031 INFO L290 TraceCheckUtils]: 107: Hoare triple {70684#true} ~cond := #in~cond; {71145#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:50:29,031 INFO L272 TraceCheckUtils]: 106: Hoare triple {71152#(or (not (= main_~c~0 0)) (not (= 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_~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)); {70684#true} is VALID [2022-04-28 05:50:29,050 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} {70684#true} #86#return; {71152#(or (not (= main_~c~0 0)) (not (= 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_~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 05:50:29,050 INFO L290 TraceCheckUtils]: 104: Hoare triple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:29,050 INFO L290 TraceCheckUtils]: 103: Hoare triple {71145#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:29,050 INFO L290 TraceCheckUtils]: 102: Hoare triple {70684#true} ~cond := #in~cond; {71145#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:50:29,051 INFO L272 TraceCheckUtils]: 101: Hoare triple {70684#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L290 TraceCheckUtils]: 100: Hoare triple {70684#true} assume !!(#t~post7 < 10);havoc #t~post7; {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L290 TraceCheckUtils]: 99: Hoare triple {70684#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L290 TraceCheckUtils]: 98: Hoare triple {70684#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {70684#true} {70684#true} #92#return; {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L290 TraceCheckUtils]: 96: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L290 TraceCheckUtils]: 95: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L290 TraceCheckUtils]: 94: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L272 TraceCheckUtils]: 93: Hoare triple {70684#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)); {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {70684#true} {70684#true} #90#return; {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L290 TraceCheckUtils]: 91: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L290 TraceCheckUtils]: 90: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L290 TraceCheckUtils]: 89: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L272 TraceCheckUtils]: 88: Hoare triple {70684#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {70684#true} {70684#true} #88#return; {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L290 TraceCheckUtils]: 86: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L290 TraceCheckUtils]: 85: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L290 TraceCheckUtils]: 84: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,051 INFO L272 TraceCheckUtils]: 83: Hoare triple {70684#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {70684#true} {70684#true} #86#return; {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L290 TraceCheckUtils]: 81: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L290 TraceCheckUtils]: 80: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L290 TraceCheckUtils]: 79: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L272 TraceCheckUtils]: 78: Hoare triple {70684#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L290 TraceCheckUtils]: 77: Hoare triple {70684#true} assume !!(#t~post7 < 10);havoc #t~post7; {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L290 TraceCheckUtils]: 76: Hoare triple {70684#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L290 TraceCheckUtils]: 75: Hoare triple {70684#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {70684#true} {70684#true} #92#return; {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L290 TraceCheckUtils]: 73: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L290 TraceCheckUtils]: 72: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L290 TraceCheckUtils]: 71: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L272 TraceCheckUtils]: 70: Hoare triple {70684#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)); {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {70684#true} {70684#true} #90#return; {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L290 TraceCheckUtils]: 68: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L290 TraceCheckUtils]: 67: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L290 TraceCheckUtils]: 66: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L272 TraceCheckUtils]: 65: Hoare triple {70684#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {70684#true} {70684#true} #88#return; {70684#true} is VALID [2022-04-28 05:50:29,052 INFO L290 TraceCheckUtils]: 63: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L290 TraceCheckUtils]: 62: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L290 TraceCheckUtils]: 61: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L272 TraceCheckUtils]: 60: Hoare triple {70684#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {70684#true} {70684#true} #86#return; {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L290 TraceCheckUtils]: 58: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L290 TraceCheckUtils]: 57: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L290 TraceCheckUtils]: 56: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L272 TraceCheckUtils]: 55: Hoare triple {70684#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L290 TraceCheckUtils]: 54: Hoare triple {70684#true} assume !!(#t~post7 < 10);havoc #t~post7; {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L290 TraceCheckUtils]: 53: Hoare triple {70684#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L290 TraceCheckUtils]: 52: Hoare triple {70684#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {70684#true} {70684#true} #92#return; {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L272 TraceCheckUtils]: 47: Hoare triple {70684#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)); {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {70684#true} {70684#true} #90#return; {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,053 INFO L272 TraceCheckUtils]: 42: Hoare triple {70684#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {70684#true} {70684#true} #88#return; {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L272 TraceCheckUtils]: 37: Hoare triple {70684#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {70684#true} {70684#true} #86#return; {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L272 TraceCheckUtils]: 32: Hoare triple {70684#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {70684#true} assume !!(#t~post7 < 10);havoc #t~post7; {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {70684#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {70684#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {70684#true} assume !!(#t~post6 < 10);havoc #t~post6; {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {70684#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {70684#true} {70684#true} #84#return; {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L272 TraceCheckUtils]: 22: Hoare triple {70684#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:50:29,054 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {70684#true} {70684#true} #82#return; {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L272 TraceCheckUtils]: 17: Hoare triple {70684#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {70684#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; {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {70684#true} {70684#true} #80#return; {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L272 TraceCheckUtils]: 11: Hoare triple {70684#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {70684#true} {70684#true} #78#return; {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L272 TraceCheckUtils]: 6: Hoare triple {70684#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {70684#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {70684#true} call #t~ret8 := main(); {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70684#true} {70684#true} #98#return; {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 05:50:29,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {70684#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);~counter~0 := 0; {70684#true} is VALID [2022-04-28 05:50:29,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {70684#true} call ULTIMATE.init(); {70684#true} is VALID [2022-04-28 05:50:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 152 proven. 12 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2022-04-28 05:50:29,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:29,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842511401] [2022-04-28 05:50:29,056 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:29,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366713917] [2022-04-28 05:50:29,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366713917] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:50:29,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:50:29,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2022-04-28 05:50:29,056 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:29,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1272115541] [2022-04-28 05:50:29,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1272115541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:29,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:29,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 05:50:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754011158] [2022-04-28 05:50:29,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:29,057 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) Word has length 130 [2022-04-28 05:50:29,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:29,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-28 05:50:29,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:29,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 05:50:29,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:29,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 05:50:29,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2022-04-28 05:50:29,156 INFO L87 Difference]: Start difference. First operand 609 states and 764 transitions. Second operand has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-28 05:50:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:33,537 INFO L93 Difference]: Finished difference Result 642 states and 811 transitions. [2022-04-28 05:50:33,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 05:50:33,537 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) Word has length 130 [2022-04-28 05:50:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-28 05:50:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2022-04-28 05:50:33,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-28 05:50:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2022-04-28 05:50:33,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 138 transitions. [2022-04-28 05:50:33,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:33,721 INFO L225 Difference]: With dead ends: 642 [2022-04-28 05:50:33,721 INFO L226 Difference]: Without dead ends: 637 [2022-04-28 05:50:33,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-04-28 05:50:33,722 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 40 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:50:33,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 370 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 05:50:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-04-28 05:50:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 613. [2022-04-28 05:50:34,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:34,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 637 states. Second operand has 613 states, 401 states have (on average 1.1920199501246882) internal successors, (478), 409 states have internal predecessors, (478), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-28 05:50:34,917 INFO L74 IsIncluded]: Start isIncluded. First operand 637 states. Second operand has 613 states, 401 states have (on average 1.1920199501246882) internal successors, (478), 409 states have internal predecessors, (478), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-28 05:50:34,917 INFO L87 Difference]: Start difference. First operand 637 states. Second operand has 613 states, 401 states have (on average 1.1920199501246882) internal successors, (478), 409 states have internal predecessors, (478), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-28 05:50:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:34,941 INFO L93 Difference]: Finished difference Result 637 states and 805 transitions. [2022-04-28 05:50:34,941 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 805 transitions. [2022-04-28 05:50:34,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:34,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:34,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 613 states, 401 states have (on average 1.1920199501246882) internal successors, (478), 409 states have internal predecessors, (478), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) Second operand 637 states. [2022-04-28 05:50:34,942 INFO L87 Difference]: Start difference. First operand has 613 states, 401 states have (on average 1.1920199501246882) internal successors, (478), 409 states have internal predecessors, (478), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) Second operand 637 states. [2022-04-28 05:50:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:34,956 INFO L93 Difference]: Finished difference Result 637 states and 805 transitions. [2022-04-28 05:50:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 805 transitions. [2022-04-28 05:50:34,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:34,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:34,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:34,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 401 states have (on average 1.1920199501246882) internal successors, (478), 409 states have internal predecessors, (478), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-28 05:50:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 769 transitions. [2022-04-28 05:50:34,975 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 769 transitions. Word has length 130 [2022-04-28 05:50:34,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:34,975 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 769 transitions. [2022-04-28 05:50:34,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-28 05:50:34,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 613 states and 769 transitions. [2022-04-28 05:50:36,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 769 edges. 769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 769 transitions. [2022-04-28 05:50:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 05:50:36,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:36,538 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:50:36,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 05:50:36,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-28 05:50:36,738 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:36,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:36,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2098906485, now seen corresponding path program 7 times [2022-04-28 05:50:36,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:36,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1371162966] [2022-04-28 05:50:36,739 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:36,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2098906485, now seen corresponding path program 8 times [2022-04-28 05:50:36,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:36,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393289988] [2022-04-28 05:50:36,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:36,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:36,749 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:36,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291143358] [2022-04-28 05:50:36,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:50:36,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:36,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:36,750 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:50:36,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 05:50:36,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:50:36,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:36,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 05:50:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:36,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:37,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {75275#true} call ULTIMATE.init(); {75275#true} is VALID [2022-04-28 05:50:37,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {75275#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);~counter~0 := 0; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {75283#(<= ~counter~0 0)} assume true; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75283#(<= ~counter~0 0)} {75275#true} #98#return; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {75283#(<= ~counter~0 0)} call #t~ret8 := main(); {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {75283#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,276 INFO L272 TraceCheckUtils]: 6: Hoare triple {75283#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {75283#(<= ~counter~0 0)} ~cond := #in~cond; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {75283#(<= ~counter~0 0)} assume !(0 == ~cond); {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {75283#(<= ~counter~0 0)} assume true; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,277 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {75283#(<= ~counter~0 0)} {75283#(<= ~counter~0 0)} #78#return; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,277 INFO L272 TraceCheckUtils]: 11: Hoare triple {75283#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {75283#(<= ~counter~0 0)} ~cond := #in~cond; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {75283#(<= ~counter~0 0)} assume !(0 == ~cond); {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {75283#(<= ~counter~0 0)} assume true; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,278 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {75283#(<= ~counter~0 0)} {75283#(<= ~counter~0 0)} #80#return; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {75283#(<= ~counter~0 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; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,279 INFO L272 TraceCheckUtils]: 17: Hoare triple {75283#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {75283#(<= ~counter~0 0)} ~cond := #in~cond; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {75283#(<= ~counter~0 0)} assume !(0 == ~cond); {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {75283#(<= ~counter~0 0)} assume true; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,280 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {75283#(<= ~counter~0 0)} {75283#(<= ~counter~0 0)} #82#return; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,280 INFO L272 TraceCheckUtils]: 22: Hoare triple {75283#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {75283#(<= ~counter~0 0)} ~cond := #in~cond; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {75283#(<= ~counter~0 0)} assume !(0 == ~cond); {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {75283#(<= ~counter~0 0)} assume true; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,281 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {75283#(<= ~counter~0 0)} {75283#(<= ~counter~0 0)} #84#return; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:37,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {75283#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75362#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:37,283 INFO L290 TraceCheckUtils]: 28: Hoare triple {75362#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {75362#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:37,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {75362#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {75362#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:37,284 INFO L290 TraceCheckUtils]: 30: Hoare triple {75362#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {75372#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,284 INFO L272 TraceCheckUtils]: 32: Hoare triple {75372#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,285 INFO L290 TraceCheckUtils]: 33: Hoare triple {75372#(<= ~counter~0 2)} ~cond := #in~cond; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,285 INFO L290 TraceCheckUtils]: 34: Hoare triple {75372#(<= ~counter~0 2)} assume !(0 == ~cond); {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,285 INFO L290 TraceCheckUtils]: 35: Hoare triple {75372#(<= ~counter~0 2)} assume true; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,286 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {75372#(<= ~counter~0 2)} {75372#(<= ~counter~0 2)} #86#return; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,286 INFO L272 TraceCheckUtils]: 37: Hoare triple {75372#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,286 INFO L290 TraceCheckUtils]: 38: Hoare triple {75372#(<= ~counter~0 2)} ~cond := #in~cond; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,286 INFO L290 TraceCheckUtils]: 39: Hoare triple {75372#(<= ~counter~0 2)} assume !(0 == ~cond); {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,287 INFO L290 TraceCheckUtils]: 40: Hoare triple {75372#(<= ~counter~0 2)} assume true; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,287 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {75372#(<= ~counter~0 2)} {75372#(<= ~counter~0 2)} #88#return; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,288 INFO L272 TraceCheckUtils]: 42: Hoare triple {75372#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,288 INFO L290 TraceCheckUtils]: 43: Hoare triple {75372#(<= ~counter~0 2)} ~cond := #in~cond; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,288 INFO L290 TraceCheckUtils]: 44: Hoare triple {75372#(<= ~counter~0 2)} assume !(0 == ~cond); {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,288 INFO L290 TraceCheckUtils]: 45: Hoare triple {75372#(<= ~counter~0 2)} assume true; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,289 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {75372#(<= ~counter~0 2)} {75372#(<= ~counter~0 2)} #90#return; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,289 INFO L272 TraceCheckUtils]: 47: Hoare triple {75372#(<= ~counter~0 2)} 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)); {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,290 INFO L290 TraceCheckUtils]: 48: Hoare triple {75372#(<= ~counter~0 2)} ~cond := #in~cond; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,290 INFO L290 TraceCheckUtils]: 49: Hoare triple {75372#(<= ~counter~0 2)} assume !(0 == ~cond); {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,290 INFO L290 TraceCheckUtils]: 50: Hoare triple {75372#(<= ~counter~0 2)} assume true; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,291 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {75372#(<= ~counter~0 2)} {75372#(<= ~counter~0 2)} #92#return; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,291 INFO L290 TraceCheckUtils]: 52: Hoare triple {75372#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:37,292 INFO L290 TraceCheckUtils]: 53: Hoare triple {75372#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,292 INFO L290 TraceCheckUtils]: 54: Hoare triple {75442#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,292 INFO L272 TraceCheckUtils]: 55: Hoare triple {75442#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,292 INFO L290 TraceCheckUtils]: 56: Hoare triple {75442#(<= ~counter~0 3)} ~cond := #in~cond; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,293 INFO L290 TraceCheckUtils]: 57: Hoare triple {75442#(<= ~counter~0 3)} assume !(0 == ~cond); {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,293 INFO L290 TraceCheckUtils]: 58: Hoare triple {75442#(<= ~counter~0 3)} assume true; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,293 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {75442#(<= ~counter~0 3)} {75442#(<= ~counter~0 3)} #86#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,294 INFO L272 TraceCheckUtils]: 60: Hoare triple {75442#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,294 INFO L290 TraceCheckUtils]: 61: Hoare triple {75442#(<= ~counter~0 3)} ~cond := #in~cond; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,294 INFO L290 TraceCheckUtils]: 62: Hoare triple {75442#(<= ~counter~0 3)} assume !(0 == ~cond); {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,294 INFO L290 TraceCheckUtils]: 63: Hoare triple {75442#(<= ~counter~0 3)} assume true; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,295 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {75442#(<= ~counter~0 3)} {75442#(<= ~counter~0 3)} #88#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,295 INFO L272 TraceCheckUtils]: 65: Hoare triple {75442#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,296 INFO L290 TraceCheckUtils]: 66: Hoare triple {75442#(<= ~counter~0 3)} ~cond := #in~cond; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,296 INFO L290 TraceCheckUtils]: 67: Hoare triple {75442#(<= ~counter~0 3)} assume !(0 == ~cond); {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {75442#(<= ~counter~0 3)} assume true; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,297 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {75442#(<= ~counter~0 3)} {75442#(<= ~counter~0 3)} #90#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,297 INFO L272 TraceCheckUtils]: 70: Hoare triple {75442#(<= ~counter~0 3)} 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)); {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,297 INFO L290 TraceCheckUtils]: 71: Hoare triple {75442#(<= ~counter~0 3)} ~cond := #in~cond; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,298 INFO L290 TraceCheckUtils]: 72: Hoare triple {75442#(<= ~counter~0 3)} assume !(0 == ~cond); {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,298 INFO L290 TraceCheckUtils]: 73: Hoare triple {75442#(<= ~counter~0 3)} assume true; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,298 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {75442#(<= ~counter~0 3)} {75442#(<= ~counter~0 3)} #92#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,298 INFO L290 TraceCheckUtils]: 75: Hoare triple {75442#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,299 INFO L290 TraceCheckUtils]: 76: Hoare triple {75442#(<= ~counter~0 3)} ~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; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,300 INFO L290 TraceCheckUtils]: 77: Hoare triple {75442#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75515#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:37,300 INFO L290 TraceCheckUtils]: 78: Hoare triple {75515#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {75515#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:37,300 INFO L290 TraceCheckUtils]: 79: Hoare triple {75515#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {75515#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:37,301 INFO L290 TraceCheckUtils]: 80: Hoare triple {75515#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,301 INFO L290 TraceCheckUtils]: 81: Hoare triple {75525#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,301 INFO L272 TraceCheckUtils]: 82: Hoare triple {75525#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,302 INFO L290 TraceCheckUtils]: 83: Hoare triple {75525#(<= ~counter~0 5)} ~cond := #in~cond; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,302 INFO L290 TraceCheckUtils]: 84: Hoare triple {75525#(<= ~counter~0 5)} assume !(0 == ~cond); {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,302 INFO L290 TraceCheckUtils]: 85: Hoare triple {75525#(<= ~counter~0 5)} assume true; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,303 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {75525#(<= ~counter~0 5)} {75525#(<= ~counter~0 5)} #86#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,303 INFO L272 TraceCheckUtils]: 87: Hoare triple {75525#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,303 INFO L290 TraceCheckUtils]: 88: Hoare triple {75525#(<= ~counter~0 5)} ~cond := #in~cond; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,304 INFO L290 TraceCheckUtils]: 89: Hoare triple {75525#(<= ~counter~0 5)} assume !(0 == ~cond); {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,304 INFO L290 TraceCheckUtils]: 90: Hoare triple {75525#(<= ~counter~0 5)} assume true; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,304 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {75525#(<= ~counter~0 5)} {75525#(<= ~counter~0 5)} #88#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,305 INFO L272 TraceCheckUtils]: 92: Hoare triple {75525#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,305 INFO L290 TraceCheckUtils]: 93: Hoare triple {75525#(<= ~counter~0 5)} ~cond := #in~cond; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,305 INFO L290 TraceCheckUtils]: 94: Hoare triple {75525#(<= ~counter~0 5)} assume !(0 == ~cond); {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,305 INFO L290 TraceCheckUtils]: 95: Hoare triple {75525#(<= ~counter~0 5)} assume true; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,306 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {75525#(<= ~counter~0 5)} {75525#(<= ~counter~0 5)} #90#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,306 INFO L272 TraceCheckUtils]: 97: Hoare triple {75525#(<= ~counter~0 5)} 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)); {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,307 INFO L290 TraceCheckUtils]: 98: Hoare triple {75525#(<= ~counter~0 5)} ~cond := #in~cond; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,307 INFO L290 TraceCheckUtils]: 99: Hoare triple {75525#(<= ~counter~0 5)} assume !(0 == ~cond); {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,307 INFO L290 TraceCheckUtils]: 100: Hoare triple {75525#(<= ~counter~0 5)} assume true; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,308 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {75525#(<= ~counter~0 5)} {75525#(<= ~counter~0 5)} #92#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,308 INFO L290 TraceCheckUtils]: 102: Hoare triple {75525#(<= ~counter~0 5)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,309 INFO L290 TraceCheckUtils]: 103: Hoare triple {75525#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,309 INFO L290 TraceCheckUtils]: 104: Hoare triple {75595#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,309 INFO L272 TraceCheckUtils]: 105: Hoare triple {75595#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,310 INFO L290 TraceCheckUtils]: 106: Hoare triple {75595#(<= ~counter~0 6)} ~cond := #in~cond; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,310 INFO L290 TraceCheckUtils]: 107: Hoare triple {75595#(<= ~counter~0 6)} assume !(0 == ~cond); {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,310 INFO L290 TraceCheckUtils]: 108: Hoare triple {75595#(<= ~counter~0 6)} assume true; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,310 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {75595#(<= ~counter~0 6)} {75595#(<= ~counter~0 6)} #86#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,311 INFO L272 TraceCheckUtils]: 110: Hoare triple {75595#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,311 INFO L290 TraceCheckUtils]: 111: Hoare triple {75595#(<= ~counter~0 6)} ~cond := #in~cond; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,311 INFO L290 TraceCheckUtils]: 112: Hoare triple {75595#(<= ~counter~0 6)} assume !(0 == ~cond); {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,312 INFO L290 TraceCheckUtils]: 113: Hoare triple {75595#(<= ~counter~0 6)} assume true; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,312 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {75595#(<= ~counter~0 6)} {75595#(<= ~counter~0 6)} #88#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,313 INFO L272 TraceCheckUtils]: 115: Hoare triple {75595#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,313 INFO L290 TraceCheckUtils]: 116: Hoare triple {75595#(<= ~counter~0 6)} ~cond := #in~cond; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,313 INFO L290 TraceCheckUtils]: 117: Hoare triple {75595#(<= ~counter~0 6)} assume !(0 == ~cond); {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,313 INFO L290 TraceCheckUtils]: 118: Hoare triple {75595#(<= ~counter~0 6)} assume true; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,314 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {75595#(<= ~counter~0 6)} {75595#(<= ~counter~0 6)} #90#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,314 INFO L272 TraceCheckUtils]: 120: Hoare triple {75595#(<= ~counter~0 6)} 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)); {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,314 INFO L290 TraceCheckUtils]: 121: Hoare triple {75595#(<= ~counter~0 6)} ~cond := #in~cond; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,315 INFO L290 TraceCheckUtils]: 122: Hoare triple {75595#(<= ~counter~0 6)} assume !(0 == ~cond); {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,315 INFO L290 TraceCheckUtils]: 123: Hoare triple {75595#(<= ~counter~0 6)} assume true; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,315 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {75595#(<= ~counter~0 6)} {75595#(<= ~counter~0 6)} #92#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,316 INFO L290 TraceCheckUtils]: 125: Hoare triple {75595#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,316 INFO L290 TraceCheckUtils]: 126: Hoare triple {75595#(<= ~counter~0 6)} ~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; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,316 INFO L290 TraceCheckUtils]: 127: Hoare triple {75595#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75668#(<= |main_#t~post6| 6)} is VALID [2022-04-28 05:50:37,316 INFO L290 TraceCheckUtils]: 128: Hoare triple {75668#(<= |main_#t~post6| 6)} assume !(#t~post6 < 10);havoc #t~post6; {75276#false} is VALID [2022-04-28 05:50:37,317 INFO L272 TraceCheckUtils]: 129: Hoare triple {75276#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {75276#false} is VALID [2022-04-28 05:50:37,317 INFO L290 TraceCheckUtils]: 130: Hoare triple {75276#false} ~cond := #in~cond; {75276#false} is VALID [2022-04-28 05:50:37,317 INFO L290 TraceCheckUtils]: 131: Hoare triple {75276#false} assume 0 == ~cond; {75276#false} is VALID [2022-04-28 05:50:37,317 INFO L290 TraceCheckUtils]: 132: Hoare triple {75276#false} assume !false; {75276#false} is VALID [2022-04-28 05:50:37,317 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 434 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 05:50:37,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:50:37,781 INFO L290 TraceCheckUtils]: 132: Hoare triple {75276#false} assume !false; {75276#false} is VALID [2022-04-28 05:50:37,781 INFO L290 TraceCheckUtils]: 131: Hoare triple {75276#false} assume 0 == ~cond; {75276#false} is VALID [2022-04-28 05:50:37,781 INFO L290 TraceCheckUtils]: 130: Hoare triple {75276#false} ~cond := #in~cond; {75276#false} is VALID [2022-04-28 05:50:37,781 INFO L272 TraceCheckUtils]: 129: Hoare triple {75276#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {75276#false} is VALID [2022-04-28 05:50:37,782 INFO L290 TraceCheckUtils]: 128: Hoare triple {75696#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {75276#false} is VALID [2022-04-28 05:50:37,782 INFO L290 TraceCheckUtils]: 127: Hoare triple {75700#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75696#(< |main_#t~post6| 10)} is VALID [2022-04-28 05:50:37,782 INFO L290 TraceCheckUtils]: 126: Hoare triple {75700#(< ~counter~0 10)} ~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; {75700#(< ~counter~0 10)} is VALID [2022-04-28 05:50:37,782 INFO L290 TraceCheckUtils]: 125: Hoare triple {75700#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {75700#(< ~counter~0 10)} is VALID [2022-04-28 05:50:37,783 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {75275#true} {75700#(< ~counter~0 10)} #92#return; {75700#(< ~counter~0 10)} is VALID [2022-04-28 05:50:37,783 INFO L290 TraceCheckUtils]: 123: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,783 INFO L290 TraceCheckUtils]: 122: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,783 INFO L290 TraceCheckUtils]: 121: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,783 INFO L272 TraceCheckUtils]: 120: Hoare triple {75700#(< ~counter~0 10)} 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)); {75275#true} is VALID [2022-04-28 05:50:37,784 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {75275#true} {75700#(< ~counter~0 10)} #90#return; {75700#(< ~counter~0 10)} is VALID [2022-04-28 05:50:37,784 INFO L290 TraceCheckUtils]: 118: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,784 INFO L290 TraceCheckUtils]: 117: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,791 INFO L290 TraceCheckUtils]: 116: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,791 INFO L272 TraceCheckUtils]: 115: Hoare triple {75700#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75275#true} is VALID [2022-04-28 05:50:37,792 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {75275#true} {75700#(< ~counter~0 10)} #88#return; {75700#(< ~counter~0 10)} is VALID [2022-04-28 05:50:37,792 INFO L290 TraceCheckUtils]: 113: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,792 INFO L290 TraceCheckUtils]: 112: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,792 INFO L290 TraceCheckUtils]: 111: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,792 INFO L272 TraceCheckUtils]: 110: Hoare triple {75700#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75275#true} is VALID [2022-04-28 05:50:37,792 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {75275#true} {75700#(< ~counter~0 10)} #86#return; {75700#(< ~counter~0 10)} is VALID [2022-04-28 05:50:37,793 INFO L290 TraceCheckUtils]: 108: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,793 INFO L290 TraceCheckUtils]: 107: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,793 INFO L290 TraceCheckUtils]: 106: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,793 INFO L272 TraceCheckUtils]: 105: Hoare triple {75700#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75275#true} is VALID [2022-04-28 05:50:37,793 INFO L290 TraceCheckUtils]: 104: Hoare triple {75700#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {75700#(< ~counter~0 10)} is VALID [2022-04-28 05:50:37,794 INFO L290 TraceCheckUtils]: 103: Hoare triple {75773#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75700#(< ~counter~0 10)} is VALID [2022-04-28 05:50:37,795 INFO L290 TraceCheckUtils]: 102: Hoare triple {75773#(< ~counter~0 9)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {75773#(< ~counter~0 9)} is VALID [2022-04-28 05:50:37,795 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {75275#true} {75773#(< ~counter~0 9)} #92#return; {75773#(< ~counter~0 9)} is VALID [2022-04-28 05:50:37,795 INFO L290 TraceCheckUtils]: 100: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,795 INFO L290 TraceCheckUtils]: 99: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,795 INFO L290 TraceCheckUtils]: 98: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,796 INFO L272 TraceCheckUtils]: 97: Hoare triple {75773#(< ~counter~0 9)} 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)); {75275#true} is VALID [2022-04-28 05:50:37,796 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {75275#true} {75773#(< ~counter~0 9)} #90#return; {75773#(< ~counter~0 9)} is VALID [2022-04-28 05:50:37,796 INFO L290 TraceCheckUtils]: 95: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,796 INFO L290 TraceCheckUtils]: 94: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,796 INFO L290 TraceCheckUtils]: 93: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,796 INFO L272 TraceCheckUtils]: 92: Hoare triple {75773#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75275#true} is VALID [2022-04-28 05:50:37,797 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {75275#true} {75773#(< ~counter~0 9)} #88#return; {75773#(< ~counter~0 9)} is VALID [2022-04-28 05:50:37,797 INFO L290 TraceCheckUtils]: 90: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,797 INFO L290 TraceCheckUtils]: 89: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,797 INFO L290 TraceCheckUtils]: 88: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,797 INFO L272 TraceCheckUtils]: 87: Hoare triple {75773#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75275#true} is VALID [2022-04-28 05:50:37,798 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {75275#true} {75773#(< ~counter~0 9)} #86#return; {75773#(< ~counter~0 9)} is VALID [2022-04-28 05:50:37,798 INFO L290 TraceCheckUtils]: 85: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,798 INFO L290 TraceCheckUtils]: 84: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,798 INFO L290 TraceCheckUtils]: 83: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,798 INFO L272 TraceCheckUtils]: 82: Hoare triple {75773#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75275#true} is VALID [2022-04-28 05:50:37,799 INFO L290 TraceCheckUtils]: 81: Hoare triple {75773#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {75773#(< ~counter~0 9)} is VALID [2022-04-28 05:50:37,799 INFO L290 TraceCheckUtils]: 80: Hoare triple {75843#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75773#(< ~counter~0 9)} is VALID [2022-04-28 05:50:37,800 INFO L290 TraceCheckUtils]: 79: Hoare triple {75843#(< ~counter~0 8)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {75843#(< ~counter~0 8)} is VALID [2022-04-28 05:50:37,800 INFO L290 TraceCheckUtils]: 78: Hoare triple {75843#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {75843#(< ~counter~0 8)} is VALID [2022-04-28 05:50:37,801 INFO L290 TraceCheckUtils]: 77: Hoare triple {75595#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75843#(< ~counter~0 8)} is VALID [2022-04-28 05:50:37,801 INFO L290 TraceCheckUtils]: 76: Hoare triple {75595#(<= ~counter~0 6)} ~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; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,801 INFO L290 TraceCheckUtils]: 75: Hoare triple {75595#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,802 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {75275#true} {75595#(<= ~counter~0 6)} #92#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,802 INFO L290 TraceCheckUtils]: 73: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,802 INFO L290 TraceCheckUtils]: 72: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,802 INFO L290 TraceCheckUtils]: 71: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,802 INFO L272 TraceCheckUtils]: 70: Hoare triple {75595#(<= ~counter~0 6)} 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)); {75275#true} is VALID [2022-04-28 05:50:37,802 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {75275#true} {75595#(<= ~counter~0 6)} #90#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,802 INFO L290 TraceCheckUtils]: 68: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,802 INFO L290 TraceCheckUtils]: 67: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,802 INFO L290 TraceCheckUtils]: 66: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,803 INFO L272 TraceCheckUtils]: 65: Hoare triple {75595#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75275#true} is VALID [2022-04-28 05:50:37,803 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {75275#true} {75595#(<= ~counter~0 6)} #88#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,803 INFO L290 TraceCheckUtils]: 63: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,803 INFO L290 TraceCheckUtils]: 62: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,803 INFO L290 TraceCheckUtils]: 61: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,803 INFO L272 TraceCheckUtils]: 60: Hoare triple {75595#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75275#true} is VALID [2022-04-28 05:50:37,804 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {75275#true} {75595#(<= ~counter~0 6)} #86#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,804 INFO L290 TraceCheckUtils]: 57: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,804 INFO L290 TraceCheckUtils]: 56: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,804 INFO L272 TraceCheckUtils]: 55: Hoare triple {75595#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75275#true} is VALID [2022-04-28 05:50:37,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {75595#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,805 INFO L290 TraceCheckUtils]: 53: Hoare triple {75525#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:37,805 INFO L290 TraceCheckUtils]: 52: Hoare triple {75525#(<= ~counter~0 5)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,805 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {75275#true} {75525#(<= ~counter~0 5)} #92#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,806 INFO L290 TraceCheckUtils]: 50: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,806 INFO L290 TraceCheckUtils]: 49: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,806 INFO L290 TraceCheckUtils]: 48: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,806 INFO L272 TraceCheckUtils]: 47: Hoare triple {75525#(<= ~counter~0 5)} 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)); {75275#true} is VALID [2022-04-28 05:50:37,806 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {75275#true} {75525#(<= ~counter~0 5)} #90#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,806 INFO L290 TraceCheckUtils]: 43: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,806 INFO L272 TraceCheckUtils]: 42: Hoare triple {75525#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75275#true} is VALID [2022-04-28 05:50:37,807 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {75275#true} {75525#(<= ~counter~0 5)} #88#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,807 INFO L272 TraceCheckUtils]: 37: Hoare triple {75525#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75275#true} is VALID [2022-04-28 05:50:37,807 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {75275#true} {75525#(<= ~counter~0 5)} #86#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,808 INFO L290 TraceCheckUtils]: 35: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,808 INFO L272 TraceCheckUtils]: 32: Hoare triple {75525#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75275#true} is VALID [2022-04-28 05:50:37,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {75525#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {75515#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:37,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {75515#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {75515#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:37,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {75515#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {75515#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:37,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {75442#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75515#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:37,810 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {75275#true} {75442#(<= ~counter~0 3)} #84#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,810 INFO L290 TraceCheckUtils]: 25: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,810 INFO L272 TraceCheckUtils]: 22: Hoare triple {75442#(<= ~counter~0 3)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {75275#true} is VALID [2022-04-28 05:50:37,811 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {75275#true} {75442#(<= ~counter~0 3)} #82#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,811 INFO L272 TraceCheckUtils]: 17: Hoare triple {75442#(<= ~counter~0 3)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {75275#true} is VALID [2022-04-28 05:50:37,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {75442#(<= ~counter~0 3)} ~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; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,811 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {75275#true} {75442#(<= ~counter~0 3)} #80#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,812 INFO L272 TraceCheckUtils]: 11: Hoare triple {75442#(<= ~counter~0 3)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {75275#true} is VALID [2022-04-28 05:50:37,812 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {75275#true} {75442#(<= ~counter~0 3)} #78#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 05:50:37,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 05:50:37,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 05:50:37,812 INFO L272 TraceCheckUtils]: 6: Hoare triple {75442#(<= ~counter~0 3)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {75275#true} is VALID [2022-04-28 05:50:37,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {75442#(<= ~counter~0 3)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {75442#(<= ~counter~0 3)} call #t~ret8 := main(); {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75442#(<= ~counter~0 3)} {75275#true} #98#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {75442#(<= ~counter~0 3)} assume true; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {75275#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);~counter~0 := 0; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:37,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {75275#true} call ULTIMATE.init(); {75275#true} is VALID [2022-04-28 05:50:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-04-28 05:50:37,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:37,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393289988] [2022-04-28 05:50:37,814 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:37,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291143358] [2022-04-28 05:50:37,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291143358] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:50:37,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:50:37,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 05:50:37,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:37,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1371162966] [2022-04-28 05:50:37,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1371162966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:37,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:37,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:50:37,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704852164] [2022-04-28 05:50:37,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:37,815 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (23), 7 states have call predecessors, (23), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21) Word has length 133 [2022-04-28 05:50:37,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:37,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (23), 7 states have call predecessors, (23), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 05:50:37,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:37,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:50:37,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:37,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:50:37,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:50:37,891 INFO L87 Difference]: Start difference. First operand 613 states and 769 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (23), 7 states have call predecessors, (23), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 05:50:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:39,530 INFO L93 Difference]: Finished difference Result 629 states and 787 transitions. [2022-04-28 05:50:39,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 05:50:39,530 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (23), 7 states have call predecessors, (23), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21) Word has length 133 [2022-04-28 05:50:39,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (23), 7 states have call predecessors, (23), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 05:50:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 150 transitions. [2022-04-28 05:50:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (23), 7 states have call predecessors, (23), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 05:50:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 150 transitions. [2022-04-28 05:50:39,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 150 transitions. [2022-04-28 05:50:39,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:39,671 INFO L225 Difference]: With dead ends: 629 [2022-04-28 05:50:39,671 INFO L226 Difference]: Without dead ends: 622 [2022-04-28 05:50:39,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2022-04-28 05:50:39,672 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:50:39,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 189 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:50:39,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2022-04-28 05:50:40,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2022-04-28 05:50:40,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:40,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 622 states. Second operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-28 05:50:40,898 INFO L74 IsIncluded]: Start isIncluded. First operand 622 states. Second operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-28 05:50:40,898 INFO L87 Difference]: Start difference. First operand 622 states. Second operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-28 05:50:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:40,910 INFO L93 Difference]: Finished difference Result 622 states and 778 transitions. [2022-04-28 05:50:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 778 transitions. [2022-04-28 05:50:40,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:40,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:40,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) Second operand 622 states. [2022-04-28 05:50:40,912 INFO L87 Difference]: Start difference. First operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) Second operand 622 states. [2022-04-28 05:50:40,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:40,924 INFO L93 Difference]: Finished difference Result 622 states and 778 transitions. [2022-04-28 05:50:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 778 transitions. [2022-04-28 05:50:40,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:40,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:40,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:40,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-28 05:50:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 778 transitions. [2022-04-28 05:50:40,943 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 778 transitions. Word has length 133 [2022-04-28 05:50:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:40,943 INFO L495 AbstractCegarLoop]: Abstraction has 622 states and 778 transitions. [2022-04-28 05:50:40,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (23), 7 states have call predecessors, (23), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 05:50:40,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 622 states and 778 transitions. [2022-04-28 05:50:42,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 778 edges. 778 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 778 transitions. [2022-04-28 05:50:42,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 05:50:42,499 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:42,499 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:50:42,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 05:50:42,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 05:50:42,699 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:42,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:42,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1894865945, now seen corresponding path program 9 times [2022-04-28 05:50:42,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:42,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1185781848] [2022-04-28 05:50:42,700 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:42,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1894865945, now seen corresponding path program 10 times [2022-04-28 05:50:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:42,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114898830] [2022-04-28 05:50:42,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:42,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:42,710 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:42,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1803637456] [2022-04-28 05:50:42,710 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:50:42,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:42,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:42,711 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:50:42,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 05:50:42,769 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:50:42,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:42,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-28 05:50:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:42,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:52,532 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:50:52,546 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:50:53,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {79842#true} call ULTIMATE.init(); {79842#true} is VALID [2022-04-28 05:50:53,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {79842#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);~counter~0 := 0; {79842#true} is VALID [2022-04-28 05:50:53,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79842#true} {79842#true} #98#return; {79842#true} is VALID [2022-04-28 05:50:53,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {79842#true} call #t~ret8 := main(); {79842#true} is VALID [2022-04-28 05:50:53,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {79842#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {79842#true} is VALID [2022-04-28 05:50:53,077 INFO L272 TraceCheckUtils]: 6: Hoare triple {79842#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {79842#true} is VALID [2022-04-28 05:50:53,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-28 05:50:53,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-28 05:50:53,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,078 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79842#true} {79842#true} #78#return; {79842#true} is VALID [2022-04-28 05:50:53,078 INFO L272 TraceCheckUtils]: 11: Hoare triple {79842#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {79842#true} is VALID [2022-04-28 05:50:53,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-28 05:50:53,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-28 05:50:53,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,078 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79842#true} {79842#true} #80#return; {79842#true} is VALID [2022-04-28 05:50:53,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {79842#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; {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:50:53,078 INFO L272 TraceCheckUtils]: 17: Hoare triple {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {79842#true} is VALID [2022-04-28 05:50:53,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-28 05:50:53,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-28 05:50:53,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,079 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {79842#true} {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #82#return; {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:50:53,079 INFO L272 TraceCheckUtils]: 22: Hoare triple {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {79842#true} is VALID [2022-04-28 05:50:53,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-28 05:50:53,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-28 05:50:53,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,080 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {79842#true} {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #84#return; {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:50:53,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:50:53,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 10);havoc #t~post6; {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:50:53,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:50:53,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:50:53,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !!(#t~post7 < 10);havoc #t~post7; {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:50:53,081 INFO L272 TraceCheckUtils]: 32: Hoare triple {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {79842#true} is VALID [2022-04-28 05:50:53,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-28 05:50:53,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-28 05:50:53,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,082 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {79842#true} {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #86#return; {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:50:53,082 INFO L272 TraceCheckUtils]: 37: Hoare triple {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 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)); {79842#true} is VALID [2022-04-28 05:50:53,082 INFO L290 TraceCheckUtils]: 38: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-28 05:50:53,082 INFO L290 TraceCheckUtils]: 39: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-28 05:50:53,082 INFO L290 TraceCheckUtils]: 40: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,083 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {79842#true} {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #88#return; {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:50:53,083 INFO L272 TraceCheckUtils]: 42: Hoare triple {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 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)); {79842#true} is VALID [2022-04-28 05:50:53,083 INFO L290 TraceCheckUtils]: 43: Hoare triple {79842#true} ~cond := #in~cond; {79978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:50:53,083 INFO L290 TraceCheckUtils]: 44: Hoare triple {79978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:53,084 INFO L290 TraceCheckUtils]: 45: Hoare triple {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:53,084 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #90#return; {79989#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:50:53,084 INFO L272 TraceCheckUtils]: 47: Hoare triple {79989#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 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)); {79842#true} is VALID [2022-04-28 05:50:53,084 INFO L290 TraceCheckUtils]: 48: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-28 05:50:53,084 INFO L290 TraceCheckUtils]: 49: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-28 05:50:53,085 INFO L290 TraceCheckUtils]: 50: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,085 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {79842#true} {79989#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #92#return; {79989#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:50:53,086 INFO L290 TraceCheckUtils]: 52: Hoare triple {79989#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {79989#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:50:53,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {79989#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 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; {80011#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,088 INFO L290 TraceCheckUtils]: 54: Hoare triple {80011#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80011#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,088 INFO L290 TraceCheckUtils]: 55: Hoare triple {80011#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(#t~post6 < 10);havoc #t~post6; {80011#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,088 INFO L290 TraceCheckUtils]: 56: Hoare triple {80011#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,089 INFO L290 TraceCheckUtils]: 57: Hoare triple {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,089 INFO L290 TraceCheckUtils]: 58: Hoare triple {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(#t~post7 < 10);havoc #t~post7; {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,089 INFO L272 TraceCheckUtils]: 59: Hoare triple {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {79842#true} is VALID [2022-04-28 05:50:53,089 INFO L290 TraceCheckUtils]: 60: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-28 05:50:53,089 INFO L290 TraceCheckUtils]: 61: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-28 05:50:53,089 INFO L290 TraceCheckUtils]: 62: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,090 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79842#true} {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #86#return; {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,090 INFO L272 TraceCheckUtils]: 64: Hoare triple {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {79842#true} is VALID [2022-04-28 05:50:53,090 INFO L290 TraceCheckUtils]: 65: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-28 05:50:53,090 INFO L290 TraceCheckUtils]: 66: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-28 05:50:53,090 INFO L290 TraceCheckUtils]: 67: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,091 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {79842#true} {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #88#return; {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,091 INFO L272 TraceCheckUtils]: 69: Hoare triple {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {79842#true} is VALID [2022-04-28 05:50:53,091 INFO L290 TraceCheckUtils]: 70: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-28 05:50:53,091 INFO L290 TraceCheckUtils]: 71: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-28 05:50:53,091 INFO L290 TraceCheckUtils]: 72: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,091 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {79842#true} {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #90#return; {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,091 INFO L272 TraceCheckUtils]: 74: Hoare triple {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~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)); {79842#true} is VALID [2022-04-28 05:50:53,091 INFO L290 TraceCheckUtils]: 75: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-28 05:50:53,091 INFO L290 TraceCheckUtils]: 76: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-28 05:50:53,092 INFO L290 TraceCheckUtils]: 77: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,097 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {79842#true} {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #92#return; {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,099 INFO L290 TraceCheckUtils]: 79: Hoare triple {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,099 INFO L290 TraceCheckUtils]: 80: Hoare triple {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,100 INFO L290 TraceCheckUtils]: 81: Hoare triple {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(#t~post7 < 10);havoc #t~post7; {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,100 INFO L272 TraceCheckUtils]: 82: Hoare triple {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {79842#true} is VALID [2022-04-28 05:50:53,100 INFO L290 TraceCheckUtils]: 83: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-28 05:50:53,100 INFO L290 TraceCheckUtils]: 84: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-28 05:50:53,100 INFO L290 TraceCheckUtils]: 85: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,109 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {79842#true} {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #86#return; {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,110 INFO L272 TraceCheckUtils]: 87: Hoare triple {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {79842#true} is VALID [2022-04-28 05:50:53,110 INFO L290 TraceCheckUtils]: 88: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-28 05:50:53,110 INFO L290 TraceCheckUtils]: 89: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-28 05:50:53,110 INFO L290 TraceCheckUtils]: 90: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,110 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {79842#true} {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #88#return; {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,110 INFO L272 TraceCheckUtils]: 92: Hoare triple {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {79842#true} is VALID [2022-04-28 05:50:53,110 INFO L290 TraceCheckUtils]: 93: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-28 05:50:53,110 INFO L290 TraceCheckUtils]: 94: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-28 05:50:53,110 INFO L290 TraceCheckUtils]: 95: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,111 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {79842#true} {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #90#return; {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,111 INFO L272 TraceCheckUtils]: 97: Hoare triple {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~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)); {79842#true} is VALID [2022-04-28 05:50:53,111 INFO L290 TraceCheckUtils]: 98: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-28 05:50:53,111 INFO L290 TraceCheckUtils]: 99: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-28 05:50:53,111 INFO L290 TraceCheckUtils]: 100: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,112 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {79842#true} {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #92#return; {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:50:53,113 INFO L290 TraceCheckUtils]: 102: Hoare triple {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {80161#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} is VALID [2022-04-28 05:50:53,114 INFO L290 TraceCheckUtils]: 103: Hoare triple {80161#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80161#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} is VALID [2022-04-28 05:50:53,114 INFO L290 TraceCheckUtils]: 104: Hoare triple {80161#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {80161#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} is VALID [2022-04-28 05:50:53,114 INFO L272 TraceCheckUtils]: 105: Hoare triple {80161#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {79842#true} is VALID [2022-04-28 05:50:53,115 INFO L290 TraceCheckUtils]: 106: Hoare triple {79842#true} ~cond := #in~cond; {79978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:50:53,115 INFO L290 TraceCheckUtils]: 107: Hoare triple {79978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:53,115 INFO L290 TraceCheckUtils]: 108: Hoare triple {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:53,116 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} {80161#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} #86#return; {80183#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} is VALID [2022-04-28 05:50:53,116 INFO L272 TraceCheckUtils]: 110: Hoare triple {80183#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {79842#true} is VALID [2022-04-28 05:50:53,116 INFO L290 TraceCheckUtils]: 111: Hoare triple {79842#true} ~cond := #in~cond; {79978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:50:53,116 INFO L290 TraceCheckUtils]: 112: Hoare triple {79978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:53,117 INFO L290 TraceCheckUtils]: 113: Hoare triple {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:53,119 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} {80183#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} #88#return; {80199#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} is VALID [2022-04-28 05:50:53,119 INFO L272 TraceCheckUtils]: 115: Hoare triple {80199#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {79842#true} is VALID [2022-04-28 05:50:53,119 INFO L290 TraceCheckUtils]: 116: Hoare triple {79842#true} ~cond := #in~cond; {79978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:50:53,119 INFO L290 TraceCheckUtils]: 117: Hoare triple {79978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:53,120 INFO L290 TraceCheckUtils]: 118: Hoare triple {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:53,122 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} {80199#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} #90#return; {80215#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~s~0 0) (= (+ main_~c~0 (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1))} is VALID [2022-04-28 05:50:53,122 INFO L272 TraceCheckUtils]: 120: Hoare triple {80215#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~s~0 0) (= (+ main_~c~0 (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~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)); {79842#true} is VALID [2022-04-28 05:50:53,122 INFO L290 TraceCheckUtils]: 121: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-28 05:50:53,122 INFO L290 TraceCheckUtils]: 122: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-28 05:50:53,122 INFO L290 TraceCheckUtils]: 123: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-28 05:50:53,123 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {79842#true} {80215#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~s~0 0) (= (+ main_~c~0 (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1))} #92#return; {80215#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~s~0 0) (= (+ main_~c~0 (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1))} is VALID [2022-04-28 05:50:53,124 INFO L290 TraceCheckUtils]: 125: Hoare triple {80215#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~s~0 0) (= (+ main_~c~0 (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1))} assume !(~c~0 >= ~b~0); {80215#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~s~0 0) (= (+ main_~c~0 (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1))} is VALID [2022-04-28 05:50:55,126 WARN L290 TraceCheckUtils]: 126: Hoare triple {80215#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~s~0 0) (= (+ main_~c~0 (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~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; {80237#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (not (= main_~k~0 0)) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))))} is UNKNOWN [2022-04-28 05:50:55,128 INFO L290 TraceCheckUtils]: 127: Hoare triple {80237#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (not (= main_~k~0 0)) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80237#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (not (= main_~k~0 0)) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))))} is VALID [2022-04-28 05:50:55,130 INFO L290 TraceCheckUtils]: 128: Hoare triple {80237#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (not (= main_~k~0 0)) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))))} assume !!(#t~post6 < 10);havoc #t~post6; {80237#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (not (= main_~k~0 0)) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))))} is VALID [2022-04-28 05:50:55,131 INFO L290 TraceCheckUtils]: 129: Hoare triple {80237#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (not (= main_~k~0 0)) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))))} assume !(0 != ~b~0); {80247#(and (exists ((main_~k~0 Int)) (and (not (= main_~k~0 0)) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))) (= main_~s~0 1) (= (+ (* main_~q~0 main_~x~0) main_~y~0) 0))} is VALID [2022-04-28 05:50:55,132 INFO L272 TraceCheckUtils]: 130: Hoare triple {80247#(and (exists ((main_~k~0 Int)) (and (not (= main_~k~0 0)) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))) (= main_~s~0 1) (= (+ (* main_~q~0 main_~x~0) main_~y~0) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {80251#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:50:55,132 INFO L290 TraceCheckUtils]: 131: Hoare triple {80251#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {80255#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:50:55,133 INFO L290 TraceCheckUtils]: 132: Hoare triple {80255#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {79843#false} is VALID [2022-04-28 05:50:55,133 INFO L290 TraceCheckUtils]: 133: Hoare triple {79843#false} assume !false; {79843#false} is VALID [2022-04-28 05:50:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 133 proven. 95 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2022-04-28 05:50:55,133 INFO L328 TraceCheckSpWp]: Computing backward predicates...