/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 12:15:33,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 12:15:33,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 12:15:33,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 12:15:33,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 12:15:33,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 12:15:33,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 12:15:33,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 12:15:33,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 12:15:33,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 12:15:33,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 12:15:33,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 12:15:33,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 12:15:33,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 12:15:33,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 12:15:33,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 12:15:33,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 12:15:33,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 12:15:33,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 12:15:33,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 12:15:33,994 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 12:15:33,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 12:15:33,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 12:15:33,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 12:15:33,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 12:15:34,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 12:15:34,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 12:15:34,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 12:15:34,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 12:15:34,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 12:15:34,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 12:15:34,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 12:15:34,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 12:15:34,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 12:15:34,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 12:15:34,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 12:15:34,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 12:15:34,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 12:15:34,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 12:15:34,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 12:15:34,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 12:15:34,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 12:15:34,012 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 12:15:34,024 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 12:15:34,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 12:15:34,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 12:15:34,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 12:15:34,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 12:15:34,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 12:15:34,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 12:15:34,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 12:15:34,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 12:15:34,027 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 12:15:34,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 12:15:34,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 12:15:34,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 12:15:34,028 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 12:15:34,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 12:15:34,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:15:34,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 12:15:34,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 12:15:34,029 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 12:15:34,029 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 12:15:34,029 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 12:15:34,029 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 12:15:34,029 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 12:15:34,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 12:15:34,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 12:15:34,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 12:15:34,253 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 12:15:34,253 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 12:15:34,254 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 12:15:34,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20848a98/ba64a17e3c6c4c3a9831333f74f76753/FLAGaa23ccdb8 [2022-04-28 12:15:34,710 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 12:15:34,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound10.c [2022-04-28 12:15:34,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20848a98/ba64a17e3c6c4c3a9831333f74f76753/FLAGaa23ccdb8 [2022-04-28 12:15:34,730 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20848a98/ba64a17e3c6c4c3a9831333f74f76753 [2022-04-28 12:15:34,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 12:15:34,734 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 12:15:34,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 12:15:34,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 12:15:34,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 12:15:34,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:15:34" (1/1) ... [2022-04-28 12:15:34,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c526d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:15:34, skipping insertion in model container [2022-04-28 12:15:34,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:15:34" (1/1) ... [2022-04-28 12:15:34,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 12:15:34,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 12:15:34,892 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 12:15:34,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:15:34,928 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 12:15:34,938 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 12:15:34,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:15:34,958 INFO L208 MainTranslator]: Completed translation [2022-04-28 12:15:34,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:15:34 WrapperNode [2022-04-28 12:15:34,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 12:15:34,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 12:15:34,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 12:15:34,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 12:15:34,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:15:34" (1/1) ... [2022-04-28 12:15:34,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:15:34" (1/1) ... [2022-04-28 12:15:34,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:15:34" (1/1) ... [2022-04-28 12:15:34,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:15:34" (1/1) ... [2022-04-28 12:15:34,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:15:34" (1/1) ... [2022-04-28 12:15:34,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:15:34" (1/1) ... [2022-04-28 12:15:34,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:15:34" (1/1) ... [2022-04-28 12:15:34,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 12:15:34,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 12:15:34,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 12:15:34,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 12:15:34,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:15:34" (1/1) ... [2022-04-28 12:15:34,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:15:35,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:15:35,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 12:15:35,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 12:15:35,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 12:15:35,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 12:15:35,044 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 12:15:35,044 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 12:15:35,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 12:15:35,045 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 12:15:35,045 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 12:15:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 12:15:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 12:15:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 12:15:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 12:15:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 12:15:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 12:15:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 12:15:35,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 12:15:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 12:15:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 12:15:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 12:15:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 12:15:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 12:15:35,116 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 12:15:35,117 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 12:15:35,277 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 12:15:35,283 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 12:15:35,284 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 12:15:35,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:15:35 BoogieIcfgContainer [2022-04-28 12:15:35,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 12:15:35,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 12:15:35,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 12:15:35,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 12:15:35,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:15:34" (1/3) ... [2022-04-28 12:15:35,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dfc3335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:15:35, skipping insertion in model container [2022-04-28 12:15:35,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:15:34" (2/3) ... [2022-04-28 12:15:35,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dfc3335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:15:35, skipping insertion in model container [2022-04-28 12:15:35,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:15:35" (3/3) ... [2022-04-28 12:15:35,292 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound10.c [2022-04-28 12:15:35,302 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 12:15:35,303 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 12:15:35,354 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 12:15:35,376 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@3e02cb6e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3cfe1bb3 [2022-04-28 12:15:35,376 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 12:15:35,384 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 12:15:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 12:15:35,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:15:35,407 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 12:15:35,408 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:15:35,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:15:35,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 1 times [2022-04-28 12:15:35,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:15:35,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1362576236] [2022-04-28 12:15:35,433 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:15:35,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 2 times [2022-04-28 12:15:35,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:15:35,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582401990] [2022-04-28 12:15:35,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:15:35,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:15:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:15:35,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 12:15:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:15:35,662 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 12:15:35,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 12:15:35,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-28 12:15:35,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 12:15:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:15:35,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 12:15:35,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 12:15:35,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 12:15:35,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-28 12:15:35,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 12:15:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:15:35,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 12:15:35,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 12:15:35,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 12:15:35,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-28 12:15:35,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 12:15:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:15:35,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 12:15:35,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 12:15:35,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 12:15:35,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-28 12:15:35,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-28 12:15:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:15:35,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 12:15:35,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 12:15:35,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 12:15:35,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-28 12:15:35,724 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 12:15:35,724 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 12:15:35,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 12:15:35,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-28 12:15:35,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret8 := main(); {42#true} is VALID [2022-04-28 12:15:35,727 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 12:15:35,727 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 12:15:35,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 12:15:35,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 12:15:35,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 12:15:35,728 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-28 12:15:35,728 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 12:15:35,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 12:15:35,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 12:15:35,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 12:15:35,729 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-28 12:15:35,730 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 12:15:35,730 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 12:15:35,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 12:15:35,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 12:15:35,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 12:15:35,732 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-28 12:15:35,732 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 12:15:35,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 12:15:35,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 12:15:35,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 12:15:35,735 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-28 12:15:35,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-28 12:15:35,738 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 12:15:35,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-28 12:15:35,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-28 12:15:35,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-28 12:15:35,740 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 12:15:35,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:15:35,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582401990] [2022-04-28 12:15:35,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582401990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:15:35,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:15:35,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:15:35,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:15:35,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1362576236] [2022-04-28 12:15:35,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1362576236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:15:35,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:15:35,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:15:35,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308288183] [2022-04-28 12:15:35,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:15:35,755 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 12:15:35,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:15:35,760 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 12:15:35,798 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 12:15:35,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 12:15:35,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:15:35,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 12:15:35,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 12:15:35,837 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 12:15:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:36,019 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-04-28 12:15:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 12:15:36,019 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 12:15:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:15:36,021 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 12:15:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-28 12:15:36,030 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 12:15:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-28 12:15:36,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-04-28 12:15:36,148 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 12:15:36,157 INFO L225 Difference]: With dead ends: 72 [2022-04-28 12:15:36,157 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 12:15:36,160 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 12:15:36,163 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 12:15:36,163 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 12:15:36,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 12:15:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-28 12:15:36,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:15:36,192 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 12:15:36,193 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 12:15:36,193 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 12:15:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:36,198 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-28 12:15:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-28 12:15:36,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:15:36,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:15:36,200 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 12:15:36,200 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 12:15:36,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:36,204 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-28 12:15:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-28 12:15:36,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:15:36,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:15:36,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:15:36,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:15:36,206 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 12:15:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-28 12:15:36,210 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-28 12:15:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:15:36,210 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-28 12:15:36,210 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 12:15:36,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-28 12:15:36,265 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 12:15:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 12:15:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 12:15:36,268 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:15:36,268 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 12:15:36,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 12:15:36,269 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:15:36,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:15:36,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 1 times [2022-04-28 12:15:36,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:15:36,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1767380421] [2022-04-28 12:15:36,271 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:15:36,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 2 times [2022-04-28 12:15:36,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:15:36,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19483952] [2022-04-28 12:15:36,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:15:36,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:15:36,314 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:15:36,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [90961542] [2022-04-28 12:15:36,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:15:36,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:15:36,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:15:36,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:15:36,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 12:15:36,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:15:36,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:15:36,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:15:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:15:36,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:15:36,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-28 12:15:36,662 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 12:15:36,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:36,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {356#(<= ~counter~0 0)} {348#true} #98#return; {356#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:36,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {356#(<= ~counter~0 0)} call #t~ret8 := main(); {356#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:36,664 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 12:15:36,664 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 12:15:36,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:36,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:36,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:36,669 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 12:15:36,669 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 12:15:36,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:36,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:36,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:36,672 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 12:15:36,672 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 12:15:36,673 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 12:15:36,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:36,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:36,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:36,675 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 12:15:36,675 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 12:15:36,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:36,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:36,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:36,677 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 12:15:36,678 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 12:15:36,679 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 12:15:36,679 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 12:15:36,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {349#false} ~cond := #in~cond; {349#false} is VALID [2022-04-28 12:15:36,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {349#false} assume 0 == ~cond; {349#false} is VALID [2022-04-28 12:15:36,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-28 12:15:36,680 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 12:15:36,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:15:36,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:15:36,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19483952] [2022-04-28 12:15:36,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:15:36,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90961542] [2022-04-28 12:15:36,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90961542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:15:36,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:15:36,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:15:36,682 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:15:36,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1767380421] [2022-04-28 12:15:36,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1767380421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:15:36,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:15:36,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:15:36,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437080965] [2022-04-28 12:15:36,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:15:36,684 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 12:15:36,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:15:36,685 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 12:15:36,705 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 12:15:36,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 12:15:36,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:15:36,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 12:15:36,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:15:36,706 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 12:15:36,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:36,817 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-28 12:15:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 12:15:36,818 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 12:15:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:15:36,818 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 12:15:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-28 12:15:36,821 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 12:15:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-28 12:15:36,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-28 12:15:36,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:15:36,885 INFO L225 Difference]: With dead ends: 44 [2022-04-28 12:15:36,885 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 12:15:36,886 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 12:15:36,888 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 12:15:36,892 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 12:15:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 12:15:36,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 12:15:36,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:15:36,909 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 12:15:36,910 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 12:15:36,910 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 12:15:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:36,913 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-28 12:15:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-28 12:15:36,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:15:36,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:15:36,915 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 12:15:36,915 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 12:15:36,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:36,918 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-28 12:15:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-28 12:15:36,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:15:36,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:15:36,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:15:36,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:15:36,919 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 12:15:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-28 12:15:36,922 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-28 12:15:36,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:15:36,922 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-28 12:15:36,922 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 12:15:36,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 47 transitions. [2022-04-28 12:15:36,969 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 12:15:36,969 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-28 12:15:36,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 12:15:36,970 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:15:36,970 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 12:15:36,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 12:15:37,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:15:37,184 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:15:37,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:15:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 1 times [2022-04-28 12:15:37,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:15:37,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1350103480] [2022-04-28 12:15:37,185 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:15:37,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 2 times [2022-04-28 12:15:37,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:15:37,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174446898] [2022-04-28 12:15:37,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:15:37,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:15:37,200 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:15:37,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [722452487] [2022-04-28 12:15:37,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:15:37,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:15:37,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:15:37,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:15:37,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 12:15:37,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:15:37,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:15:37,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:15:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:15:37,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:15:37,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-28 12:15:37,400 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 12:15:37,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 12:15:37,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #98#return; {682#true} is VALID [2022-04-28 12:15:37,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret8 := main(); {682#true} is VALID [2022-04-28 12:15:37,401 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 12:15:37,401 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 12:15:37,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 12:15:37,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 12:15:37,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 12:15:37,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {682#true} {682#true} #78#return; {682#true} is VALID [2022-04-28 12:15:37,402 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 12:15:37,403 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 12:15:37,403 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 12:15:37,404 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 12:15:37,404 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 12:15:37,405 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 12:15:37,405 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 12:15:37,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 12:15:37,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 12:15:37,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 12:15:37,406 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 12:15:37,407 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 12:15:37,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 12:15:37,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 12:15:37,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 12:15:37,408 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 12:15:37,408 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 12:15:37,409 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 12:15:37,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {738#(<= 1 main_~b~0)} assume !(0 != ~b~0); {683#false} is VALID [2022-04-28 12:15:37,409 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 12:15:37,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-28 12:15:37,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-28 12:15:37,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-28 12:15:37,410 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 12:15:37,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:15:37,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-28 12:15:37,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-28 12:15:37,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-28 12:15:37,611 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 12:15:37,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {738#(<= 1 main_~b~0)} assume !(0 != ~b~0); {683#false} is VALID [2022-04-28 12:15:37,612 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 12:15:37,613 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 12:15:37,613 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 12:15:37,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 12:15:37,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 12:15:37,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 12:15:37,614 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 12:15:37,614 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 12:15:37,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 12:15:37,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 12:15:37,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 12:15:37,615 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 12:15:37,616 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 12:15:37,616 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 12:15:37,617 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 12:15:37,617 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 12:15:37,618 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 12:15:37,618 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 12:15:37,618 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {682#true} {682#true} #78#return; {682#true} is VALID [2022-04-28 12:15:37,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 12:15:37,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 12:15:37,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 12:15:37,619 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 12:15:37,619 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 12:15:37,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret8 := main(); {682#true} is VALID [2022-04-28 12:15:37,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #98#return; {682#true} is VALID [2022-04-28 12:15:37,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 12:15:37,619 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 12:15:37,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-28 12:15:37,620 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 12:15:37,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:15:37,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174446898] [2022-04-28 12:15:37,620 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:15:37,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722452487] [2022-04-28 12:15:37,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722452487] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:15:37,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:15:37,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-28 12:15:37,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:15:37,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1350103480] [2022-04-28 12:15:37,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1350103480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:15:37,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:15:37,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:15:37,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541233675] [2022-04-28 12:15:37,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:15:37,622 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 12:15:37,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:15:37,622 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 12:15:37,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:15:37,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:15:37,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:15:37,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:15:37,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 12:15:37,644 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 12:15:37,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:37,962 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-28 12:15:37,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:15:37,962 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 12:15:37,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:15:37,963 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 12:15:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-28 12:15:37,968 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 12:15:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-28 12:15:37,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-28 12:15:38,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:15:38,047 INFO L225 Difference]: With dead ends: 53 [2022-04-28 12:15:38,047 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 12:15:38,047 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 12:15:38,048 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 12:15:38,049 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 12:15:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 12:15:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-28 12:15:38,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:15:38,082 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 12:15:38,083 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 12:15:38,083 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 12:15:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:38,086 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-28 12:15:38,086 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-28 12:15:38,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:15:38,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:15:38,087 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 12:15:38,088 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 12:15:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:38,090 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-28 12:15:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-28 12:15:38,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:15:38,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:15:38,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:15:38,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:15:38,091 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 12:15:38,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-28 12:15:38,093 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-28 12:15:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:15:38,093 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-28 12:15:38,093 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 12:15:38,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 48 transitions. [2022-04-28 12:15:38,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:15:38,142 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-28 12:15:38,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 12:15:38,144 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:15:38,145 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 12:15:38,161 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 12:15:38,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 12:15:38,351 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:15:38,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:15:38,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 1 times [2022-04-28 12:15:38,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:15:38,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [555448683] [2022-04-28 12:15:38,352 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:15:38,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 2 times [2022-04-28 12:15:38,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:15:38,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906433005] [2022-04-28 12:15:38,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:15:38,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:15:38,373 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:15:38,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1865714901] [2022-04-28 12:15:38,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:15:38,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:15:38,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:15:38,380 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:15:38,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 12:15:38,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:15:38,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:15:38,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 12:15:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:15:38,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:15:38,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {1166#true} call ULTIMATE.init(); {1166#true} is VALID [2022-04-28 12:15:38,576 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 12:15:38,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-28 12:15:38,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1166#true} {1166#true} #98#return; {1166#true} is VALID [2022-04-28 12:15:38,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {1166#true} call #t~ret8 := main(); {1166#true} is VALID [2022-04-28 12:15:38,577 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 12:15:38,577 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 12:15:38,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-28 12:15:38,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-28 12:15:38,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-28 12:15:38,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1166#true} {1166#true} #78#return; {1166#true} is VALID [2022-04-28 12:15:38,578 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 12:15:38,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-28 12:15:38,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-28 12:15:38,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-28 12:15:38,578 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1166#true} {1166#true} #80#return; {1166#true} is VALID [2022-04-28 12:15:38,578 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 12:15:38,579 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 12:15:38,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-28 12:15:38,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-28 12:15:38,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-28 12:15:38,579 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1166#true} {1166#true} #82#return; {1166#true} is VALID [2022-04-28 12:15:38,579 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 12:15:38,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-28 12:15:38,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-28 12:15:38,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-28 12:15:38,580 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1166#true} {1166#true} #84#return; {1166#true} is VALID [2022-04-28 12:15:38,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {1166#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1166#true} is VALID [2022-04-28 12:15:38,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {1166#true} assume !!(#t~post6 < 10);havoc #t~post6; {1166#true} is VALID [2022-04-28 12:15:38,582 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 12:15:38,584 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 12:15:38,585 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 12:15:38,586 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 12:15:38,586 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 12:15:38,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {1272#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1167#false} is VALID [2022-04-28 12:15:38,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {1167#false} assume !false; {1167#false} is VALID [2022-04-28 12:15:38,587 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 12:15:38,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:15:38,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:15:38,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906433005] [2022-04-28 12:15:38,587 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:15:38,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865714901] [2022-04-28 12:15:38,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865714901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:15:38,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:15:38,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:15:38,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:15:38,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [555448683] [2022-04-28 12:15:38,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [555448683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:15:38,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:15:38,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:15:38,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396502548] [2022-04-28 12:15:38,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:15:38,589 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 12:15:38,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:15:38,589 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 12:15:38,608 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 12:15:38,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:15:38,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:15:38,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:15:38,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:15:38,609 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 12:15:38,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:38,824 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-28 12:15:38,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:15:38,824 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 12:15:38,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:15:38,825 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 12:15:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 12:15:38,826 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 12:15:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 12:15:38,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-28 12:15:38,894 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 12:15:38,898 INFO L225 Difference]: With dead ends: 51 [2022-04-28 12:15:38,898 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 12:15:38,899 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 12:15:38,901 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 12:15:38,902 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 12:15:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 12:15:38,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2022-04-28 12:15:38,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:15:38,941 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 12:15:38,941 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 12:15:38,942 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 12:15:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:38,944 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-28 12:15:38,944 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-28 12:15:38,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:15:38,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:15:38,945 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 12:15:38,945 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 12:15:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:38,948 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-28 12:15:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-28 12:15:38,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:15:38,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:15:38,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:15:38,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:15:38,949 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 12:15:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-04-28 12:15:38,950 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 36 [2022-04-28 12:15:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:15:38,951 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-04-28 12:15:38,951 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 12:15:38,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 56 transitions. [2022-04-28 12:15:39,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:15:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-04-28 12:15:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 12:15:39,005 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:15:39,005 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 12:15:39,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 12:15:39,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:15:39,216 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:15:39,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:15:39,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 1 times [2022-04-28 12:15:39,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:15:39,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [720423340] [2022-04-28 12:15:39,217 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:15:39,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 2 times [2022-04-28 12:15:39,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:15:39,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723913437] [2022-04-28 12:15:39,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:15:39,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:15:39,238 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:15:39,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1853743358] [2022-04-28 12:15:39,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:15:39,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:15:39,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:15:39,244 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:15:39,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 12:15:39,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:15:39,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:15:39,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:15:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:15:39,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:15:39,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {1568#true} call ULTIMATE.init(); {1568#true} is VALID [2022-04-28 12:15:39,484 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 12:15:39,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:39,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#(<= ~counter~0 0)} {1568#true} #98#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:39,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#(<= ~counter~0 0)} call #t~ret8 := main(); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:39,485 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 12:15:39,486 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 12:15:39,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:39,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:39,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:39,491 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 12:15:39,491 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 12:15:39,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:39,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:39,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:39,493 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 12:15:39,493 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 12:15:39,493 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 12:15:39,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:39,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:39,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:39,495 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 12:15:39,495 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 12:15:39,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:39,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:39,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 12:15:39,497 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 12:15:39,497 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 12:15:39,498 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 12:15:39,498 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 12:15:39,498 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 12:15:39,499 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 12:15:39,499 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 12:15:39,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {1569#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1569#false} is VALID [2022-04-28 12:15:39,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {1569#false} assume !(#t~post6 < 10);havoc #t~post6; {1569#false} is VALID [2022-04-28 12:15:39,499 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 12:15:39,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {1569#false} ~cond := #in~cond; {1569#false} is VALID [2022-04-28 12:15:39,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {1569#false} assume 0 == ~cond; {1569#false} is VALID [2022-04-28 12:15:39,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {1569#false} assume !false; {1569#false} is VALID [2022-04-28 12:15:39,500 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 12:15:39,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:15:39,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:15:39,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723913437] [2022-04-28 12:15:39,500 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:15:39,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853743358] [2022-04-28 12:15:39,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853743358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:15:39,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:15:39,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:15:39,501 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:15:39,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [720423340] [2022-04-28 12:15:39,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [720423340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:15:39,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:15:39,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:15:39,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126273584] [2022-04-28 12:15:39,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:15:39,502 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 12:15:39,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:15:39,502 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 12:15:39,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:15:39,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:15:39,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:15:39,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:15:39,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:15:39,526 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 12:15:39,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:39,682 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-28 12:15:39,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:15:39,683 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 12:15:39,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:15:39,683 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 12:15:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-28 12:15:39,685 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 12:15:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-28 12:15:39,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-28 12:15:39,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:15:39,758 INFO L225 Difference]: With dead ends: 72 [2022-04-28 12:15:39,758 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 12:15:39,758 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 12:15:39,761 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 12:15:39,761 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 12:15:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 12:15:39,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 12:15:39,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:15:39,812 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 12:15:39,813 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 12:15:39,813 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 12:15:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:39,815 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-28 12:15:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-28 12:15:39,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:15:39,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:15:39,816 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 12:15:39,816 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 12:15:39,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:39,819 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-28 12:15:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-28 12:15:39,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:15:39,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:15:39,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:15:39,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:15:39,820 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 12:15:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-04-28 12:15:39,821 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 39 [2022-04-28 12:15:39,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:15:39,823 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-04-28 12:15:39,823 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 12:15:39,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 58 transitions. [2022-04-28 12:15:39,881 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 12:15:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-28 12:15:39,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 12:15:39,882 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:15:39,882 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 12:15:39,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 12:15:40,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:15:40,083 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:15:40,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:15:40,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 1 times [2022-04-28 12:15:40,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:15:40,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1298164312] [2022-04-28 12:15:40,084 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:15:40,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 2 times [2022-04-28 12:15:40,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:15:40,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351238366] [2022-04-28 12:15:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:15:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:15:40,097 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:15:40,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445687347] [2022-04-28 12:15:40,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:15:40,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:15:40,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:15:40,098 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:15:40,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 12:15:40,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:15:40,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:15:40,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 12:15:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:15:40,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:15:40,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2022-04-28 12:15:40,455 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 12:15:40,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 12:15:40,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #98#return; {2017#true} is VALID [2022-04-28 12:15:40,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret8 := main(); {2017#true} is VALID [2022-04-28 12:15:40,456 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 12:15:40,456 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 12:15:40,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 12:15:40,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 12:15:40,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 12:15:40,456 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2017#true} {2017#true} #78#return; {2017#true} is VALID [2022-04-28 12:15:40,456 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 12:15:40,457 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 12:15:40,461 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 12:15:40,462 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 12:15:40,462 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 12:15:40,463 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 12:15:40,463 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 12:15:40,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 12:15:40,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 12:15:40,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 12:15:40,465 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 12:15:40,465 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 12:15:40,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 12:15:40,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 12:15:40,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 12:15:40,466 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 12:15:40,466 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 12:15:40,467 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 12:15:40,467 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 12:15:40,468 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 12:15:40,468 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 12:15:40,468 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 12:15:40,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 12:15:40,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 12:15:40,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 12:15:40,469 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 12:15:40,470 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 12:15:40,471 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 12:15:40,471 INFO L290 TraceCheckUtils]: 39: Hoare triple {2141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2018#false} is VALID [2022-04-28 12:15:40,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2022-04-28 12:15:40,471 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 12:15:40,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:15:40,701 INFO L290 TraceCheckUtils]: 40: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2022-04-28 12:15:40,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {2141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2018#false} is VALID [2022-04-28 12:15:40,702 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 12:15:40,703 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 12:15:40,704 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 12:15:40,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 12:15:40,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 12:15:40,705 INFO L290 TraceCheckUtils]: 33: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 12:15:40,705 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 12:15:40,705 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 12:15:40,706 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 12:15:40,706 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 12:15:40,707 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 12:15:40,707 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 12:15:40,708 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 12:15:40,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 12:15:40,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 12:15:40,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 12:15:40,708 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 12:15:40,709 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 12:15:40,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 12:15:40,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 12:15:40,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 12:15:40,710 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 12:15:40,710 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 12:15:40,710 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2017#true} {2017#true} #80#return; {2017#true} is VALID [2022-04-28 12:15:40,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 12:15:40,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 12:15:40,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 12:15:40,711 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 12:15:40,711 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2017#true} {2017#true} #78#return; {2017#true} is VALID [2022-04-28 12:15:40,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 12:15:40,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 12:15:40,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 12:15:40,711 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 12:15:40,711 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 12:15:40,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret8 := main(); {2017#true} is VALID [2022-04-28 12:15:40,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #98#return; {2017#true} is VALID [2022-04-28 12:15:40,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 12:15:40,712 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 12:15:40,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2022-04-28 12:15:40,712 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 12:15:40,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:15:40,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351238366] [2022-04-28 12:15:40,713 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:15:40,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445687347] [2022-04-28 12:15:40,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445687347] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 12:15:40,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:15:40,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-28 12:15:40,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:15:40,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1298164312] [2022-04-28 12:15:40,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1298164312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:15:40,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:15:40,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:15:40,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339897538] [2022-04-28 12:15:40,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:15:40,714 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 12:15:40,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:15:40,715 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 12:15:40,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:15:40,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:15:40,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:15:40,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:15:40,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:15:40,741 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 12:15:41,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:41,002 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2022-04-28 12:15:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:15:41,003 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 12:15:41,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:15:41,003 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 12:15:41,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 12:15:41,004 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 12:15:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 12:15:41,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 12:15:41,062 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 12:15:41,064 INFO L225 Difference]: With dead ends: 61 [2022-04-28 12:15:41,064 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 12:15:41,064 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 12:15:41,065 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 12:15:41,065 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 12:15:41,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 12:15:41,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-28 12:15:41,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:15:41,113 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 12:15:41,113 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 12:15:41,113 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 12:15:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:41,116 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-28 12:15:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-28 12:15:41,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:15:41,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:15:41,117 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 12:15:41,117 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 12:15:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:41,119 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-28 12:15:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-28 12:15:41,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:15:41,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:15:41,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:15:41,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:15:41,120 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 12:15:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-04-28 12:15:41,122 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 41 [2022-04-28 12:15:41,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:15:41,122 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-04-28 12:15:41,123 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 12:15:41,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 76 transitions. [2022-04-28 12:15:41,203 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 12:15:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-28 12:15:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 12:15:41,204 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:15:41,204 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 12:15:41,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 12:15:41,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:15:41,407 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:15:41,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:15:41,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 1 times [2022-04-28 12:15:41,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:15:41,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1802517709] [2022-04-28 12:15:41,408 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:15:41,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 2 times [2022-04-28 12:15:41,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:15:41,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035396284] [2022-04-28 12:15:41,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:15:41,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:15:41,422 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:15:41,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682005908] [2022-04-28 12:15:41,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:15:41,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:15:41,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:15:41,423 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:15:41,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 12:15:41,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:15:41,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:15:41,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 12:15:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:15:41,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:15:41,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {2629#true} call ULTIMATE.init(); {2629#true} is VALID [2022-04-28 12:15:41,783 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 12:15:41,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 12:15:41,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #98#return; {2629#true} is VALID [2022-04-28 12:15:41,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {2629#true} call #t~ret8 := main(); {2629#true} is VALID [2022-04-28 12:15:41,783 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 12:15:41,783 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 12:15:41,784 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 12:15:41,784 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 12:15:41,784 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 12:15:41,785 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 12:15:41,785 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 12:15:41,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 12:15:41,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 12:15:41,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 12:15:41,786 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 12:15:41,786 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 12:15:41,786 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 12:15:41,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 12:15:41,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 12:15:41,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 12:15:41,787 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 12:15:41,787 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 12:15:41,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 12:15:41,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 12:15:41,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 12:15:41,788 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 12:15:41,789 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 12:15:41,789 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 12:15:41,790 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 12:15:41,790 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 12:15:41,790 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 12:15:41,791 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 12:15:41,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 12:15:41,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 12:15:41,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 12:15:41,792 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 12:15:41,792 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 12:15:41,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 12:15:41,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 12:15:41,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 12:15:41,793 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 12:15:41,793 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 12:15:41,794 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 12:15:41,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {2768#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2630#false} is VALID [2022-04-28 12:15:41,794 INFO L290 TraceCheckUtils]: 45: Hoare triple {2630#false} assume !false; {2630#false} is VALID [2022-04-28 12:15:41,795 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 12:15:41,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:15:42,036 INFO L290 TraceCheckUtils]: 45: Hoare triple {2630#false} assume !false; {2630#false} is VALID [2022-04-28 12:15:42,036 INFO L290 TraceCheckUtils]: 44: Hoare triple {2768#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2630#false} is VALID [2022-04-28 12:15:42,037 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 12:15:42,037 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 12:15:42,038 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 12:15:42,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 12:15:42,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 12:15:42,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 12:15:42,038 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 12:15:42,039 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 12:15:42,039 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 12:15:42,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 12:15:42,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 12:15:42,040 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 12:15:42,041 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 12:15:42,042 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 12:15:42,044 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 12:15:42,045 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 12:15:42,047 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 12:15:42,049 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 12:15:42,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 12:15:42,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 12:15:42,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 12:15:42,050 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 12:15:42,050 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 12:15:42,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 12:15:42,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 12:15:42,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 12:15:42,051 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 12:15:42,051 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 12:15:42,051 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2629#true} {2629#true} #80#return; {2629#true} is VALID [2022-04-28 12:15:42,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 12:15:42,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 12:15:42,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 12:15:42,052 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 12:15:42,052 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2629#true} {2629#true} #78#return; {2629#true} is VALID [2022-04-28 12:15:42,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 12:15:42,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 12:15:42,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 12:15:42,052 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 12:15:42,052 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 12:15:42,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {2629#true} call #t~ret8 := main(); {2629#true} is VALID [2022-04-28 12:15:42,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #98#return; {2629#true} is VALID [2022-04-28 12:15:42,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 12:15:42,053 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 12:15:42,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {2629#true} call ULTIMATE.init(); {2629#true} is VALID [2022-04-28 12:15:42,054 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 12:15:42,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:15:42,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035396284] [2022-04-28 12:15:42,054 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:15:42,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682005908] [2022-04-28 12:15:42,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682005908] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 12:15:42,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:15:42,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-28 12:15:42,055 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:15:42,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1802517709] [2022-04-28 12:15:42,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1802517709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:15:42,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:15:42,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:15:42,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965853713] [2022-04-28 12:15:42,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:15:42,056 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 12:15:42,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:15:42,057 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 12:15:42,082 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 12:15:42,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:15:42,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:15:42,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:15:42,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:15:42,083 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 12:15:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:42,327 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2022-04-28 12:15:42,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:15:42,327 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 12:15:42,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:15:42,327 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 12:15:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 12:15:42,329 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 12:15:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 12:15:42,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 12:15:42,388 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 12:15:42,389 INFO L225 Difference]: With dead ends: 65 [2022-04-28 12:15:42,389 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 12:15:42,390 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 12:15:42,390 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 12:15:42,390 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 12:15:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 12:15:42,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-28 12:15:42,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:15:42,451 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 12:15:42,451 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 12:15:42,452 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 12:15:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:42,455 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-28 12:15:42,455 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-28 12:15:42,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:15:42,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:15:42,456 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 12:15:42,457 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 12:15:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:15:42,460 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-28 12:15:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-28 12:15:42,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:15:42,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:15:42,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:15:42,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:15:42,462 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 12:15:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-04-28 12:15:42,466 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 46 [2022-04-28 12:15:42,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:15:42,466 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-04-28 12:15:42,466 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 12:15:42,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 79 transitions. [2022-04-28 12:15:42,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:15:42,556 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-04-28 12:15:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 12:15:42,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:15:42,556 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 12:15:42,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 12:15:42,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:15:42,757 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:15:42,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:15:42,757 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 1 times [2022-04-28 12:15:42,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:15:42,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1054993451] [2022-04-28 12:15:42,758 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:15:42,758 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 2 times [2022-04-28 12:15:42,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:15:42,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314741540] [2022-04-28 12:15:42,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:15:42,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:15:42,773 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:15:42,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1183333089] [2022-04-28 12:15:42,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:15:42,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:15:42,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:15:42,774 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:15:42,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 12:15:42,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:15:42,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:15:42,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 12:15:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:15:42,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:15:51,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {3295#true} call ULTIMATE.init(); {3295#true} is VALID [2022-04-28 12:15:51,194 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 12:15:51,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 12:15:51,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3295#true} {3295#true} #98#return; {3295#true} is VALID [2022-04-28 12:15:51,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {3295#true} call #t~ret8 := main(); {3295#true} is VALID [2022-04-28 12:15:51,194 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 12:15:51,194 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 12:15:51,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-28 12:15:51,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-28 12:15:51,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 12:15:51,194 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3295#true} {3295#true} #78#return; {3295#true} is VALID [2022-04-28 12:15:51,194 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 12:15:51,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-28 12:15:51,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-28 12:15:51,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 12:15:51,195 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3295#true} {3295#true} #80#return; {3295#true} is VALID [2022-04-28 12:15:51,195 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 12:15:51,196 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 12:15:51,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-28 12:15:51,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-28 12:15:51,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 12:15:51,197 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 12:15:51,197 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 12:15:51,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-28 12:15:51,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-28 12:15:51,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 12:15:51,198 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 12:15:51,198 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 12:15:51,199 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 12:15:51,199 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 12:15:51,200 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 12:15:51,200 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 12:15:51,200 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 12:15:51,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-28 12:15:51,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-28 12:15:51,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 12:15:51,201 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 12:15:51,201 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 12:15:51,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {3295#true} ~cond := #in~cond; {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:15:51,202 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 12:15:51,203 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 12:15:51,203 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 12:15:51,204 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 12:15:51,204 INFO L290 TraceCheckUtils]: 43: Hoare triple {3295#true} ~cond := #in~cond; {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:15:51,204 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 12:15:51,205 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 12:15:51,205 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 12:15:51,207 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 12:15:51,207 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 12:15:51,207 INFO L290 TraceCheckUtils]: 49: Hoare triple {3448#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3296#false} is VALID [2022-04-28 12:15:51,208 INFO L290 TraceCheckUtils]: 50: Hoare triple {3296#false} assume !false; {3296#false} is VALID [2022-04-28 12:15:51,208 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 12:15:51,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:16:50,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:16:50,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314741540] [2022-04-28 12:16:50,432 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:16:50,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183333089] [2022-04-28 12:16:50,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183333089] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 12:16:50,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:16:50,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 12:16:50,433 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:16:50,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1054993451] [2022-04-28 12:16:50,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1054993451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:16:50,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:16:50,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:16:50,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552605053] [2022-04-28 12:16:50,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:16:50,434 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 12:16:50,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:16:50,435 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 12:16:50,476 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 12:16:50,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:16:50,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:16:50,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:16:50,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:16:50,477 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 12:16:50,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:16:50,940 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-04-28 12:16:50,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 12:16:50,941 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 12:16:50,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:16:50,941 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 12:16:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-28 12:16:50,943 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 12:16:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-28 12:16:50,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-28 12:16:51,009 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 12:16:51,010 INFO L225 Difference]: With dead ends: 69 [2022-04-28 12:16:51,010 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 12:16:51,011 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 12:16:51,011 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 12:16:51,012 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 12:16:51,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 12:16:51,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-28 12:16:51,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:16:51,077 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 12:16:51,077 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 12:16:51,077 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 12:16:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:16:51,081 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-28 12:16:51,081 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-04-28 12:16:51,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:16:51,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:16:51,089 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 12:16:51,091 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 12:16:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:16:51,095 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-28 12:16:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-04-28 12:16:51,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:16:51,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:16:51,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:16:51,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:16:51,096 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 12:16:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2022-04-28 12:16:51,099 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 51 [2022-04-28 12:16:51,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:16:51,099 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2022-04-28 12:16:51,099 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 12:16:51,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 82 transitions. [2022-04-28 12:16:51,203 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 12:16:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2022-04-28 12:16:51,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 12:16:51,204 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:16:51,204 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 12:16:51,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 12:16:51,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:16:51,405 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:16:51,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:16:51,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2044027516, now seen corresponding path program 1 times [2022-04-28 12:16:51,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:16:51,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1346952535] [2022-04-28 12:16:51,406 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:16:51,406 INFO L85 PathProgramCache]: Analyzing trace with hash -2044027516, now seen corresponding path program 2 times [2022-04-28 12:16:51,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:16:51,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140264910] [2022-04-28 12:16:51,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:16:51,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:16:51,419 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:16:51,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2097799714] [2022-04-28 12:16:51,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:16:51,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:16:51,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:16:51,421 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:16:51,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 12:16:51,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:16:51,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:16:51,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 12:16:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:16:51,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:16:51,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {3879#true} call ULTIMATE.init(); {3879#true} is VALID [2022-04-28 12:16:51,708 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 12:16:51,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:16:51,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3879#true} {3879#true} #98#return; {3879#true} is VALID [2022-04-28 12:16:51,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {3879#true} call #t~ret8 := main(); {3879#true} is VALID [2022-04-28 12:16:51,708 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 12:16:51,708 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 12:16:51,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 12:16:51,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 12:16:51,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:16:51,709 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3879#true} {3879#true} #78#return; {3879#true} is VALID [2022-04-28 12:16:51,709 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 12:16:51,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 12:16:51,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 12:16:51,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:16:51,709 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3879#true} {3879#true} #80#return; {3879#true} is VALID [2022-04-28 12:16:51,709 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 12:16:51,709 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 12:16:51,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 12:16:51,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 12:16:51,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:16:51,710 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3879#true} {3879#true} #82#return; {3879#true} is VALID [2022-04-28 12:16:51,710 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 12:16:51,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 12:16:51,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 12:16:51,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:16:51,710 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3879#true} {3879#true} #84#return; {3879#true} is VALID [2022-04-28 12:16:51,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3879#true} is VALID [2022-04-28 12:16:51,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#true} assume !!(#t~post6 < 10);havoc #t~post6; {3879#true} is VALID [2022-04-28 12:16:51,711 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 12:16:51,711 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 12:16:51,712 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 12:16:51,712 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 12:16:51,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 12:16:51,712 INFO L290 TraceCheckUtils]: 34: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 12:16:51,712 INFO L290 TraceCheckUtils]: 35: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:16:51,713 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 12:16:51,713 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 12:16:51,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 12:16:51,713 INFO L290 TraceCheckUtils]: 39: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 12:16:51,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:16:51,714 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 12:16:51,714 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 12:16:51,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 12:16:51,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 12:16:51,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:16:51,715 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 12:16:51,715 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 12:16:51,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 12:16:51,715 INFO L290 TraceCheckUtils]: 49: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 12:16:51,715 INFO L290 TraceCheckUtils]: 50: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:16:51,716 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 12:16:51,717 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 12:16:51,717 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 12:16:51,718 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 12:16:51,719 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 12:16:51,719 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 12:16:51,719 INFO L290 TraceCheckUtils]: 57: Hoare triple {4055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3880#false} is VALID [2022-04-28 12:16:51,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {3880#false} assume !false; {3880#false} is VALID [2022-04-28 12:16:51,720 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 12:16:51,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:17:09,355 INFO L290 TraceCheckUtils]: 58: Hoare triple {3880#false} assume !false; {3880#false} is VALID [2022-04-28 12:17:09,356 INFO L290 TraceCheckUtils]: 57: Hoare triple {4055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3880#false} is VALID [2022-04-28 12:17:09,356 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 12:17:09,357 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 12:17:09,357 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 12:17:09,358 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 12:17:09,358 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 12:17:09,359 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 12:17:09,359 INFO L290 TraceCheckUtils]: 50: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:17:09,359 INFO L290 TraceCheckUtils]: 49: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 12:17:09,359 INFO L290 TraceCheckUtils]: 48: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 12:17:09,359 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 12:17:09,360 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 12:17:09,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:17:09,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 12:17:09,360 INFO L290 TraceCheckUtils]: 43: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 12:17:09,360 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 12:17:09,361 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 12:17:09,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:17:09,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 12:17:09,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 12:17:09,361 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 12:17:09,362 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 12:17:09,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:17:09,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 12:17:09,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 12:17:09,362 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 12:17:09,362 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 12:17:09,363 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 12:17:09,363 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 12:17:09,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#true} assume !!(#t~post6 < 10);havoc #t~post6; {3879#true} is VALID [2022-04-28 12:17:09,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3879#true} is VALID [2022-04-28 12:17:09,363 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3879#true} {3879#true} #84#return; {3879#true} is VALID [2022-04-28 12:17:09,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:17:09,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 12:17:09,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 12:17:09,363 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 12:17:09,363 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3879#true} {3879#true} #82#return; {3879#true} is VALID [2022-04-28 12:17:09,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:17:09,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 12:17:09,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 12:17:09,364 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 12:17:09,364 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 12:17:09,364 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3879#true} {3879#true} #80#return; {3879#true} is VALID [2022-04-28 12:17:09,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:17:09,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 12:17:09,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 12:17:09,364 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 12:17:09,364 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3879#true} {3879#true} #78#return; {3879#true} is VALID [2022-04-28 12:17:09,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:17:09,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 12:17:09,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 12:17:09,364 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 12:17:09,364 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 12:17:09,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {3879#true} call #t~ret8 := main(); {3879#true} is VALID [2022-04-28 12:17:09,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3879#true} {3879#true} #98#return; {3879#true} is VALID [2022-04-28 12:17:09,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 12:17:09,365 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 12:17:09,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {3879#true} call ULTIMATE.init(); {3879#true} is VALID [2022-04-28 12:17:09,365 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 12:17:09,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:17:09,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140264910] [2022-04-28 12:17:09,365 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:17:09,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097799714] [2022-04-28 12:17:09,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097799714] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:17:09,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:17:09,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-28 12:17:09,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:17:09,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1346952535] [2022-04-28 12:17:09,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1346952535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:17:09,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:17:09,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:17:09,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139836305] [2022-04-28 12:17:09,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:17:09,366 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 12:17:09,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:17:09,367 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 12:17:09,398 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 12:17:09,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:17:09,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:17:09,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:17:09,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 12:17:09,399 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 12:17:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:09,777 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2022-04-28 12:17:09,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:17:09,777 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 12:17:09,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:17:09,781 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 12:17:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-28 12:17:09,783 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 12:17:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-28 12:17:09,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-28 12:17:09,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:17:09,858 INFO L225 Difference]: With dead ends: 96 [2022-04-28 12:17:09,858 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 12:17:09,860 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 12:17:09,862 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 12:17:09,862 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 12:17:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 12:17:09,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2022-04-28 12:17:09,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:17:09,953 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 12:17:09,953 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 12:17:09,953 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 12:17:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:09,957 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2022-04-28 12:17:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2022-04-28 12:17:09,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:17:09,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:17:09,958 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 12:17:09,958 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 12:17:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:09,962 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2022-04-28 12:17:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2022-04-28 12:17:09,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:17:09,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:17:09,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:17:09,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:17:09,963 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 12:17:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2022-04-28 12:17:09,967 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 59 [2022-04-28 12:17:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:17:09,967 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2022-04-28 12:17:09,967 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 12:17:09,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 111 transitions. [2022-04-28 12:17:10,109 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 12:17:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2022-04-28 12:17:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 12:17:10,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:17:10,110 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 12:17:10,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 12:17:10,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 12:17:10,311 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:17:10,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:17:10,312 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 1 times [2022-04-28 12:17:10,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:17:10,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2013017199] [2022-04-28 12:17:10,313 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:17:10,313 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 2 times [2022-04-28 12:17:10,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:17:10,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811332778] [2022-04-28 12:17:10,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:17:10,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:17:10,338 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:17:10,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [924214391] [2022-04-28 12:17:10,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:17:10,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:17:10,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:17:10,340 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:17:10,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 12:17:10,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:17:10,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:17:10,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:17:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:17:10,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:17:10,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {4789#true} call ULTIMATE.init(); {4789#true} is VALID [2022-04-28 12:17:10,649 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 12:17:10,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:10,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4797#(<= ~counter~0 0)} {4789#true} #98#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:10,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {4797#(<= ~counter~0 0)} call #t~ret8 := main(); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:10,650 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 12:17:10,651 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 12:17:10,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:10,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:10,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:10,652 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 12:17:10,652 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 12:17:10,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:10,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:10,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:10,654 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 12:17:10,655 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 12:17:10,655 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 12:17:10,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:10,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:10,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:10,656 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 12:17:10,657 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 12:17:10,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:10,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:10,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:10,658 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 12:17:10,658 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 12:17:10,659 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 12:17:10,659 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 12:17:10,659 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 12:17:10,660 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 12:17:10,660 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 12:17:10,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:10,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:10,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:10,661 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 12:17:10,662 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 12:17:10,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:10,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:10,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:10,663 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 12:17:10,664 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 12:17:10,664 INFO L290 TraceCheckUtils]: 43: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:10,664 INFO L290 TraceCheckUtils]: 44: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:10,665 INFO L290 TraceCheckUtils]: 45: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:10,665 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 12:17:10,666 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 12:17:10,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:10,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:10,666 INFO L290 TraceCheckUtils]: 50: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:10,667 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 12:17:10,667 INFO L290 TraceCheckUtils]: 52: Hoare triple {4886#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:10,668 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 12:17:10,668 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 12:17:10,668 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 12:17:10,668 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 12:17:10,669 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#false} ~cond := #in~cond; {4790#false} is VALID [2022-04-28 12:17:10,669 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#false} assume 0 == ~cond; {4790#false} is VALID [2022-04-28 12:17:10,669 INFO L290 TraceCheckUtils]: 59: Hoare triple {4790#false} assume !false; {4790#false} is VALID [2022-04-28 12:17:10,669 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 12:17:10,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:17:10,929 INFO L290 TraceCheckUtils]: 59: Hoare triple {4790#false} assume !false; {4790#false} is VALID [2022-04-28 12:17:10,929 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#false} assume 0 == ~cond; {4790#false} is VALID [2022-04-28 12:17:10,929 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#false} ~cond := #in~cond; {4790#false} is VALID [2022-04-28 12:17:10,929 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 12:17:10,930 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 12:17:10,930 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 12:17:10,930 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 12:17:10,931 INFO L290 TraceCheckUtils]: 52: Hoare triple {4991#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {4991#(< ~counter~0 10)} is VALID [2022-04-28 12:17:10,932 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4789#true} {4991#(< ~counter~0 10)} #92#return; {4991#(< ~counter~0 10)} is VALID [2022-04-28 12:17:10,932 INFO L290 TraceCheckUtils]: 50: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 12:17:10,932 INFO L290 TraceCheckUtils]: 49: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 12:17:10,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 12:17:10,932 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 12:17:10,933 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4789#true} {4991#(< ~counter~0 10)} #90#return; {4991#(< ~counter~0 10)} is VALID [2022-04-28 12:17:10,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 12:17:10,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 12:17:10,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 12:17:10,933 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 12:17:10,934 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4789#true} {4991#(< ~counter~0 10)} #88#return; {4991#(< ~counter~0 10)} is VALID [2022-04-28 12:17:10,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 12:17:10,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 12:17:10,934 INFO L290 TraceCheckUtils]: 38: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 12:17:10,934 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 12:17:10,934 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4789#true} {4991#(< ~counter~0 10)} #86#return; {4991#(< ~counter~0 10)} is VALID [2022-04-28 12:17:10,934 INFO L290 TraceCheckUtils]: 35: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 12:17:10,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 12:17:10,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 12:17:10,935 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 12:17:10,935 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 12:17:10,935 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 12:17:10,936 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 12:17:10,936 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 12:17:10,936 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 12:17:10,937 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4789#true} {5074#(< ~counter~0 8)} #84#return; {5074#(< ~counter~0 8)} is VALID [2022-04-28 12:17:10,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 12:17:10,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 12:17:10,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 12:17:10,937 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 12:17:10,937 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4789#true} {5074#(< ~counter~0 8)} #82#return; {5074#(< ~counter~0 8)} is VALID [2022-04-28 12:17:10,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 12:17:10,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 12:17:10,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 12:17:10,938 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 12:17:10,938 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 12:17:10,938 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4789#true} {5074#(< ~counter~0 8)} #80#return; {5074#(< ~counter~0 8)} is VALID [2022-04-28 12:17:10,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 12:17:10,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 12:17:10,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 12:17:10,939 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 12:17:10,939 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4789#true} {5074#(< ~counter~0 8)} #78#return; {5074#(< ~counter~0 8)} is VALID [2022-04-28 12:17:10,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 12:17:10,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 12:17:10,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 12:17:10,939 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 12:17:10,939 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 12:17:10,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {5074#(< ~counter~0 8)} call #t~ret8 := main(); {5074#(< ~counter~0 8)} is VALID [2022-04-28 12:17:10,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5074#(< ~counter~0 8)} {4789#true} #98#return; {5074#(< ~counter~0 8)} is VALID [2022-04-28 12:17:10,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {5074#(< ~counter~0 8)} assume true; {5074#(< ~counter~0 8)} is VALID [2022-04-28 12:17:10,941 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 12:17:10,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {4789#true} call ULTIMATE.init(); {4789#true} is VALID [2022-04-28 12:17:10,941 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 12:17:10,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:17:10,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811332778] [2022-04-28 12:17:10,941 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:17:10,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924214391] [2022-04-28 12:17:10,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924214391] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:17:10,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:17:10,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 12:17:10,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:17:10,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2013017199] [2022-04-28 12:17:10,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2013017199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:17:10,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:17:10,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:17:10,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300058255] [2022-04-28 12:17:10,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:17:10,943 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 12:17:10,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:17:10,943 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 12:17:10,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:17:10,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:17:10,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:17:10,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:17:10,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:17:10,980 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 12:17:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:11,223 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2022-04-28 12:17:11,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 12:17:11,223 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 12:17:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:17:11,228 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 12:17:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 12:17:11,230 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 12:17:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 12:17:11,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 12:17:11,293 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 12:17:11,295 INFO L225 Difference]: With dead ends: 111 [2022-04-28 12:17:11,295 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 12:17:11,296 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 12:17:11,296 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 12:17:11,297 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 12:17:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 12:17:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-28 12:17:11,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:17:11,394 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 12:17:11,394 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 12:17:11,395 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 12:17:11,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:11,418 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-28 12:17:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-28 12:17:11,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:17:11,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:17:11,420 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 12:17:11,420 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 12:17:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:11,424 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-28 12:17:11,424 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-28 12:17:11,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:17:11,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:17:11,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:17:11,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:17:11,425 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 12:17:11,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2022-04-28 12:17:11,428 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 60 [2022-04-28 12:17:11,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:17:11,429 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2022-04-28 12:17:11,429 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 12:17:11,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 126 transitions. [2022-04-28 12:17:11,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:17:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-28 12:17:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 12:17:11,572 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:17:11,572 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 12:17:11,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 12:17:11,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 12:17:11,776 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:17:11,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:17:11,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 1 times [2022-04-28 12:17:11,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:17:11,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [96492783] [2022-04-28 12:17:11,777 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:17:11,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 2 times [2022-04-28 12:17:11,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:17:11,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688853534] [2022-04-28 12:17:11,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:17:11,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:17:11,791 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:17:11,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [867569618] [2022-04-28 12:17:11,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:17:11,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:17:11,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:17:11,792 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:17:11,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 12:17:11,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:17:11,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:17:11,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:17:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:17:11,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:17:12,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {5794#true} call ULTIMATE.init(); {5794#true} is VALID [2022-04-28 12:17:12,056 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 12:17:12,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 12:17:12,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5794#true} {5794#true} #98#return; {5794#true} is VALID [2022-04-28 12:17:12,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {5794#true} call #t~ret8 := main(); {5794#true} is VALID [2022-04-28 12:17:12,056 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 12:17:12,056 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 12:17:12,057 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 12:17:12,057 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 12:17:12,057 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 12:17:12,058 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 12:17:12,058 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 12:17:12,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 12:17:12,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 12:17:12,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 12:17:12,059 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 12:17:12,060 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 12:17:12,060 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 12:17:12,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 12:17:12,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 12:17:12,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 12:17:12,061 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 12:17:12,061 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 12:17:12,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 12:17:12,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 12:17:12,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 12:17:12,062 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 12:17:12,062 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 12:17:12,062 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 12:17:12,063 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 12:17:12,063 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 12:17:12,063 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 12:17:12,063 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 12:17:12,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 12:17:12,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 12:17:12,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 12:17:12,064 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 12:17:12,064 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 12:17:12,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 12:17:12,065 INFO L290 TraceCheckUtils]: 39: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 12:17:12,065 INFO L290 TraceCheckUtils]: 40: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 12:17:12,065 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 12:17:12,065 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 12:17:12,065 INFO L290 TraceCheckUtils]: 43: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 12:17:12,066 INFO L290 TraceCheckUtils]: 44: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 12:17:12,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 12:17:12,066 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 12:17:12,066 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 12:17:12,067 INFO L290 TraceCheckUtils]: 48: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 12:17:12,067 INFO L290 TraceCheckUtils]: 49: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 12:17:12,067 INFO L290 TraceCheckUtils]: 50: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 12:17:12,067 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 12:17:12,068 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 12:17:12,068 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 12:17:12,069 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 12:17:12,069 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 12:17:12,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {5963#(<= 1 main_~b~0)} assume !(0 != ~b~0); {5795#false} is VALID [2022-04-28 12:17:12,069 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 12:17:12,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {5795#false} ~cond := #in~cond; {5795#false} is VALID [2022-04-28 12:17:12,070 INFO L290 TraceCheckUtils]: 59: Hoare triple {5795#false} assume 0 == ~cond; {5795#false} is VALID [2022-04-28 12:17:12,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {5795#false} assume !false; {5795#false} is VALID [2022-04-28 12:17:12,070 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 12:17:12,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:17:12,350 INFO L290 TraceCheckUtils]: 60: Hoare triple {5795#false} assume !false; {5795#false} is VALID [2022-04-28 12:17:12,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {5795#false} assume 0 == ~cond; {5795#false} is VALID [2022-04-28 12:17:12,351 INFO L290 TraceCheckUtils]: 58: Hoare triple {5795#false} ~cond := #in~cond; {5795#false} is VALID [2022-04-28 12:17:12,351 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 12:17:12,351 INFO L290 TraceCheckUtils]: 56: Hoare triple {5963#(<= 1 main_~b~0)} assume !(0 != ~b~0); {5795#false} is VALID [2022-04-28 12:17:12,352 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 12:17:12,352 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 12:17:12,352 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 12:17:12,353 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 12:17:12,354 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 12:17:12,354 INFO L290 TraceCheckUtils]: 50: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 12:17:12,354 INFO L290 TraceCheckUtils]: 49: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 12:17:12,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 12:17:12,354 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 12:17:12,355 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 12:17:12,355 INFO L290 TraceCheckUtils]: 45: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 12:17:12,355 INFO L290 TraceCheckUtils]: 44: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 12:17:12,355 INFO L290 TraceCheckUtils]: 43: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 12:17:12,355 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 12:17:12,356 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 12:17:12,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 12:17:12,356 INFO L290 TraceCheckUtils]: 39: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 12:17:12,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 12:17:12,356 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 12:17:12,357 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 12:17:12,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 12:17:12,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 12:17:12,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 12:17:12,357 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 12:17:12,357 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 12:17:12,358 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 12:17:12,358 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 12:17:12,358 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 12:17:12,359 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 12:17:12,359 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 12:17:12,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 12:17:12,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 12:17:12,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 12:17:12,360 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 12:17:12,360 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 12:17:12,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 12:17:12,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 12:17:12,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 12:17:12,365 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 12:17:12,365 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 12:17:12,366 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 12:17:12,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 12:17:12,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-28 12:17:12,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-28 12:17:12,366 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 12:17:12,367 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 12:17:12,368 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 12:17:12,368 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 12:17:12,369 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 12:17:12,369 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 12:17:12,369 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 12:17:12,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {5794#true} call #t~ret8 := main(); {5794#true} is VALID [2022-04-28 12:17:12,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5794#true} {5794#true} #98#return; {5794#true} is VALID [2022-04-28 12:17:12,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-28 12:17:12,369 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 12:17:12,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {5794#true} call ULTIMATE.init(); {5794#true} is VALID [2022-04-28 12:17:12,370 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 12:17:12,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:17:12,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688853534] [2022-04-28 12:17:12,370 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:17:12,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867569618] [2022-04-28 12:17:12,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867569618] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:17:12,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:17:12,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 12:17:12,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:17:12,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [96492783] [2022-04-28 12:17:12,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [96492783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:17:12,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:17:12,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:17:12,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557591737] [2022-04-28 12:17:12,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:17:12,371 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 12:17:12,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:17:12,372 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 12:17:12,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:17:12,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:17:12,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:17:12,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:17:12,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:17:12,413 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 12:17:13,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:13,378 INFO L93 Difference]: Finished difference Result 182 states and 256 transitions. [2022-04-28 12:17:13,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 12:17:13,378 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 12:17:13,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:17:13,379 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 12:17:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-28 12:17:13,382 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 12:17:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-28 12:17:13,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 147 transitions. [2022-04-28 12:17:13,505 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 12:17:13,509 INFO L225 Difference]: With dead ends: 182 [2022-04-28 12:17:13,510 INFO L226 Difference]: Without dead ends: 174 [2022-04-28 12:17:13,510 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 12:17:13,511 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 12:17:13,511 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 12:17:13,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-28 12:17:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 146. [2022-04-28 12:17:13,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:17:13,725 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 12:17:13,726 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 12:17:13,726 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 12:17:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:13,732 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2022-04-28 12:17:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2022-04-28 12:17:13,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:17:13,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:17:13,734 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 12:17:13,734 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 12:17:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:13,740 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2022-04-28 12:17:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2022-04-28 12:17:13,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:17:13,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:17:13,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:17:13,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:17:13,742 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 12:17:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2022-04-28 12:17:13,746 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 61 [2022-04-28 12:17:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:17:13,747 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2022-04-28 12:17:13,747 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 12:17:13,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 199 transitions. [2022-04-28 12:17:13,990 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 12:17:13,991 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2022-04-28 12:17:13,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 12:17:13,991 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:17:13,992 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 12:17:14,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 12:17:14,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 12:17:14,196 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:17:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:17:14,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1537891564, now seen corresponding path program 1 times [2022-04-28 12:17:14,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:17:14,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [206715755] [2022-04-28 12:17:14,198 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:17:14,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1537891564, now seen corresponding path program 2 times [2022-04-28 12:17:14,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:17:14,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181744464] [2022-04-28 12:17:14,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:17:14,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:17:14,212 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:17:14,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1193847907] [2022-04-28 12:17:14,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:17:14,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:17:14,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:17:14,222 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:17:14,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 12:17:14,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:17:14,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:17:14,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:17:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:17:14,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:17:14,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {7186#true} call ULTIMATE.init(); {7186#true} is VALID [2022-04-28 12:17:14,543 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 12:17:14,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:14,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7194#(<= ~counter~0 0)} {7186#true} #98#return; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:14,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {7194#(<= ~counter~0 0)} call #t~ret8 := main(); {7194#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:14,545 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 12:17:14,545 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 12:17:14,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {7194#(<= ~counter~0 0)} ~cond := #in~cond; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:14,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {7194#(<= ~counter~0 0)} assume !(0 == ~cond); {7194#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:14,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:14,546 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 12:17:14,547 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 12:17:14,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {7194#(<= ~counter~0 0)} ~cond := #in~cond; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:14,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {7194#(<= ~counter~0 0)} assume !(0 == ~cond); {7194#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:14,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:14,548 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 12:17:14,548 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 12:17:14,549 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 12:17:14,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {7194#(<= ~counter~0 0)} ~cond := #in~cond; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:14,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {7194#(<= ~counter~0 0)} assume !(0 == ~cond); {7194#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:14,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:14,550 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 12:17:14,550 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 12:17:14,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {7194#(<= ~counter~0 0)} ~cond := #in~cond; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:14,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {7194#(<= ~counter~0 0)} assume !(0 == ~cond); {7194#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:14,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:14,551 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 12:17:14,552 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 12:17:14,552 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 12:17:14,552 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 12:17:14,553 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 12:17:14,553 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 12:17:14,554 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 12:17:14,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {7283#(<= ~counter~0 2)} ~cond := #in~cond; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:14,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {7283#(<= ~counter~0 2)} assume !(0 == ~cond); {7283#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:14,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {7283#(<= ~counter~0 2)} assume true; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:14,555 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 12:17:14,555 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 12:17:14,556 INFO L290 TraceCheckUtils]: 38: Hoare triple {7283#(<= ~counter~0 2)} ~cond := #in~cond; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:14,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {7283#(<= ~counter~0 2)} assume !(0 == ~cond); {7283#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:14,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {7283#(<= ~counter~0 2)} assume true; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:14,557 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 12:17:14,557 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 12:17:14,558 INFO L290 TraceCheckUtils]: 43: Hoare triple {7283#(<= ~counter~0 2)} ~cond := #in~cond; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:14,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {7283#(<= ~counter~0 2)} assume !(0 == ~cond); {7283#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:14,558 INFO L290 TraceCheckUtils]: 45: Hoare triple {7283#(<= ~counter~0 2)} assume true; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:14,559 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 12:17:14,559 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 12:17:14,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {7283#(<= ~counter~0 2)} ~cond := #in~cond; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:14,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {7283#(<= ~counter~0 2)} assume !(0 == ~cond); {7283#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:14,560 INFO L290 TraceCheckUtils]: 50: Hoare triple {7283#(<= ~counter~0 2)} assume true; {7283#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:14,561 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 12:17:14,561 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 12:17:14,561 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 12:17:14,562 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 12:17:14,562 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 12:17:14,562 INFO L290 TraceCheckUtils]: 56: Hoare triple {7187#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7187#false} is VALID [2022-04-28 12:17:14,562 INFO L290 TraceCheckUtils]: 57: Hoare triple {7187#false} assume !(#t~post6 < 10);havoc #t~post6; {7187#false} is VALID [2022-04-28 12:17:14,562 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 12:17:14,562 INFO L290 TraceCheckUtils]: 59: Hoare triple {7187#false} ~cond := #in~cond; {7187#false} is VALID [2022-04-28 12:17:14,562 INFO L290 TraceCheckUtils]: 60: Hoare triple {7187#false} assume 0 == ~cond; {7187#false} is VALID [2022-04-28 12:17:14,562 INFO L290 TraceCheckUtils]: 61: Hoare triple {7187#false} assume !false; {7187#false} is VALID [2022-04-28 12:17:14,562 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 12:17:14,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:17:14,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {7187#false} assume !false; {7187#false} is VALID [2022-04-28 12:17:14,813 INFO L290 TraceCheckUtils]: 60: Hoare triple {7187#false} assume 0 == ~cond; {7187#false} is VALID [2022-04-28 12:17:14,813 INFO L290 TraceCheckUtils]: 59: Hoare triple {7187#false} ~cond := #in~cond; {7187#false} is VALID [2022-04-28 12:17:14,813 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 12:17:14,813 INFO L290 TraceCheckUtils]: 57: Hoare triple {7187#false} assume !(#t~post6 < 10);havoc #t~post6; {7187#false} is VALID [2022-04-28 12:17:14,813 INFO L290 TraceCheckUtils]: 56: Hoare triple {7187#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7187#false} is VALID [2022-04-28 12:17:14,813 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 12:17:14,813 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 12:17:14,814 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 12:17:14,814 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 12:17:14,815 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7186#true} {7403#(< ~counter~0 10)} #92#return; {7403#(< ~counter~0 10)} is VALID [2022-04-28 12:17:14,815 INFO L290 TraceCheckUtils]: 50: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-28 12:17:14,815 INFO L290 TraceCheckUtils]: 49: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-28 12:17:14,815 INFO L290 TraceCheckUtils]: 48: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-28 12:17:14,815 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 12:17:14,815 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7186#true} {7403#(< ~counter~0 10)} #90#return; {7403#(< ~counter~0 10)} is VALID [2022-04-28 12:17:14,815 INFO L290 TraceCheckUtils]: 45: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-28 12:17:14,815 INFO L290 TraceCheckUtils]: 44: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-28 12:17:14,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-28 12:17:14,816 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 12:17:14,816 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7186#true} {7403#(< ~counter~0 10)} #88#return; {7403#(< ~counter~0 10)} is VALID [2022-04-28 12:17:14,816 INFO L290 TraceCheckUtils]: 40: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-28 12:17:14,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-28 12:17:14,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-28 12:17:14,832 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 12:17:14,842 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7186#true} {7403#(< ~counter~0 10)} #86#return; {7403#(< ~counter~0 10)} is VALID [2022-04-28 12:17:14,842 INFO L290 TraceCheckUtils]: 35: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-28 12:17:14,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-28 12:17:14,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-28 12:17:14,842 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 12:17:14,842 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 12:17:14,843 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 12:17:14,843 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 12:17:14,844 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 12:17:14,844 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 12:17:14,845 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7186#true} {7483#(< ~counter~0 8)} #84#return; {7483#(< ~counter~0 8)} is VALID [2022-04-28 12:17:14,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-28 12:17:14,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-28 12:17:14,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-28 12:17:14,845 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 12:17:14,846 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7186#true} {7483#(< ~counter~0 8)} #82#return; {7483#(< ~counter~0 8)} is VALID [2022-04-28 12:17:14,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-28 12:17:14,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-28 12:17:14,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-28 12:17:14,846 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 12:17:14,846 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 12:17:14,847 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7186#true} {7483#(< ~counter~0 8)} #80#return; {7483#(< ~counter~0 8)} is VALID [2022-04-28 12:17:14,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-28 12:17:14,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-28 12:17:14,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-28 12:17:14,847 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 12:17:14,851 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7186#true} {7483#(< ~counter~0 8)} #78#return; {7483#(< ~counter~0 8)} is VALID [2022-04-28 12:17:14,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-28 12:17:14,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-28 12:17:14,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-28 12:17:14,852 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 12:17:14,852 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 12:17:14,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {7483#(< ~counter~0 8)} call #t~ret8 := main(); {7483#(< ~counter~0 8)} is VALID [2022-04-28 12:17:14,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7483#(< ~counter~0 8)} {7186#true} #98#return; {7483#(< ~counter~0 8)} is VALID [2022-04-28 12:17:14,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {7483#(< ~counter~0 8)} assume true; {7483#(< ~counter~0 8)} is VALID [2022-04-28 12:17:14,854 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 12:17:14,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {7186#true} call ULTIMATE.init(); {7186#true} is VALID [2022-04-28 12:17:14,854 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 12:17:14,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:17:14,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181744464] [2022-04-28 12:17:14,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:17:14,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193847907] [2022-04-28 12:17:14,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193847907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:17:14,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:17:14,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 12:17:14,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:17:14,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [206715755] [2022-04-28 12:17:14,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [206715755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:17:14,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:17:14,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:17:14,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425208394] [2022-04-28 12:17:14,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:17:14,856 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 12:17:14,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:17:14,856 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 12:17:14,894 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 12:17:14,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:17:14,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:17:14,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:17:14,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:17:14,895 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 12:17:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:15,286 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2022-04-28 12:17:15,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 12:17:15,286 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 12:17:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:17:15,286 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 12:17:15,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-28 12:17:15,288 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 12:17:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-28 12:17:15,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2022-04-28 12:17:15,369 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 12:17:15,372 INFO L225 Difference]: With dead ends: 183 [2022-04-28 12:17:15,372 INFO L226 Difference]: Without dead ends: 146 [2022-04-28 12:17:15,373 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 12:17:15,374 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 12:17:15,374 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 12:17:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-28 12:17:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-28 12:17:15,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:17:15,615 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 12:17:15,615 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 12:17:15,615 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 12:17:15,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:15,620 INFO L93 Difference]: Finished difference Result 146 states and 198 transitions. [2022-04-28 12:17:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-28 12:17:15,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:17:15,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:17:15,621 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 12:17:15,621 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 12:17:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:15,625 INFO L93 Difference]: Finished difference Result 146 states and 198 transitions. [2022-04-28 12:17:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-28 12:17:15,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:17:15,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:17:15,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:17:15,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:17:15,627 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 12:17:15,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 198 transitions. [2022-04-28 12:17:15,631 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 198 transitions. Word has length 62 [2022-04-28 12:17:15,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:17:15,631 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 198 transitions. [2022-04-28 12:17:15,631 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 12:17:15,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 198 transitions. [2022-04-28 12:17:15,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:17:15,868 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-28 12:17:15,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 12:17:15,870 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:17:15,870 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 12:17:15,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 12:17:16,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 12:17:16,070 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:17:16,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:17:16,071 INFO L85 PathProgramCache]: Analyzing trace with hash -385934262, now seen corresponding path program 1 times [2022-04-28 12:17:16,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:17:16,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1645602293] [2022-04-28 12:17:16,071 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:17:16,072 INFO L85 PathProgramCache]: Analyzing trace with hash -385934262, now seen corresponding path program 2 times [2022-04-28 12:17:16,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:17:16,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248469722] [2022-04-28 12:17:16,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:17:16,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:17:16,084 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:17:16,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713837050] [2022-04-28 12:17:16,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:17:16,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:17:16,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:17:16,085 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:17:16,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 12:17:16,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:17:16,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:17:16,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 12:17:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:17:16,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:17:16,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-28 12:17:16,426 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 12:17:16,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:16,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8527#(<= ~counter~0 0)} {8519#true} #98#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:16,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {8527#(<= ~counter~0 0)} call #t~ret8 := main(); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:16,443 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 12:17:16,444 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 12:17:16,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:16,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:16,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:16,446 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 12:17:16,446 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 12:17:16,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:16,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:16,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:16,448 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 12:17:16,448 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 12:17:16,449 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 12:17:16,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:16,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:16,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:16,452 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 12:17:16,452 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 12:17:16,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:16,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:16,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 12:17:16,454 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 12:17:16,454 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 12:17:16,455 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 12:17:16,455 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 12:17:16,455 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 12:17:16,456 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 12:17:16,456 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 12:17:16,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {8616#(<= ~counter~0 2)} ~cond := #in~cond; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:16,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {8616#(<= ~counter~0 2)} assume !(0 == ~cond); {8616#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:16,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {8616#(<= ~counter~0 2)} assume true; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:16,457 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 12:17:16,458 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 12:17:16,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {8616#(<= ~counter~0 2)} ~cond := #in~cond; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:16,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {8616#(<= ~counter~0 2)} assume !(0 == ~cond); {8616#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:16,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {8616#(<= ~counter~0 2)} assume true; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:16,460 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 12:17:16,461 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 12:17:16,461 INFO L290 TraceCheckUtils]: 43: Hoare triple {8616#(<= ~counter~0 2)} ~cond := #in~cond; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:16,462 INFO L290 TraceCheckUtils]: 44: Hoare triple {8616#(<= ~counter~0 2)} assume !(0 == ~cond); {8616#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:16,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {8616#(<= ~counter~0 2)} assume true; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:16,462 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 12:17:16,463 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 12:17:16,463 INFO L290 TraceCheckUtils]: 48: Hoare triple {8616#(<= ~counter~0 2)} ~cond := #in~cond; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:16,464 INFO L290 TraceCheckUtils]: 49: Hoare triple {8616#(<= ~counter~0 2)} assume !(0 == ~cond); {8616#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:16,464 INFO L290 TraceCheckUtils]: 50: Hoare triple {8616#(<= ~counter~0 2)} assume true; {8616#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:16,464 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 12:17:16,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {8616#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {8616#(<= ~counter~0 2)} is VALID [2022-04-28 12:17:16,465 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 12:17:16,466 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 12:17:16,467 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 12:17:16,467 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 12:17:16,468 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 12:17:16,468 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 12:17:16,468 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 12:17:16,468 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8520#false} is VALID [2022-04-28 12:17:16,469 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume !(#t~post6 < 10);havoc #t~post6; {8520#false} is VALID [2022-04-28 12:17:16,469 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 12:17:16,469 INFO L290 TraceCheckUtils]: 63: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-28 12:17:16,469 INFO L290 TraceCheckUtils]: 64: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-28 12:17:16,469 INFO L290 TraceCheckUtils]: 65: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-28 12:17:16,469 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 12:17:16,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:17:16,776 INFO L290 TraceCheckUtils]: 65: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-28 12:17:16,777 INFO L290 TraceCheckUtils]: 64: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-28 12:17:16,777 INFO L290 TraceCheckUtils]: 63: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-28 12:17:16,777 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 12:17:16,777 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume !(#t~post6 < 10);havoc #t~post6; {8520#false} is VALID [2022-04-28 12:17:16,778 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8520#false} is VALID [2022-04-28 12:17:16,778 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 12:17:16,779 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 12:17:16,779 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 12:17:16,780 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 12:17:16,780 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 12:17:16,782 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 12:17:16,783 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 12:17:16,785 INFO L290 TraceCheckUtils]: 52: Hoare triple {8759#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {8759#(< ~counter~0 9)} is VALID [2022-04-28 12:17:16,786 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8519#true} {8759#(< ~counter~0 9)} #92#return; {8759#(< ~counter~0 9)} is VALID [2022-04-28 12:17:16,786 INFO L290 TraceCheckUtils]: 50: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 12:17:16,787 INFO L290 TraceCheckUtils]: 49: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 12:17:16,787 INFO L290 TraceCheckUtils]: 48: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 12:17:16,787 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 12:17:16,788 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8519#true} {8759#(< ~counter~0 9)} #90#return; {8759#(< ~counter~0 9)} is VALID [2022-04-28 12:17:16,788 INFO L290 TraceCheckUtils]: 45: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 12:17:16,788 INFO L290 TraceCheckUtils]: 44: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 12:17:16,788 INFO L290 TraceCheckUtils]: 43: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 12:17:16,788 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 12:17:16,789 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8519#true} {8759#(< ~counter~0 9)} #88#return; {8759#(< ~counter~0 9)} is VALID [2022-04-28 12:17:16,789 INFO L290 TraceCheckUtils]: 40: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 12:17:16,789 INFO L290 TraceCheckUtils]: 39: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 12:17:16,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 12:17:16,789 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 12:17:16,790 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8519#true} {8759#(< ~counter~0 9)} #86#return; {8759#(< ~counter~0 9)} is VALID [2022-04-28 12:17:16,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 12:17:16,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 12:17:16,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 12:17:16,790 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 12:17:16,790 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 12:17:16,791 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 12:17:16,792 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 12:17:16,792 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 12:17:16,793 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 12:17:16,793 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8519#true} {8842#(< ~counter~0 7)} #84#return; {8842#(< ~counter~0 7)} is VALID [2022-04-28 12:17:16,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 12:17:16,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 12:17:16,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 12:17:16,793 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 12:17:16,794 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8519#true} {8842#(< ~counter~0 7)} #82#return; {8842#(< ~counter~0 7)} is VALID [2022-04-28 12:17:16,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 12:17:16,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 12:17:16,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 12:17:16,794 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 12:17:16,795 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 12:17:16,795 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8519#true} {8842#(< ~counter~0 7)} #80#return; {8842#(< ~counter~0 7)} is VALID [2022-04-28 12:17:16,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 12:17:16,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 12:17:16,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 12:17:16,795 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 12:17:16,796 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8519#true} {8842#(< ~counter~0 7)} #78#return; {8842#(< ~counter~0 7)} is VALID [2022-04-28 12:17:16,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 12:17:16,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 12:17:16,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 12:17:16,796 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 12:17:16,797 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 12:17:16,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {8842#(< ~counter~0 7)} call #t~ret8 := main(); {8842#(< ~counter~0 7)} is VALID [2022-04-28 12:17:16,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8842#(< ~counter~0 7)} {8519#true} #98#return; {8842#(< ~counter~0 7)} is VALID [2022-04-28 12:17:16,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {8842#(< ~counter~0 7)} assume true; {8842#(< ~counter~0 7)} is VALID [2022-04-28 12:17:16,798 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 12:17:16,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-28 12:17:16,799 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 12:17:16,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:17:16,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248469722] [2022-04-28 12:17:16,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:17:16,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713837050] [2022-04-28 12:17:16,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713837050] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:17:16,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:17:16,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 12:17:16,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:17:16,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1645602293] [2022-04-28 12:17:16,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1645602293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:17:16,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:17:16,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:17:16,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590572064] [2022-04-28 12:17:16,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:17:16,803 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 12:17:16,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:17:16,805 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 12:17:16,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:17:16,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:17:16,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:17:16,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:17:16,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 12:17:16,851 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 12:17:17,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:17,304 INFO L93 Difference]: Finished difference Result 253 states and 351 transitions. [2022-04-28 12:17:17,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:17:17,304 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 12:17:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:17:17,305 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 12:17:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-28 12:17:17,306 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 12:17:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-28 12:17:17,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 114 transitions. [2022-04-28 12:17:17,405 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 12:17:17,409 INFO L225 Difference]: With dead ends: 253 [2022-04-28 12:17:17,409 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 12:17:17,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:17:17,411 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 12:17:17,411 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 12:17:17,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 12:17:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-04-28 12:17:17,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:17:17,667 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 12:17:17,668 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 12:17:17,668 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 12:17:17,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:17,673 INFO L93 Difference]: Finished difference Result 173 states and 225 transitions. [2022-04-28 12:17:17,673 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2022-04-28 12:17:17,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:17:17,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:17:17,674 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 12:17:17,675 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 12:17:17,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:17,680 INFO L93 Difference]: Finished difference Result 173 states and 225 transitions. [2022-04-28 12:17:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2022-04-28 12:17:17,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:17:17,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:17:17,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:17:17,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:17:17,681 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 12:17:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2022-04-28 12:17:17,686 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 66 [2022-04-28 12:17:17,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:17:17,687 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2022-04-28 12:17:17,687 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 12:17:17,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 223 transitions. [2022-04-28 12:17:18,013 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 12:17:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2022-04-28 12:17:18,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 12:17:18,014 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:17:18,014 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 12:17:18,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 12:17:18,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 12:17:18,215 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:17:18,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:17:18,216 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 1 times [2022-04-28 12:17:18,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:17:18,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1644435869] [2022-04-28 12:17:18,216 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:17:18,216 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 2 times [2022-04-28 12:17:18,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:17:18,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609032545] [2022-04-28 12:17:18,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:17:18,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:17:18,229 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:17:18,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [626419446] [2022-04-28 12:17:18,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:17:18,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:17:18,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:17:18,231 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:17:18,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 12:17:18,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:17:18,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:17:18,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 12:17:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:17:18,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:17:18,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {10124#true} call ULTIMATE.init(); {10124#true} is VALID [2022-04-28 12:17:18,590 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 12:17:18,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:18,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10124#true} {10124#true} #98#return; {10124#true} is VALID [2022-04-28 12:17:18,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {10124#true} call #t~ret8 := main(); {10124#true} is VALID [2022-04-28 12:17:18,591 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 12:17:18,591 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 12:17:18,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 12:17:18,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 12:17:18,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:18,591 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10124#true} {10124#true} #78#return; {10124#true} is VALID [2022-04-28 12:17:18,591 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 12:17:18,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 12:17:18,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 12:17:18,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:18,591 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10124#true} {10124#true} #80#return; {10124#true} is VALID [2022-04-28 12:17:18,592 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 12:17:18,592 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 12:17:18,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 12:17:18,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 12:17:18,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:18,599 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 12:17:18,600 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 12:17:18,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 12:17:18,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 12:17:18,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:18,601 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 12:17:18,601 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 12:17:18,602 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 12:17:18,602 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 12:17:18,602 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 12:17:18,603 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 12:17:18,603 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 12:17:18,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 12:17:18,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 12:17:18,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:18,604 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 12:17:18,604 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 12:17:18,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 12:17:18,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 12:17:18,604 INFO L290 TraceCheckUtils]: 40: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:18,605 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 12:17:18,605 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 12:17:18,605 INFO L290 TraceCheckUtils]: 43: Hoare triple {10124#true} ~cond := #in~cond; {10260#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:17:18,606 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 12:17:18,606 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 12:17:18,607 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 12:17:18,607 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 12:17:18,607 INFO L290 TraceCheckUtils]: 48: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 12:17:18,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 12:17:18,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:18,608 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 12:17:18,609 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 12:17:18,609 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 12:17:18,610 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 12:17:18,610 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 12:17:18,611 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 12:17:18,611 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 12:17:18,612 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 12:17:18,612 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 12:17:18,612 INFO L290 TraceCheckUtils]: 60: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 12:17:18,612 INFO L290 TraceCheckUtils]: 61: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 12:17:18,612 INFO L290 TraceCheckUtils]: 62: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:18,613 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 12:17:18,614 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 12:17:18,614 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 12:17:18,614 INFO L290 TraceCheckUtils]: 66: Hoare triple {10331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10125#false} is VALID [2022-04-28 12:17:18,615 INFO L290 TraceCheckUtils]: 67: Hoare triple {10125#false} assume !false; {10125#false} is VALID [2022-04-28 12:17:18,615 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 12:17:18,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:17:31,106 INFO L290 TraceCheckUtils]: 67: Hoare triple {10125#false} assume !false; {10125#false} is VALID [2022-04-28 12:17:31,107 INFO L290 TraceCheckUtils]: 66: Hoare triple {10331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10125#false} is VALID [2022-04-28 12:17:31,107 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 12:17:31,108 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 12:17:31,108 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 12:17:31,108 INFO L290 TraceCheckUtils]: 62: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:31,108 INFO L290 TraceCheckUtils]: 61: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 12:17:31,109 INFO L290 TraceCheckUtils]: 60: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 12:17:31,109 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 12:17:31,109 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 12:17:31,109 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 12:17:31,110 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 12:17:31,110 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 12:17:31,110 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 12:17:31,111 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 12:17:31,111 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 12:17:31,112 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 12:17:31,112 INFO L290 TraceCheckUtils]: 50: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:31,112 INFO L290 TraceCheckUtils]: 49: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 12:17:31,112 INFO L290 TraceCheckUtils]: 48: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 12:17:31,112 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 12:17:31,112 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 12:17:31,113 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 12:17:31,113 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 12:17:31,113 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 12:17:31,113 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 12:17:31,113 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10124#true} {10124#true} #88#return; {10124#true} is VALID [2022-04-28 12:17:31,114 INFO L290 TraceCheckUtils]: 40: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:31,114 INFO L290 TraceCheckUtils]: 39: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 12:17:31,114 INFO L290 TraceCheckUtils]: 38: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 12:17:31,114 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 12:17:31,114 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10124#true} {10124#true} #86#return; {10124#true} is VALID [2022-04-28 12:17:31,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:31,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 12:17:31,114 INFO L290 TraceCheckUtils]: 33: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 12:17:31,114 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 12:17:31,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {10124#true} assume !!(#t~post7 < 10);havoc #t~post7; {10124#true} is VALID [2022-04-28 12:17:31,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {10124#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10124#true} is VALID [2022-04-28 12:17:31,114 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 12:17:31,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {10124#true} assume !!(#t~post6 < 10);havoc #t~post6; {10124#true} is VALID [2022-04-28 12:17:31,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {10124#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10124#true} is VALID [2022-04-28 12:17:31,114 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10124#true} {10124#true} #84#return; {10124#true} is VALID [2022-04-28 12:17:31,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:31,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 12:17:31,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 12:17:31,115 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 12:17:31,115 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10124#true} {10124#true} #82#return; {10124#true} is VALID [2022-04-28 12:17:31,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:31,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 12:17:31,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 12:17:31,115 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 12:17:31,115 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 12:17:31,115 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10124#true} {10124#true} #80#return; {10124#true} is VALID [2022-04-28 12:17:31,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:31,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 12:17:31,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 12:17:31,115 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 12:17:31,115 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10124#true} {10124#true} #78#return; {10124#true} is VALID [2022-04-28 12:17:31,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:31,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-28 12:17:31,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-28 12:17:31,116 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 12:17:31,116 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 12:17:31,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {10124#true} call #t~ret8 := main(); {10124#true} is VALID [2022-04-28 12:17:31,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10124#true} {10124#true} #98#return; {10124#true} is VALID [2022-04-28 12:17:31,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 12:17:31,116 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 12:17:31,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {10124#true} call ULTIMATE.init(); {10124#true} is VALID [2022-04-28 12:17:31,117 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 12:17:31,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:17:31,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609032545] [2022-04-28 12:17:31,117 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:17:31,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626419446] [2022-04-28 12:17:31,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626419446] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:17:31,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:17:31,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-28 12:17:31,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:17:31,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1644435869] [2022-04-28 12:17:31,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1644435869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:17:31,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:17:31,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 12:17:31,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588692368] [2022-04-28 12:17:31,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:17:31,118 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 12:17:31,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:17:31,119 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 12:17:31,159 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 12:17:31,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 12:17:31,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:17:31,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 12:17:31,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-28 12:17:31,160 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 12:17:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:32,357 INFO L93 Difference]: Finished difference Result 195 states and 259 transitions. [2022-04-28 12:17:32,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 12:17:32,357 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 12:17:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:17:32,358 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 12:17:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-28 12:17:32,360 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 12:17:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-28 12:17:32,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2022-04-28 12:17:32,450 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 12:17:32,453 INFO L225 Difference]: With dead ends: 195 [2022-04-28 12:17:32,453 INFO L226 Difference]: Without dead ends: 193 [2022-04-28 12:17:32,454 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 12:17:32,454 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 12:17:32,454 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 12:17:32,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-28 12:17:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2022-04-28 12:17:32,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:17:32,746 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 12:17:32,746 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 12:17:32,747 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 12:17:32,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:32,753 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2022-04-28 12:17:32,753 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2022-04-28 12:17:32,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:17:32,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:17:32,755 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 12:17:32,755 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 12:17:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:32,761 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2022-04-28 12:17:32,761 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2022-04-28 12:17:32,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:17:32,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:17:32,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:17:32,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:17:32,763 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 12:17:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 254 transitions. [2022-04-28 12:17:32,768 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 254 transitions. Word has length 68 [2022-04-28 12:17:32,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:17:32,769 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 254 transitions. [2022-04-28 12:17:32,769 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 12:17:32,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 254 transitions. [2022-04-28 12:17:33,054 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 12:17:33,055 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 254 transitions. [2022-04-28 12:17:33,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 12:17:33,055 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:17:33,056 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 12:17:33,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 12:17:33,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 12:17:33,270 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:17:33,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:17:33,270 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 3 times [2022-04-28 12:17:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:17:33,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [560496739] [2022-04-28 12:17:33,271 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:17:33,271 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 4 times [2022-04-28 12:17:33,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:17:33,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57011366] [2022-04-28 12:17:33,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:17:33,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:17:33,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:17:33,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1440910931] [2022-04-28 12:17:33,282 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:17:33,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:17:33,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:17:33,283 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:17:33,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 12:17:33,347 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:17:33,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:17:33,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 12:17:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:17:33,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:17:35,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {11708#true} call ULTIMATE.init(); {11708#true} is VALID [2022-04-28 12:17:35,366 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 12:17:35,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:35,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11708#true} {11708#true} #98#return; {11708#true} is VALID [2022-04-28 12:17:35,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {11708#true} call #t~ret8 := main(); {11708#true} is VALID [2022-04-28 12:17:35,366 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 12:17:35,366 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 12:17:35,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:35,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:35,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:35,366 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11708#true} {11708#true} #78#return; {11708#true} is VALID [2022-04-28 12:17:35,366 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 12:17:35,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:35,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:35,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:35,367 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11708#true} {11708#true} #80#return; {11708#true} is VALID [2022-04-28 12:17:35,367 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 12:17:35,367 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 12:17:35,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:35,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:35,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:35,368 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 12:17:35,369 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 12:17:35,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:35,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:35,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:35,370 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 12:17:35,370 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 12:17:35,371 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 12:17:35,371 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 12:17:35,372 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 12:17:35,372 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 12:17:35,372 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 12:17:35,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:35,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:35,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:35,373 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 12:17:35,373 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 12:17:35,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:35,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:35,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:35,375 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 12:17:35,375 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 12:17:35,375 INFO L290 TraceCheckUtils]: 43: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:35,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:35,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:35,376 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 12:17:35,376 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 12:17:35,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:35,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:35,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:35,377 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 12:17:35,378 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 12:17:35,378 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 12:17:35,379 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 12:17:35,379 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 12:17:35,379 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 12:17:35,380 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 12:17:35,380 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 12:17:35,380 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 12:17:35,380 INFO L290 TraceCheckUtils]: 60: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:35,380 INFO L290 TraceCheckUtils]: 61: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:35,380 INFO L290 TraceCheckUtils]: 62: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:35,381 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 12:17:35,381 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 12:17:35,381 INFO L290 TraceCheckUtils]: 65: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:35,381 INFO L290 TraceCheckUtils]: 66: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:35,381 INFO L290 TraceCheckUtils]: 67: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:35,382 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 12:17:35,382 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 12:17:35,383 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 12:17:35,383 INFO L290 TraceCheckUtils]: 71: Hoare triple {11927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11709#false} is VALID [2022-04-28 12:17:35,383 INFO L290 TraceCheckUtils]: 72: Hoare triple {11709#false} assume !false; {11709#false} is VALID [2022-04-28 12:17:35,383 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 12:17:35,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:17:35,651 INFO L290 TraceCheckUtils]: 72: Hoare triple {11709#false} assume !false; {11709#false} is VALID [2022-04-28 12:17:35,651 INFO L290 TraceCheckUtils]: 71: Hoare triple {11927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11709#false} is VALID [2022-04-28 12:17:35,652 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 12:17:35,652 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 12:17:35,653 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 12:17:35,653 INFO L290 TraceCheckUtils]: 67: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:35,653 INFO L290 TraceCheckUtils]: 66: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:35,653 INFO L290 TraceCheckUtils]: 65: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:35,653 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 12:17:35,654 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 12:17:35,654 INFO L290 TraceCheckUtils]: 62: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:35,654 INFO L290 TraceCheckUtils]: 61: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:35,654 INFO L290 TraceCheckUtils]: 60: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:35,654 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 12:17:35,654 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 12:17:35,655 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 12:17:35,655 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 12:17:35,655 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 12:17:35,656 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 12:17:36,200 INFO 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 VALID [2022-04-28 12:17:36,200 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 12:17:36,201 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 12:17:36,201 INFO L290 TraceCheckUtils]: 50: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:36,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:36,201 INFO L290 TraceCheckUtils]: 48: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:36,201 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 12:17:36,202 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 12:17:36,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:36,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:36,202 INFO L290 TraceCheckUtils]: 43: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:36,202 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 12:17:36,203 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 12:17:36,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:36,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:36,203 INFO L290 TraceCheckUtils]: 38: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:36,203 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 12:17:36,204 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 12:17:36,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:36,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:36,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:36,204 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 12:17:36,204 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 12:17:36,205 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 12:17:36,205 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 12:17:36,205 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 12:17:36,206 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 12:17:36,206 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 12:17:36,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:36,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:36,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:36,207 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 12:17:36,207 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 12:17:36,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:36,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:36,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:36,208 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 12:17:36,208 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 12:17:36,208 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11708#true} {11708#true} #80#return; {11708#true} is VALID [2022-04-28 12:17:36,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:36,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:36,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:36,208 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 12:17:36,208 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11708#true} {11708#true} #78#return; {11708#true} is VALID [2022-04-28 12:17:36,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:36,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-28 12:17:36,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-28 12:17:36,208 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 12:17:36,209 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 12:17:36,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {11708#true} call #t~ret8 := main(); {11708#true} is VALID [2022-04-28 12:17:36,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11708#true} {11708#true} #98#return; {11708#true} is VALID [2022-04-28 12:17:36,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-28 12:17:36,209 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 12:17:36,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {11708#true} call ULTIMATE.init(); {11708#true} is VALID [2022-04-28 12:17:36,209 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 12:17:36,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:17:36,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57011366] [2022-04-28 12:17:36,209 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:17:36,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440910931] [2022-04-28 12:17:36,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440910931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:17:36,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:17:36,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 12:17:36,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:17:36,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [560496739] [2022-04-28 12:17:36,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [560496739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:17:36,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:17:36,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:17:36,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087631626] [2022-04-28 12:17:36,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:17:36,211 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 12:17:36,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:17:36,211 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 12:17:36,252 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 12:17:36,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:17:36,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:17:36,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:17:36,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:17:36,253 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 12:17:37,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:37,219 INFO L93 Difference]: Finished difference Result 199 states and 262 transitions. [2022-04-28 12:17:37,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 12:17:37,219 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 12:17:37,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:17:37,219 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 12:17:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-28 12:17:37,221 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 12:17:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-28 12:17:37,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 97 transitions. [2022-04-28 12:17:37,336 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 12:17:37,341 INFO L225 Difference]: With dead ends: 199 [2022-04-28 12:17:37,341 INFO L226 Difference]: Without dead ends: 197 [2022-04-28 12:17:37,341 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 12:17:37,342 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 17 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:17:37,342 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.2s Time] [2022-04-28 12:17:37,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-28 12:17:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2022-04-28 12:17:37,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:17:37,700 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 12:17:37,700 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 12:17:37,701 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 12:17:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:37,706 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2022-04-28 12:17:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2022-04-28 12:17:37,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:17:37,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:17:37,708 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 12:17:37,708 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 12:17:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:17:37,714 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2022-04-28 12:17:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2022-04-28 12:17:37,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:17:37,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:17:37,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:17:37,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:17:37,716 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 12:17:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 257 transitions. [2022-04-28 12:17:37,721 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 257 transitions. Word has length 73 [2022-04-28 12:17:37,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:17:37,722 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 257 transitions. [2022-04-28 12:17:37,722 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 12:17:37,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 257 transitions. [2022-04-28 12:17:38,062 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 12:17:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 257 transitions. [2022-04-28 12:17:38,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-28 12:17:38,063 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:17:38,063 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 12:17:38,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 12:17:38,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:17:38,268 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:17:38,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:17:38,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 5 times [2022-04-28 12:17:38,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:17:38,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [160747941] [2022-04-28 12:17:38,268 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:17:38,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 6 times [2022-04-28 12:17:38,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:17:38,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910268687] [2022-04-28 12:17:38,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:17:38,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:17:38,280 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:17:38,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1630395361] [2022-04-28 12:17:38,280 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:17:38,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:17:38,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:17:38,281 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:17:38,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 12:17:38,340 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 12:17:38,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:17:38,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 12:17:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:17:38,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:17:42,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {13339#true} call ULTIMATE.init(); {13339#true} is VALID [2022-04-28 12:17:42,262 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 12:17:42,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 12:17:42,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13339#true} {13339#true} #98#return; {13339#true} is VALID [2022-04-28 12:17:42,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {13339#true} call #t~ret8 := main(); {13339#true} is VALID [2022-04-28 12:17:42,262 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 12:17:42,262 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 12:17:42,263 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 12:17:42,263 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 12:17:42,264 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 12:17:42,264 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 12:17:42,264 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 12:17:42,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 12:17:42,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 12:17:42,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 12:17:42,265 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 12:17:42,265 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 12:17:42,265 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 12:17:42,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 12:17:42,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 12:17:42,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 12:17:42,266 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 12:17:42,266 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 12:17:42,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 12:17:42,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 12:17:42,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 12:17:42,267 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 12:17:42,268 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 12:17:42,268 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 12:17:42,269 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 12:17:42,269 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 12:17:42,270 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 12:17:42,270 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 12:17:42,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 12:17:42,270 INFO L290 TraceCheckUtils]: 34: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 12:17:42,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 12:17:42,270 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 12:17:42,271 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 12:17:42,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 12:17:42,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 12:17:42,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 12:17:42,272 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 12:17:42,272 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 12:17:42,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 12:17:42,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 12:17:42,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 12:17:42,273 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 12:17:42,274 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 12:17:42,274 INFO L290 TraceCheckUtils]: 48: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 12:17:42,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 12:17:42,274 INFO L290 TraceCheckUtils]: 50: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 12:17:42,275 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 12:17:42,276 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 12:17:42,276 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 12:17:42,277 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 12:17:42,278 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 12:17:42,278 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 12:17:42,279 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 12:17:42,279 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 12:17:42,279 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 12:17:42,279 INFO L290 TraceCheckUtils]: 60: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 12:17:42,280 INFO L290 TraceCheckUtils]: 61: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 12:17:42,280 INFO L290 TraceCheckUtils]: 62: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 12:17:42,293 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 12:17:42,293 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 12:17:42,293 INFO L290 TraceCheckUtils]: 65: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-28 12:17:42,293 INFO L290 TraceCheckUtils]: 66: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-28 12:17:42,293 INFO L290 TraceCheckUtils]: 67: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-28 12:17:42,294 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 12:17:42,294 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 12:17:42,295 INFO L290 TraceCheckUtils]: 70: Hoare triple {13339#true} ~cond := #in~cond; {13561#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:17:42,295 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 12:17:42,296 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 12:17:42,296 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 12:17:42,297 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 12:17:42,298 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 12:17:42,298 INFO L290 TraceCheckUtils]: 76: Hoare triple {13579#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13340#false} is VALID [2022-04-28 12:17:42,298 INFO L290 TraceCheckUtils]: 77: Hoare triple {13340#false} assume !false; {13340#false} is VALID [2022-04-28 12:17:42,299 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 12:17:42,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:18:18,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:18:18,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910268687] [2022-04-28 12:18:18,265 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:18:18,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630395361] [2022-04-28 12:18:18,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630395361] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 12:18:18,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:18:18,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 12:18:18,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:18:18,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [160747941] [2022-04-28 12:18:18,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [160747941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:18:18,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:18:18,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:18:18,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037413147] [2022-04-28 12:18:18,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:18:18,266 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 12:18:18,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:18:18,266 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 12:18:18,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:18:18,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:18:18,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:18:18,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:18:18,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-04-28 12:18:18,315 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 12:18:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:18:24,013 INFO L93 Difference]: Finished difference Result 203 states and 265 transitions. [2022-04-28 12:18:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 12:18:24,014 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 12:18:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:18:24,014 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 12:18:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-28 12:18:24,016 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 12:18:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-28 12:18:24,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 97 transitions. [2022-04-28 12:18:24,126 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 12:18:24,130 INFO L225 Difference]: With dead ends: 203 [2022-04-28 12:18:24,130 INFO L226 Difference]: Without dead ends: 201 [2022-04-28 12:18:24,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-04-28 12:18:24,131 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 55 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:18:24,131 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.2s Time] [2022-04-28 12:18:24,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-28 12:18:24,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2022-04-28 12:18:24,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:18:24,465 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 12:18:24,465 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 12:18:24,465 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 12:18:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:18:24,471 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2022-04-28 12:18:24,471 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2022-04-28 12:18:24,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:18:24,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:18:24,472 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 12:18:24,472 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 12:18:24,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:18:24,477 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2022-04-28 12:18:24,478 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2022-04-28 12:18:24,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:18:24,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:18:24,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:18:24,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:18:24,479 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 12:18:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 260 transitions. [2022-04-28 12:18:24,484 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 260 transitions. Word has length 78 [2022-04-28 12:18:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:18:24,484 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 260 transitions. [2022-04-28 12:18:24,485 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 12:18:24,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 198 states and 260 transitions. [2022-04-28 12:18:24,804 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 12:18:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 260 transitions. [2022-04-28 12:18:24,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 12:18:24,805 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:18:24,805 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 12:18:24,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 12:18:25,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 12:18:25,018 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:18:25,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:18:25,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1849570232, now seen corresponding path program 3 times [2022-04-28 12:18:25,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:18:25,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1121326372] [2022-04-28 12:18:25,019 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:18:25,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1849570232, now seen corresponding path program 4 times [2022-04-28 12:18:25,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:18:25,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886750698] [2022-04-28 12:18:25,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:18:25,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:18:25,030 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:18:25,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956588605] [2022-04-28 12:18:25,030 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:18:25,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:18:25,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:18:25,032 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:18:25,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 12:18:25,085 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:18:25,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:18:25,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 12:18:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:18:25,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:18:26,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {14816#true} call ULTIMATE.init(); {14816#true} is VALID [2022-04-28 12:18:26,256 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 12:18:26,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:26,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14816#true} {14816#true} #98#return; {14816#true} is VALID [2022-04-28 12:18:26,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {14816#true} call #t~ret8 := main(); {14816#true} is VALID [2022-04-28 12:18:26,257 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 12:18:26,257 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 12:18:26,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:26,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:26,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:26,257 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14816#true} {14816#true} #78#return; {14816#true} is VALID [2022-04-28 12:18:26,257 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 12:18:26,258 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 12:18:26,258 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 12:18:26,258 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 12:18:26,259 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 12:18:26,259 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 12:18:26,259 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 12:18:26,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:26,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:26,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:26,260 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 12:18:26,260 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 12:18:26,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:26,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:26,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:26,261 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 12:18:26,261 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 12:18:26,262 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 12:18:26,262 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 12:18:26,262 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 12:18:26,263 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 12:18:26,263 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 12:18:26,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:26,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:26,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:26,264 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 12:18:26,264 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 12:18:26,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:26,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:26,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:26,265 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 12:18:26,265 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 12:18:26,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:26,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:26,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:26,266 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 12:18:26,266 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 12:18:26,266 INFO L290 TraceCheckUtils]: 48: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:26,266 INFO L290 TraceCheckUtils]: 49: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:26,266 INFO L290 TraceCheckUtils]: 50: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:26,267 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 12:18:26,268 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 12:18:26,269 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 12:18:26,269 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 12:18:26,269 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 12:18:26,269 INFO L290 TraceCheckUtils]: 56: Hoare triple {14816#true} ~cond := #in~cond; {14995#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:18:26,270 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 12:18:26,270 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 12:18:26,271 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 12:18:26,271 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 12:18:26,271 INFO L290 TraceCheckUtils]: 61: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:26,271 INFO L290 TraceCheckUtils]: 62: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:26,271 INFO L290 TraceCheckUtils]: 63: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:26,272 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 12:18:26,272 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 12:18:26,272 INFO L290 TraceCheckUtils]: 66: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:26,272 INFO L290 TraceCheckUtils]: 67: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:26,272 INFO L290 TraceCheckUtils]: 68: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:26,273 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 12:18:26,273 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 12:18:26,273 INFO L290 TraceCheckUtils]: 71: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:26,273 INFO L290 TraceCheckUtils]: 72: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:26,273 INFO L290 TraceCheckUtils]: 73: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:26,274 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 12:18:26,276 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 12:18:26,277 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 12:18:26,277 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 12:18:26,278 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 12:18:26,279 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 12:18:26,279 INFO L290 TraceCheckUtils]: 80: Hoare triple {15069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14817#false} is VALID [2022-04-28 12:18:26,279 INFO L290 TraceCheckUtils]: 81: Hoare triple {14817#false} assume !false; {14817#false} is VALID [2022-04-28 12:18:26,279 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 12:18:26,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:18:32,760 INFO L290 TraceCheckUtils]: 81: Hoare triple {14817#false} assume !false; {14817#false} is VALID [2022-04-28 12:18:32,761 INFO L290 TraceCheckUtils]: 80: Hoare triple {15069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14817#false} is VALID [2022-04-28 12:18:32,761 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 12:18:32,762 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 12:18:32,762 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 12:18:32,762 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 12:18:32,764 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 12:18:32,765 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 12:18:32,765 INFO L290 TraceCheckUtils]: 73: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:32,765 INFO L290 TraceCheckUtils]: 72: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:32,765 INFO L290 TraceCheckUtils]: 71: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:32,765 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 12:18:32,766 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 12:18:32,766 INFO L290 TraceCheckUtils]: 68: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:32,766 INFO L290 TraceCheckUtils]: 67: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:32,766 INFO L290 TraceCheckUtils]: 66: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:32,766 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 12:18:32,766 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 12:18:32,767 INFO L290 TraceCheckUtils]: 63: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:32,767 INFO L290 TraceCheckUtils]: 62: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:32,767 INFO L290 TraceCheckUtils]: 61: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:32,767 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 12:18:32,767 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 12:18:32,768 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 12:18:32,768 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 12:18:32,768 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 12:18:32,768 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 12:18:32,768 INFO L290 TraceCheckUtils]: 54: Hoare triple {14816#true} assume !!(#t~post7 < 10);havoc #t~post7; {14816#true} is VALID [2022-04-28 12:18:32,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {14816#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14816#true} is VALID [2022-04-28 12:18:32,768 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 12:18:32,768 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14816#true} {14816#true} #92#return; {14816#true} is VALID [2022-04-28 12:18:32,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:32,769 INFO L290 TraceCheckUtils]: 49: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:32,769 INFO L290 TraceCheckUtils]: 48: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:32,769 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 12:18:32,769 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14816#true} {14816#true} #90#return; {14816#true} is VALID [2022-04-28 12:18:32,769 INFO L290 TraceCheckUtils]: 45: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:32,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:32,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:32,769 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 12:18:32,769 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14816#true} {14816#true} #88#return; {14816#true} is VALID [2022-04-28 12:18:32,769 INFO L290 TraceCheckUtils]: 40: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:32,769 INFO L290 TraceCheckUtils]: 39: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:32,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:32,769 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 12:18:32,769 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14816#true} {14816#true} #86#return; {14816#true} is VALID [2022-04-28 12:18:32,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:32,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:32,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:32,769 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 12:18:32,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {14816#true} assume !!(#t~post7 < 10);havoc #t~post7; {14816#true} is VALID [2022-04-28 12:18:32,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {14816#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14816#true} is VALID [2022-04-28 12:18:32,770 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 12:18:32,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {14816#true} assume !!(#t~post6 < 10);havoc #t~post6; {14816#true} is VALID [2022-04-28 12:18:32,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {14816#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14816#true} is VALID [2022-04-28 12:18:32,770 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14816#true} {14816#true} #84#return; {14816#true} is VALID [2022-04-28 12:18:32,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:32,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:32,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:32,770 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 12:18:32,770 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14816#true} {14816#true} #82#return; {14816#true} is VALID [2022-04-28 12:18:32,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:32,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:32,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:32,770 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 12:18:32,770 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 12:18:32,770 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14816#true} {14816#true} #80#return; {14816#true} is VALID [2022-04-28 12:18:32,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:32,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:32,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:32,771 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 12:18:32,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14816#true} {14816#true} #78#return; {14816#true} is VALID [2022-04-28 12:18:32,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:32,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-28 12:18:32,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-28 12:18:32,771 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 12:18:32,771 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 12:18:32,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {14816#true} call #t~ret8 := main(); {14816#true} is VALID [2022-04-28 12:18:32,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14816#true} {14816#true} #98#return; {14816#true} is VALID [2022-04-28 12:18:32,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-28 12:18:32,771 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 12:18:32,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {14816#true} call ULTIMATE.init(); {14816#true} is VALID [2022-04-28 12:18:32,771 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 12:18:32,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:18:32,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886750698] [2022-04-28 12:18:32,772 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:18:32,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956588605] [2022-04-28 12:18:32,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956588605] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:18:32,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:18:32,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 16 [2022-04-28 12:18:32,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:18:32,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1121326372] [2022-04-28 12:18:32,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1121326372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:18:32,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:18:32,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 12:18:32,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274149319] [2022-04-28 12:18:32,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:18:32,773 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 12:18:32,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:18:32,773 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 12:18:32,818 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 12:18:32,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 12:18:32,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:18:32,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 12:18:32,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-04-28 12:18:32,819 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 12:18:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:18:36,981 INFO L93 Difference]: Finished difference Result 212 states and 278 transitions. [2022-04-28 12:18:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 12:18:36,981 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 12:18:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:18:36,981 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 12:18:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-04-28 12:18:36,983 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 12:18:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-04-28 12:18:36,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 106 transitions. [2022-04-28 12:18:37,099 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 12:18:37,104 INFO L225 Difference]: With dead ends: 212 [2022-04-28 12:18:37,104 INFO L226 Difference]: Without dead ends: 210 [2022-04-28 12:18:37,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-04-28 12:18:37,104 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 53 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 12:18:37,105 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.6s Time] [2022-04-28 12:18:37,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-28 12:18:37,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 203. [2022-04-28 12:18:37,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:18:37,484 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 12:18:37,485 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 12:18:37,485 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 12:18:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:18:37,490 INFO L93 Difference]: Finished difference Result 210 states and 276 transitions. [2022-04-28 12:18:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2022-04-28 12:18:37,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:18:37,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:18:37,492 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 12:18:37,492 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 12:18:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:18:37,498 INFO L93 Difference]: Finished difference Result 210 states and 276 transitions. [2022-04-28 12:18:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2022-04-28 12:18:37,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:18:37,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:18:37,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:18:37,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:18:37,499 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 12:18:37,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 265 transitions. [2022-04-28 12:18:37,504 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 265 transitions. Word has length 82 [2022-04-28 12:18:37,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:18:37,505 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 265 transitions. [2022-04-28 12:18:37,505 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 12:18:37,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 203 states and 265 transitions. [2022-04-28 12:18:37,911 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 12:18:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 265 transitions. [2022-04-28 12:18:37,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 12:18:37,912 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:18:37,912 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 12:18:37,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 12:18:38,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 12:18:38,113 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:18:38,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:18:38,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1768368813, now seen corresponding path program 1 times [2022-04-28 12:18:38,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:18:38,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1908319972] [2022-04-28 12:18:38,114 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:18:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1768368813, now seen corresponding path program 2 times [2022-04-28 12:18:38,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:18:38,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452537268] [2022-04-28 12:18:38,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:18:38,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:18:38,131 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:18:38,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545852643] [2022-04-28 12:18:38,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:18:38,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:18:38,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:18:38,132 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:18:38,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 12:18:38,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:18:38,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:18:38,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 12:18:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:18:38,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:18:38,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {16587#true} call ULTIMATE.init(); {16587#true} is VALID [2022-04-28 12:18:38,505 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 12:18:38,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {16595#(<= ~counter~0 0)} assume true; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 12:18:38,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16595#(<= ~counter~0 0)} {16587#true} #98#return; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 12:18:38,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {16595#(<= ~counter~0 0)} call #t~ret8 := main(); {16595#(<= ~counter~0 0)} is VALID [2022-04-28 12:18:38,506 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 12:18:38,507 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 12:18:38,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {16595#(<= ~counter~0 0)} ~cond := #in~cond; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 12:18:38,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {16595#(<= ~counter~0 0)} assume !(0 == ~cond); {16595#(<= ~counter~0 0)} is VALID [2022-04-28 12:18:38,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {16595#(<= ~counter~0 0)} assume true; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 12:18:38,508 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 12:18:38,508 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 12:18:38,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {16595#(<= ~counter~0 0)} ~cond := #in~cond; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 12:18:38,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {16595#(<= ~counter~0 0)} assume !(0 == ~cond); {16595#(<= ~counter~0 0)} is VALID [2022-04-28 12:18:38,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {16595#(<= ~counter~0 0)} assume true; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 12:18:38,509 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 12:18:38,510 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 12:18:38,510 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 12:18:38,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {16595#(<= ~counter~0 0)} ~cond := #in~cond; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 12:18:38,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {16595#(<= ~counter~0 0)} assume !(0 == ~cond); {16595#(<= ~counter~0 0)} is VALID [2022-04-28 12:18:38,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {16595#(<= ~counter~0 0)} assume true; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 12:18:38,511 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 12:18:38,512 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 12:18:38,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {16595#(<= ~counter~0 0)} ~cond := #in~cond; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 12:18:38,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {16595#(<= ~counter~0 0)} assume !(0 == ~cond); {16595#(<= ~counter~0 0)} is VALID [2022-04-28 12:18:38,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {16595#(<= ~counter~0 0)} assume true; {16595#(<= ~counter~0 0)} is VALID [2022-04-28 12:18:38,513 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 12:18:38,513 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 12:18:38,514 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 12:18:38,514 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 12:18:38,514 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 12:18:38,515 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 12:18:38,515 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 12:18:38,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {16684#(<= ~counter~0 2)} ~cond := #in~cond; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 12:18:38,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {16684#(<= ~counter~0 2)} assume !(0 == ~cond); {16684#(<= ~counter~0 2)} is VALID [2022-04-28 12:18:38,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {16684#(<= ~counter~0 2)} assume true; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 12:18:38,516 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 12:18:38,517 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 12:18:38,517 INFO L290 TraceCheckUtils]: 38: Hoare triple {16684#(<= ~counter~0 2)} ~cond := #in~cond; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 12:18:38,518 INFO L290 TraceCheckUtils]: 39: Hoare triple {16684#(<= ~counter~0 2)} assume !(0 == ~cond); {16684#(<= ~counter~0 2)} is VALID [2022-04-28 12:18:38,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {16684#(<= ~counter~0 2)} assume true; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 12:18:38,518 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 12:18:38,519 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 12:18:38,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {16684#(<= ~counter~0 2)} ~cond := #in~cond; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 12:18:38,519 INFO L290 TraceCheckUtils]: 44: Hoare triple {16684#(<= ~counter~0 2)} assume !(0 == ~cond); {16684#(<= ~counter~0 2)} is VALID [2022-04-28 12:18:38,520 INFO L290 TraceCheckUtils]: 45: Hoare triple {16684#(<= ~counter~0 2)} assume true; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 12:18:38,520 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 12:18:38,521 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 12:18:38,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {16684#(<= ~counter~0 2)} ~cond := #in~cond; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 12:18:38,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {16684#(<= ~counter~0 2)} assume !(0 == ~cond); {16684#(<= ~counter~0 2)} is VALID [2022-04-28 12:18:38,522 INFO L290 TraceCheckUtils]: 50: Hoare triple {16684#(<= ~counter~0 2)} assume true; {16684#(<= ~counter~0 2)} is VALID [2022-04-28 12:18:38,522 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 12:18:38,522 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 12:18:38,523 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 12:18:38,523 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 12:18:38,524 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 12:18:38,524 INFO L290 TraceCheckUtils]: 56: Hoare triple {16754#(<= ~counter~0 3)} ~cond := #in~cond; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 12:18:38,524 INFO L290 TraceCheckUtils]: 57: Hoare triple {16754#(<= ~counter~0 3)} assume !(0 == ~cond); {16754#(<= ~counter~0 3)} is VALID [2022-04-28 12:18:38,524 INFO L290 TraceCheckUtils]: 58: Hoare triple {16754#(<= ~counter~0 3)} assume true; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 12:18:38,525 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 12:18:38,525 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 12:18:38,526 INFO L290 TraceCheckUtils]: 61: Hoare triple {16754#(<= ~counter~0 3)} ~cond := #in~cond; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 12:18:38,526 INFO L290 TraceCheckUtils]: 62: Hoare triple {16754#(<= ~counter~0 3)} assume !(0 == ~cond); {16754#(<= ~counter~0 3)} is VALID [2022-04-28 12:18:38,526 INFO L290 TraceCheckUtils]: 63: Hoare triple {16754#(<= ~counter~0 3)} assume true; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 12:18:38,527 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 12:18:38,527 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 12:18:38,527 INFO L290 TraceCheckUtils]: 66: Hoare triple {16754#(<= ~counter~0 3)} ~cond := #in~cond; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 12:18:38,528 INFO L290 TraceCheckUtils]: 67: Hoare triple {16754#(<= ~counter~0 3)} assume !(0 == ~cond); {16754#(<= ~counter~0 3)} is VALID [2022-04-28 12:18:38,528 INFO L290 TraceCheckUtils]: 68: Hoare triple {16754#(<= ~counter~0 3)} assume true; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 12:18:38,528 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 12:18:38,529 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 12:18:38,529 INFO L290 TraceCheckUtils]: 71: Hoare triple {16754#(<= ~counter~0 3)} ~cond := #in~cond; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 12:18:38,530 INFO L290 TraceCheckUtils]: 72: Hoare triple {16754#(<= ~counter~0 3)} assume !(0 == ~cond); {16754#(<= ~counter~0 3)} is VALID [2022-04-28 12:18:38,530 INFO L290 TraceCheckUtils]: 73: Hoare triple {16754#(<= ~counter~0 3)} assume true; {16754#(<= ~counter~0 3)} is VALID [2022-04-28 12:18:38,530 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 12:18:38,531 INFO L290 TraceCheckUtils]: 75: Hoare triple {16754#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {16754#(<= ~counter~0 3)} is VALID [2022-04-28 12:18:38,531 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 12:18:38,531 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 12:18:38,532 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 12:18:38,532 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 12:18:38,532 INFO L290 TraceCheckUtils]: 80: Hoare triple {16588#false} ~cond := #in~cond; {16588#false} is VALID [2022-04-28 12:18:38,532 INFO L290 TraceCheckUtils]: 81: Hoare triple {16588#false} assume 0 == ~cond; {16588#false} is VALID [2022-04-28 12:18:38,532 INFO L290 TraceCheckUtils]: 82: Hoare triple {16588#false} assume !false; {16588#false} is VALID [2022-04-28 12:18:38,532 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 12:18:38,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:18:38,848 INFO L290 TraceCheckUtils]: 82: Hoare triple {16588#false} assume !false; {16588#false} is VALID [2022-04-28 12:18:38,849 INFO L290 TraceCheckUtils]: 81: Hoare triple {16588#false} assume 0 == ~cond; {16588#false} is VALID [2022-04-28 12:18:38,849 INFO L290 TraceCheckUtils]: 80: Hoare triple {16588#false} ~cond := #in~cond; {16588#false} is VALID [2022-04-28 12:18:38,849 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 12:18:38,849 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 12:18:38,849 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 12:18:38,850 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 12:18:38,850 INFO L290 TraceCheckUtils]: 75: Hoare triple {16859#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {16859#(< ~counter~0 10)} is VALID [2022-04-28 12:18:38,851 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16587#true} {16859#(< ~counter~0 10)} #92#return; {16859#(< ~counter~0 10)} is VALID [2022-04-28 12:18:38,851 INFO L290 TraceCheckUtils]: 73: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 12:18:38,851 INFO L290 TraceCheckUtils]: 72: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 12:18:38,851 INFO L290 TraceCheckUtils]: 71: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 12:18:38,851 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 12:18:38,852 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16587#true} {16859#(< ~counter~0 10)} #90#return; {16859#(< ~counter~0 10)} is VALID [2022-04-28 12:18:38,852 INFO L290 TraceCheckUtils]: 68: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 12:18:38,852 INFO L290 TraceCheckUtils]: 67: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 12:18:38,852 INFO L290 TraceCheckUtils]: 66: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 12:18:38,852 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 12:18:38,853 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16587#true} {16859#(< ~counter~0 10)} #88#return; {16859#(< ~counter~0 10)} is VALID [2022-04-28 12:18:38,853 INFO L290 TraceCheckUtils]: 63: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 12:18:38,853 INFO L290 TraceCheckUtils]: 62: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 12:18:38,853 INFO L290 TraceCheckUtils]: 61: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 12:18:38,853 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 12:18:38,855 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16587#true} {16859#(< ~counter~0 10)} #86#return; {16859#(< ~counter~0 10)} is VALID [2022-04-28 12:18:38,855 INFO L290 TraceCheckUtils]: 58: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 12:18:38,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 12:18:38,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 12:18:38,855 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 12:18:38,856 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 12:18:38,856 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 12:18:38,857 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 12:18:38,858 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16587#true} {16932#(< ~counter~0 9)} #92#return; {16932#(< ~counter~0 9)} is VALID [2022-04-28 12:18:38,858 INFO L290 TraceCheckUtils]: 50: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 12:18:38,858 INFO L290 TraceCheckUtils]: 49: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 12:18:38,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 12:18:38,858 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 12:18:38,859 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16587#true} {16932#(< ~counter~0 9)} #90#return; {16932#(< ~counter~0 9)} is VALID [2022-04-28 12:18:38,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 12:18:38,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 12:18:38,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 12:18:38,859 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 12:18:38,860 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16587#true} {16932#(< ~counter~0 9)} #88#return; {16932#(< ~counter~0 9)} is VALID [2022-04-28 12:18:38,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 12:18:38,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 12:18:38,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 12:18:38,860 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 12:18:38,861 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16587#true} {16932#(< ~counter~0 9)} #86#return; {16932#(< ~counter~0 9)} is VALID [2022-04-28 12:18:38,861 INFO L290 TraceCheckUtils]: 35: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 12:18:38,861 INFO L290 TraceCheckUtils]: 34: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 12:18:38,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 12:18:38,861 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 12:18:38,862 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 12:18:38,862 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 12:18:38,863 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 12:18:38,863 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 12:18:38,864 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 12:18:38,864 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16587#true} {17012#(< ~counter~0 7)} #84#return; {17012#(< ~counter~0 7)} is VALID [2022-04-28 12:18:38,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 12:18:38,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 12:18:38,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 12:18:38,865 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 12:18:38,865 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16587#true} {17012#(< ~counter~0 7)} #82#return; {17012#(< ~counter~0 7)} is VALID [2022-04-28 12:18:38,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 12:18:38,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 12:18:38,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 12:18:38,865 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 12:18:38,866 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 12:18:38,866 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16587#true} {17012#(< ~counter~0 7)} #80#return; {17012#(< ~counter~0 7)} is VALID [2022-04-28 12:18:38,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 12:18:38,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 12:18:38,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 12:18:38,867 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 12:18:38,867 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16587#true} {17012#(< ~counter~0 7)} #78#return; {17012#(< ~counter~0 7)} is VALID [2022-04-28 12:18:38,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-28 12:18:38,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-28 12:18:38,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-28 12:18:38,867 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 12:18:38,868 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 12:18:38,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {17012#(< ~counter~0 7)} call #t~ret8 := main(); {17012#(< ~counter~0 7)} is VALID [2022-04-28 12:18:38,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17012#(< ~counter~0 7)} {16587#true} #98#return; {17012#(< ~counter~0 7)} is VALID [2022-04-28 12:18:38,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {17012#(< ~counter~0 7)} assume true; {17012#(< ~counter~0 7)} is VALID [2022-04-28 12:18:38,869 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 12:18:38,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {16587#true} call ULTIMATE.init(); {16587#true} is VALID [2022-04-28 12:18:38,870 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 12:18:38,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:18:38,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452537268] [2022-04-28 12:18:38,870 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:18:38,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545852643] [2022-04-28 12:18:38,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545852643] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:18:38,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:18:38,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 12:18:38,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:18:38,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1908319972] [2022-04-28 12:18:38,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1908319972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:18:38,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:18:38,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:18:38,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711698148] [2022-04-28 12:18:38,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:18:38,871 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 12:18:38,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:18:38,872 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 12:18:38,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:18:38,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:18:38,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:18:38,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:18:38,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 12:18:38,917 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 12:18:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:18:39,454 INFO L93 Difference]: Finished difference Result 214 states and 277 transitions. [2022-04-28 12:18:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:18:39,454 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 12:18:39,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:18:39,455 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 12:18:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 12:18:39,456 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 12:18:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 12:18:39,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-28 12:18:39,542 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 12:18:39,547 INFO L225 Difference]: With dead ends: 214 [2022-04-28 12:18:39,547 INFO L226 Difference]: Without dead ends: 206 [2022-04-28 12:18:39,547 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 12:18:39,548 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 18 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:18:39,548 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.1s Time] [2022-04-28 12:18:39,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-28 12:18:39,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-04-28 12:18:39,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:18:39,943 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 12:18:39,943 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 12:18:39,944 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 12:18:39,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:18:39,949 INFO L93 Difference]: Finished difference Result 206 states and 268 transitions. [2022-04-28 12:18:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-28 12:18:39,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:18:39,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:18:39,950 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 12:18:39,950 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 12:18:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:18:39,955 INFO L93 Difference]: Finished difference Result 206 states and 268 transitions. [2022-04-28 12:18:39,955 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-28 12:18:39,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:18:39,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:18:39,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:18:39,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:18:39,956 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 12:18:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 268 transitions. [2022-04-28 12:18:39,961 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 268 transitions. Word has length 83 [2022-04-28 12:18:39,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:18:39,962 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 268 transitions. [2022-04-28 12:18:39,962 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 12:18:39,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 206 states and 268 transitions. [2022-04-28 12:18:40,356 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 12:18:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-28 12:18:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 12:18:40,357 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:18:40,357 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 12:18:40,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 12:18:40,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 12:18:40,559 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:18:40,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:18:40,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 1 times [2022-04-28 12:18:40,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:18:40,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1965633515] [2022-04-28 12:18:40,560 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:18:40,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 2 times [2022-04-28 12:18:40,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:18:40,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002319494] [2022-04-28 12:18:40,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:18:40,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:18:40,578 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:18:40,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1060089503] [2022-04-28 12:18:40,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:18:40,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:18:40,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:18:40,579 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:18:40,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 12:18:40,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:18:40,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:18:40,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 12:18:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:18:40,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:18:41,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {18352#true} call ULTIMATE.init(); {18352#true} is VALID [2022-04-28 12:18:41,226 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 12:18:41,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:41,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18352#true} {18352#true} #98#return; {18352#true} is VALID [2022-04-28 12:18:41,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {18352#true} call #t~ret8 := main(); {18352#true} is VALID [2022-04-28 12:18:41,226 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 12:18:41,226 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 12:18:41,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:41,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:41,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:41,226 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18352#true} {18352#true} #78#return; {18352#true} is VALID [2022-04-28 12:18:41,226 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 12:18:41,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:41,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:41,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:41,226 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18352#true} {18352#true} #80#return; {18352#true} is VALID [2022-04-28 12:18:41,227 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 12:18:41,227 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 12:18:41,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:41,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:41,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:41,228 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 12:18:41,228 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 12:18:41,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:41,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:41,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:41,228 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 12:18:41,229 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 12:18:41,229 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 12:18:41,230 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 12:18:41,230 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 12:18:41,230 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 12:18:41,230 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 12:18:41,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:41,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:41,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:41,231 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 12:18:41,231 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 12:18:41,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:41,231 INFO L290 TraceCheckUtils]: 39: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:41,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:41,232 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 12:18:41,232 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 12:18:41,232 INFO L290 TraceCheckUtils]: 43: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:41,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:41,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:41,239 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 12:18:41,239 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 12:18:41,239 INFO L290 TraceCheckUtils]: 48: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:41,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:41,240 INFO L290 TraceCheckUtils]: 50: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:41,240 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 12:18:41,241 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 12:18:41,241 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 12:18:41,241 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 12:18:41,242 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 12:18:41,242 INFO L290 TraceCheckUtils]: 56: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:41,242 INFO L290 TraceCheckUtils]: 57: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:41,242 INFO L290 TraceCheckUtils]: 58: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:41,242 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 12:18:41,242 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 12:18:41,243 INFO L290 TraceCheckUtils]: 61: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:41,243 INFO L290 TraceCheckUtils]: 62: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:41,243 INFO L290 TraceCheckUtils]: 63: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:41,243 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 12:18:41,243 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 12:18:41,243 INFO L290 TraceCheckUtils]: 66: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:41,243 INFO L290 TraceCheckUtils]: 67: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:41,243 INFO L290 TraceCheckUtils]: 68: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:41,244 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 12:18:41,244 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 12:18:41,244 INFO L290 TraceCheckUtils]: 71: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:41,244 INFO L290 TraceCheckUtils]: 72: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:41,244 INFO L290 TraceCheckUtils]: 73: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:41,245 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 12:18:41,245 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 12:18:41,246 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 12:18:41,246 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 12:18:41,247 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 12:18:41,247 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 12:18:41,248 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 12:18:41,248 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 12:18:41,248 INFO L290 TraceCheckUtils]: 82: Hoare triple {18606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18353#false} is VALID [2022-04-28 12:18:41,248 INFO L290 TraceCheckUtils]: 83: Hoare triple {18353#false} assume !false; {18353#false} is VALID [2022-04-28 12:18:41,249 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 12:18:41,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:18:41,765 INFO L290 TraceCheckUtils]: 83: Hoare triple {18353#false} assume !false; {18353#false} is VALID [2022-04-28 12:18:41,766 INFO L290 TraceCheckUtils]: 82: Hoare triple {18606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18353#false} is VALID [2022-04-28 12:18:41,766 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 12:18:41,767 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 12:18:41,767 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 12:18:41,767 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 12:18:41,768 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 12:18:42,060 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 12:18:42,061 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 12:18:42,061 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 12:18:42,061 INFO L290 TraceCheckUtils]: 73: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:42,062 INFO L290 TraceCheckUtils]: 72: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:42,062 INFO L290 TraceCheckUtils]: 71: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:42,062 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 12:18:42,062 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 12:18:42,062 INFO L290 TraceCheckUtils]: 68: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:42,062 INFO L290 TraceCheckUtils]: 67: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:42,062 INFO L290 TraceCheckUtils]: 66: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:42,063 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 12:18:42,063 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 12:18:42,063 INFO L290 TraceCheckUtils]: 63: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:42,063 INFO L290 TraceCheckUtils]: 62: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:42,063 INFO L290 TraceCheckUtils]: 61: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:42,063 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 12:18:42,064 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 12:18:42,064 INFO L290 TraceCheckUtils]: 58: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:42,064 INFO L290 TraceCheckUtils]: 57: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:42,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:42,064 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 12:18:42,065 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 12:18:42,065 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 12:18:42,481 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 12:18:42,482 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 12:18:42,482 INFO L290 TraceCheckUtils]: 50: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:42,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:42,482 INFO L290 TraceCheckUtils]: 48: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:42,482 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 12:18:42,483 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 12:18:42,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:42,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:42,483 INFO L290 TraceCheckUtils]: 43: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:42,483 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 12:18:42,484 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 12:18:42,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:42,484 INFO L290 TraceCheckUtils]: 39: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:42,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:42,484 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 12:18:42,485 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 12:18:42,485 INFO L290 TraceCheckUtils]: 35: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:42,485 INFO L290 TraceCheckUtils]: 34: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:42,485 INFO L290 TraceCheckUtils]: 33: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:42,485 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 12:18:42,486 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 12:18:42,486 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 12:18:42,487 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 12:18:42,487 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 12:18:42,487 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 12:18:42,488 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 12:18:42,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:42,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:42,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:42,488 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 12:18:42,489 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 12:18:42,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:42,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:42,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:42,489 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 12:18:42,490 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 12:18:42,490 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18352#true} {18352#true} #80#return; {18352#true} is VALID [2022-04-28 12:18:42,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:42,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:42,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:42,490 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 12:18:42,490 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18352#true} {18352#true} #78#return; {18352#true} is VALID [2022-04-28 12:18:42,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:42,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-28 12:18:42,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-28 12:18:42,490 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 12:18:42,490 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 12:18:42,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {18352#true} call #t~ret8 := main(); {18352#true} is VALID [2022-04-28 12:18:42,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18352#true} {18352#true} #98#return; {18352#true} is VALID [2022-04-28 12:18:42,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 12:18:42,490 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 12:18:42,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {18352#true} call ULTIMATE.init(); {18352#true} is VALID [2022-04-28 12:18:42,491 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 12:18:42,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:18:42,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002319494] [2022-04-28 12:18:42,491 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:18:42,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060089503] [2022-04-28 12:18:42,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060089503] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:18:42,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:18:42,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 12:18:42,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:18:42,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1965633515] [2022-04-28 12:18:42,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1965633515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:18:42,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:18:42,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:18:42,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566849124] [2022-04-28 12:18:42,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:18:42,492 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 12:18:42,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:18:42,492 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 12:18:42,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:18:42,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:18:42,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:18:42,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:18:42,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:18:42,540 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 12:18:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:18:43,977 INFO L93 Difference]: Finished difference Result 234 states and 311 transitions. [2022-04-28 12:18:43,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:18:43,977 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 12:18:43,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:18:43,978 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 12:18:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-28 12:18:43,980 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 12:18:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-28 12:18:43,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 114 transitions. [2022-04-28 12:18:44,116 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 12:18:44,122 INFO L225 Difference]: With dead ends: 234 [2022-04-28 12:18:44,122 INFO L226 Difference]: Without dead ends: 232 [2022-04-28 12:18:44,122 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 12:18:44,123 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 12:18:44,123 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 12:18:44,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-04-28 12:18:44,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2022-04-28 12:18:44,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:18:44,533 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 12:18:44,534 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 12:18:44,534 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 12:18:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:18:44,544 INFO L93 Difference]: Finished difference Result 232 states and 309 transitions. [2022-04-28 12:18:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-28 12:18:44,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:18:44,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:18:44,545 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 12:18:44,546 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 12:18:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:18:44,552 INFO L93 Difference]: Finished difference Result 232 states and 309 transitions. [2022-04-28 12:18:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-28 12:18:44,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:18:44,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:18:44,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:18:44,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:18:44,555 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 12:18:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 306 transitions. [2022-04-28 12:18:44,562 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 306 transitions. Word has length 84 [2022-04-28 12:18:44,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:18:44,562 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 306 transitions. [2022-04-28 12:18:44,562 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 12:18:44,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 306 transitions. [2022-04-28 12:18:45,033 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 12:18:45,033 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 306 transitions. [2022-04-28 12:18:45,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 12:18:45,033 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:18:45,034 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 12:18:45,063 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 12:18:45,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:18:45,256 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:18:45,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:18:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1676300815, now seen corresponding path program 3 times [2022-04-28 12:18:45,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:18:45,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1307569460] [2022-04-28 12:18:45,256 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:18:45,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1676300815, now seen corresponding path program 4 times [2022-04-28 12:18:45,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:18:45,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15420307] [2022-04-28 12:18:45,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:18:45,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:18:45,266 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:18:45,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1686930491] [2022-04-28 12:18:45,267 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:18:45,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:18:45,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:18:45,268 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:18:45,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 12:18:45,323 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:18:45,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:18:45,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:18:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:18:45,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:18:45,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {20267#true} call ULTIMATE.init(); {20267#true} is VALID [2022-04-28 12:18:45,537 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 12:18:45,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 12:18:45,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20267#true} {20267#true} #98#return; {20267#true} is VALID [2022-04-28 12:18:45,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {20267#true} call #t~ret8 := main(); {20267#true} is VALID [2022-04-28 12:18:45,537 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 12:18:45,537 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 12:18:45,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 12:18:45,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 12:18:45,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 12:18:45,537 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20267#true} {20267#true} #78#return; {20267#true} is VALID [2022-04-28 12:18:45,537 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 12:18:45,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 12:18:45,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 12:18:45,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 12:18:45,538 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20267#true} {20267#true} #80#return; {20267#true} is VALID [2022-04-28 12:18:45,538 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 12:18:45,538 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 12:18:45,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 12:18:45,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 12:18:45,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 12:18:45,538 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20267#true} {20267#true} #82#return; {20267#true} is VALID [2022-04-28 12:18:45,538 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 12:18:45,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 12:18:45,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 12:18:45,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 12:18:45,538 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20267#true} {20267#true} #84#return; {20267#true} is VALID [2022-04-28 12:18:45,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {20267#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20267#true} is VALID [2022-04-28 12:18:45,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {20267#true} assume !!(#t~post6 < 10);havoc #t~post6; {20267#true} is VALID [2022-04-28 12:18:45,538 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 12:18:45,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {20267#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20267#true} is VALID [2022-04-28 12:18:45,538 INFO L290 TraceCheckUtils]: 31: Hoare triple {20267#true} assume !!(#t~post7 < 10);havoc #t~post7; {20267#true} is VALID [2022-04-28 12:18:45,539 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 12:18:45,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 12:18:45,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 12:18:45,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 12:18:45,539 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20267#true} {20267#true} #86#return; {20267#true} is VALID [2022-04-28 12:18:45,539 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 12:18:45,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 12:18:45,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 12:18:45,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 12:18:45,539 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20267#true} {20267#true} #88#return; {20267#true} is VALID [2022-04-28 12:18:45,539 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 12:18:45,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 12:18:45,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 12:18:45,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 12:18:45,539 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {20267#true} {20267#true} #90#return; {20267#true} is VALID [2022-04-28 12:18:45,539 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 12:18:45,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 12:18:45,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 12:18:45,540 INFO L290 TraceCheckUtils]: 50: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 12:18:45,540 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {20267#true} {20267#true} #92#return; {20267#true} is VALID [2022-04-28 12:18:45,540 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 12:18:45,540 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 12:18:45,541 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 12:18:45,541 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 12:18:45,541 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 12:18:45,541 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 12:18:45,542 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 12:18:45,542 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 12:18:45,542 INFO L290 TraceCheckUtils]: 60: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 12:18:45,542 INFO L290 TraceCheckUtils]: 61: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 12:18:45,542 INFO L290 TraceCheckUtils]: 62: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 12:18:45,542 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 12:18:45,542 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 12:18:45,542 INFO L290 TraceCheckUtils]: 65: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 12:18:45,542 INFO L290 TraceCheckUtils]: 66: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 12:18:45,543 INFO L290 TraceCheckUtils]: 67: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 12:18:45,543 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 12:18:45,543 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 12:18:45,543 INFO L290 TraceCheckUtils]: 70: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 12:18:45,547 INFO L290 TraceCheckUtils]: 71: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 12:18:45,547 INFO L290 TraceCheckUtils]: 72: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 12:18:45,551 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 12:18:45,552 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 12:18:45,552 INFO L290 TraceCheckUtils]: 75: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-28 12:18:45,552 INFO L290 TraceCheckUtils]: 76: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-28 12:18:45,552 INFO L290 TraceCheckUtils]: 77: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-28 12:18:45,553 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 12:18:45,553 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 12:18:45,553 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 12:18:45,554 INFO L290 TraceCheckUtils]: 81: Hoare triple {20268#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20268#false} is VALID [2022-04-28 12:18:45,554 INFO L290 TraceCheckUtils]: 82: Hoare triple {20268#false} assume !(#t~post6 < 10);havoc #t~post6; {20268#false} is VALID [2022-04-28 12:18:45,554 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 12:18:45,554 INFO L290 TraceCheckUtils]: 84: Hoare triple {20268#false} ~cond := #in~cond; {20268#false} is VALID [2022-04-28 12:18:45,554 INFO L290 TraceCheckUtils]: 85: Hoare triple {20268#false} assume 0 == ~cond; {20268#false} is VALID [2022-04-28 12:18:45,554 INFO L290 TraceCheckUtils]: 86: Hoare triple {20268#false} assume !false; {20268#false} is VALID [2022-04-28 12:18:45,554 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 12:18:45,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:18:45,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:18:45,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15420307] [2022-04-28 12:18:45,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:18:45,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686930491] [2022-04-28 12:18:45,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686930491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:18:45,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:18:45,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:18:45,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:18:45,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1307569460] [2022-04-28 12:18:45,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1307569460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:18:45,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:18:45,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:18:45,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705606499] [2022-04-28 12:18:45,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:18:45,556 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 12:18:45,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:18:45,557 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 12:18:45,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:18:45,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:18:45,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:18:45,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:18:45,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:18:45,606 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 12:18:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:18:46,432 INFO L93 Difference]: Finished difference Result 371 states and 532 transitions. [2022-04-28 12:18:46,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:18:46,432 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 12:18:46,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:18:46,432 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 12:18:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-04-28 12:18:46,434 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 12:18:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-04-28 12:18:46,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 110 transitions. [2022-04-28 12:18:46,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:18:46,546 INFO L225 Difference]: With dead ends: 371 [2022-04-28 12:18:46,547 INFO L226 Difference]: Without dead ends: 291 [2022-04-28 12:18:46,547 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 12:18:46,549 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 12:18:46,550 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 12:18:46,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-04-28 12:18:47,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 257. [2022-04-28 12:18:47,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:18:47,070 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 12:18:47,070 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 12:18:47,071 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 12:18:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:18:47,080 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2022-04-28 12:18:47,080 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 403 transitions. [2022-04-28 12:18:47,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:18:47,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:18:47,082 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 12:18:47,082 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 12:18:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:18:47,091 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2022-04-28 12:18:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 403 transitions. [2022-04-28 12:18:47,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:18:47,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:18:47,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:18:47,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:18:47,093 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 12:18:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 348 transitions. [2022-04-28 12:18:47,101 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 348 transitions. Word has length 87 [2022-04-28 12:18:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:18:47,101 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 348 transitions. [2022-04-28 12:18:47,101 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 12:18:47,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 348 transitions. [2022-04-28 12:18:47,550 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 12:18:47,550 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 348 transitions. [2022-04-28 12:18:47,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 12:18:47,550 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:18:47,551 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 12:18:47,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 12:18:47,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:18:47,751 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:18:47,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:18:47,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1175887352, now seen corresponding path program 1 times [2022-04-28 12:18:47,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:18:47,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2019240283] [2022-04-28 12:18:47,752 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:18:47,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1175887352, now seen corresponding path program 2 times [2022-04-28 12:18:47,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:18:47,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267731981] [2022-04-28 12:18:47,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:18:47,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:18:47,763 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:18:47,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149534985] [2022-04-28 12:18:47,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:18:47,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:18:47,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:18:47,764 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:18:47,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 12:18:47,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:18:47,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:18:47,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 12:18:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:18:47,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:18:50,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {22375#true} call ULTIMATE.init(); {22375#true} is VALID [2022-04-28 12:18:50,321 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 12:18:50,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:18:50,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22375#true} {22375#true} #98#return; {22375#true} is VALID [2022-04-28 12:18:50,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {22375#true} call #t~ret8 := main(); {22375#true} is VALID [2022-04-28 12:18:50,321 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 12:18:50,321 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 12:18:50,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:18:50,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:18:50,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:18:50,321 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22375#true} {22375#true} #78#return; {22375#true} is VALID [2022-04-28 12:18:50,322 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 12:18:50,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:18:50,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:18:50,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:18:50,322 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22375#true} {22375#true} #80#return; {22375#true} is VALID [2022-04-28 12:18:50,322 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 12:18:50,322 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 12:18:50,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:18:50,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:18:50,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:18:50,323 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 12:18:50,323 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 12:18:50,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:18:50,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:18:50,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:18:50,331 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 12:18:50,331 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 12:18:50,332 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 12:18:50,332 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 12:18:50,332 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 12:18:50,333 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 12:18:50,333 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 12:18:50,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:18:50,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:18:50,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:18:50,333 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 12:18:50,333 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 12:18:50,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:18:50,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:18:50,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:18:50,334 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 12:18:50,334 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 12:18:50,334 INFO L290 TraceCheckUtils]: 43: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:18:50,334 INFO L290 TraceCheckUtils]: 44: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:18:50,334 INFO L290 TraceCheckUtils]: 45: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:18:50,335 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 12:18:50,335 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 12:18:50,335 INFO L290 TraceCheckUtils]: 48: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:18:50,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:18:50,335 INFO L290 TraceCheckUtils]: 50: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:18:50,335 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 12:18:50,336 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 12:18:50,336 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 12:18:50,336 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 12:18:50,336 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 12:18:50,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:18:50,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:18:50,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:18:50,337 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 12:18:50,337 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 12:18:50,337 INFO L290 TraceCheckUtils]: 61: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:18:50,337 INFO L290 TraceCheckUtils]: 62: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:18:50,337 INFO L290 TraceCheckUtils]: 63: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:18:50,338 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 12:18:50,338 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 12:18:50,338 INFO L290 TraceCheckUtils]: 66: Hoare triple {22375#true} ~cond := #in~cond; {22579#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:18:50,338 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 12:18:50,339 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 12:18:50,339 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 12:18:50,339 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 12:18:50,339 INFO L290 TraceCheckUtils]: 71: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:18:50,339 INFO L290 TraceCheckUtils]: 72: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:18:50,339 INFO L290 TraceCheckUtils]: 73: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:18:50,340 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 12:18:50,340 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 12:18:50,341 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 12:18:50,341 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 12:18:50,341 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 12:18:50,342 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 12:18:50,342 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 12:18:50,342 INFO L290 TraceCheckUtils]: 81: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:18:50,342 INFO L290 TraceCheckUtils]: 82: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:18:50,342 INFO L290 TraceCheckUtils]: 83: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:18:50,343 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 12:18:50,343 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 12:18:50,344 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 12:18:50,344 INFO L290 TraceCheckUtils]: 87: Hoare triple {22644#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22376#false} is VALID [2022-04-28 12:18:50,344 INFO L290 TraceCheckUtils]: 88: Hoare triple {22376#false} assume !false; {22376#false} is VALID [2022-04-28 12:18:50,344 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 12:18:50,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:19:08,879 INFO L290 TraceCheckUtils]: 88: Hoare triple {22376#false} assume !false; {22376#false} is VALID [2022-04-28 12:19:08,880 INFO L290 TraceCheckUtils]: 87: Hoare triple {22644#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22376#false} is VALID [2022-04-28 12:19:08,880 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 12:19:08,881 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 12:19:08,881 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 12:19:08,882 INFO L290 TraceCheckUtils]: 83: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:19:08,882 INFO L290 TraceCheckUtils]: 82: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:19:08,882 INFO L290 TraceCheckUtils]: 81: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:19:08,882 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 12:19:08,882 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 12:19:08,882 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 12:19:08,883 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 12:19:08,883 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 12:19:08,883 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 12:19:08,884 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 12:19:08,884 INFO L290 TraceCheckUtils]: 73: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:19:08,884 INFO L290 TraceCheckUtils]: 72: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:19:08,884 INFO L290 TraceCheckUtils]: 71: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:19:08,884 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 12:19:08,885 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 12:19:08,885 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 12:19:08,885 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 12:19:08,886 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 12:19:08,886 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 12:19:08,886 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22375#true} {22375#true} #88#return; {22375#true} is VALID [2022-04-28 12:19:08,886 INFO L290 TraceCheckUtils]: 63: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:19:08,886 INFO L290 TraceCheckUtils]: 62: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:19:08,886 INFO L290 TraceCheckUtils]: 61: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:19:08,886 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 12:19:08,886 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22375#true} {22375#true} #86#return; {22375#true} is VALID [2022-04-28 12:19:08,886 INFO L290 TraceCheckUtils]: 58: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:19:08,886 INFO L290 TraceCheckUtils]: 57: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:19:08,887 INFO L290 TraceCheckUtils]: 56: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:19:08,887 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 12:19:08,887 INFO L290 TraceCheckUtils]: 54: Hoare triple {22375#true} assume !!(#t~post7 < 10);havoc #t~post7; {22375#true} is VALID [2022-04-28 12:19:08,887 INFO L290 TraceCheckUtils]: 53: Hoare triple {22375#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22375#true} is VALID [2022-04-28 12:19:08,887 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 12:19:08,887 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {22375#true} {22375#true} #92#return; {22375#true} is VALID [2022-04-28 12:19:08,887 INFO L290 TraceCheckUtils]: 50: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:19:08,887 INFO L290 TraceCheckUtils]: 49: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:19:08,887 INFO L290 TraceCheckUtils]: 48: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:19:08,887 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 12:19:08,887 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22375#true} {22375#true} #90#return; {22375#true} is VALID [2022-04-28 12:19:08,888 INFO L290 TraceCheckUtils]: 45: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:19:08,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:19:08,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:19:08,888 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 12:19:08,888 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22375#true} {22375#true} #88#return; {22375#true} is VALID [2022-04-28 12:19:08,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:19:08,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:19:08,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:19:08,888 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 12:19:08,888 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22375#true} {22375#true} #86#return; {22375#true} is VALID [2022-04-28 12:19:08,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:19:08,889 INFO L290 TraceCheckUtils]: 34: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:19:08,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:19:08,889 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 12:19:08,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {22375#true} assume !!(#t~post7 < 10);havoc #t~post7; {22375#true} is VALID [2022-04-28 12:19:08,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {22375#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22375#true} is VALID [2022-04-28 12:19:08,889 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 12:19:08,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {22375#true} assume !!(#t~post6 < 10);havoc #t~post6; {22375#true} is VALID [2022-04-28 12:19:08,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {22375#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22375#true} is VALID [2022-04-28 12:19:08,889 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22375#true} {22375#true} #84#return; {22375#true} is VALID [2022-04-28 12:19:08,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:19:08,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:19:08,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:19:08,890 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 12:19:08,890 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {22375#true} {22375#true} #82#return; {22375#true} is VALID [2022-04-28 12:19:08,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:19:08,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:19:08,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:19:08,890 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 12:19:08,890 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 12:19:08,890 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22375#true} {22375#true} #80#return; {22375#true} is VALID [2022-04-28 12:19:08,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:19:08,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:19:08,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:19:08,891 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 12:19:08,891 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22375#true} {22375#true} #78#return; {22375#true} is VALID [2022-04-28 12:19:08,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:19:08,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-28 12:19:08,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-28 12:19:08,891 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 12:19:08,891 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 12:19:08,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {22375#true} call #t~ret8 := main(); {22375#true} is VALID [2022-04-28 12:19:08,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22375#true} {22375#true} #98#return; {22375#true} is VALID [2022-04-28 12:19:08,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-28 12:19:08,891 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 12:19:08,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {22375#true} call ULTIMATE.init(); {22375#true} is VALID [2022-04-28 12:19:08,892 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 12:19:08,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:19:08,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267731981] [2022-04-28 12:19:08,892 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:19:08,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149534985] [2022-04-28 12:19:08,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149534985] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:19:08,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:19:08,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-28 12:19:08,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:19:08,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2019240283] [2022-04-28 12:19:08,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2019240283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:19:08,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:19:08,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:19:08,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175097095] [2022-04-28 12:19:08,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:19:08,894 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 12:19:08,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:19:08,894 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 12:19:08,948 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 12:19:08,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:19:08,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:19:08,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:19:08,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-28 12:19:08,949 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 12:19:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:19:10,161 INFO L93 Difference]: Finished difference Result 301 states and 415 transitions. [2022-04-28 12:19:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:19:10,162 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 12:19:10,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:19:10,162 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 12:19:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-28 12:19:10,163 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 12:19:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-28 12:19:10,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 89 transitions. [2022-04-28 12:19:10,264 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 12:19:10,273 INFO L225 Difference]: With dead ends: 301 [2022-04-28 12:19:10,273 INFO L226 Difference]: Without dead ends: 297 [2022-04-28 12:19:10,273 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 12:19:10,274 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 12:19:10,274 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 12:19:10,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-28 12:19:10,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2022-04-28 12:19:10,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:19:10,920 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 12:19:10,921 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 12:19:10,921 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 12:19:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:19:10,930 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2022-04-28 12:19:10,930 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2022-04-28 12:19:10,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:19:10,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:19:10,931 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 12:19:10,932 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 12:19:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:19:10,941 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2022-04-28 12:19:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2022-04-28 12:19:10,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:19:10,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:19:10,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:19:10,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:19:10,943 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 12:19:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 404 transitions. [2022-04-28 12:19:10,953 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 404 transitions. Word has length 89 [2022-04-28 12:19:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:19:10,954 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 404 transitions. [2022-04-28 12:19:10,954 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 12:19:10,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 293 states and 404 transitions. [2022-04-28 12:19:11,620 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 12:19:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 404 transitions. [2022-04-28 12:19:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 12:19:11,620 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:19:11,621 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 12:19:11,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 12:19:11,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 12:19:11,821 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:19:11,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:19:11,822 INFO L85 PathProgramCache]: Analyzing trace with hash -201422586, now seen corresponding path program 1 times [2022-04-28 12:19:11,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:19:11,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [44687953] [2022-04-28 12:19:11,822 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:19:11,822 INFO L85 PathProgramCache]: Analyzing trace with hash -201422586, now seen corresponding path program 2 times [2022-04-28 12:19:11,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:19:11,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137761783] [2022-04-28 12:19:11,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:19:11,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:19:11,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:19:11,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1888036763] [2022-04-28 12:19:11,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:19:11,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:19:11,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:19:11,839 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:19:11,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 12:19:11,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:19:11,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:19:11,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:19:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:19:11,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:19:12,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {24706#true} call ULTIMATE.init(); {24706#true} is VALID [2022-04-28 12:19:12,256 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 12:19:12,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {24714#(<= ~counter~0 0)} assume true; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 12:19:12,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24714#(<= ~counter~0 0)} {24706#true} #98#return; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 12:19:12,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {24714#(<= ~counter~0 0)} call #t~ret8 := main(); {24714#(<= ~counter~0 0)} is VALID [2022-04-28 12:19:12,257 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 12:19:12,258 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 12:19:12,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {24714#(<= ~counter~0 0)} ~cond := #in~cond; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 12:19:12,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {24714#(<= ~counter~0 0)} assume !(0 == ~cond); {24714#(<= ~counter~0 0)} is VALID [2022-04-28 12:19:12,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {24714#(<= ~counter~0 0)} assume true; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 12:19:12,259 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 12:19:12,259 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 12:19:12,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {24714#(<= ~counter~0 0)} ~cond := #in~cond; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 12:19:12,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {24714#(<= ~counter~0 0)} assume !(0 == ~cond); {24714#(<= ~counter~0 0)} is VALID [2022-04-28 12:19:12,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {24714#(<= ~counter~0 0)} assume true; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 12:19:12,260 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 12:19:12,260 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 12:19:12,261 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 12:19:12,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {24714#(<= ~counter~0 0)} ~cond := #in~cond; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 12:19:12,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {24714#(<= ~counter~0 0)} assume !(0 == ~cond); {24714#(<= ~counter~0 0)} is VALID [2022-04-28 12:19:12,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {24714#(<= ~counter~0 0)} assume true; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 12:19:12,262 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 12:19:12,262 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 12:19:12,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {24714#(<= ~counter~0 0)} ~cond := #in~cond; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 12:19:12,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {24714#(<= ~counter~0 0)} assume !(0 == ~cond); {24714#(<= ~counter~0 0)} is VALID [2022-04-28 12:19:12,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {24714#(<= ~counter~0 0)} assume true; {24714#(<= ~counter~0 0)} is VALID [2022-04-28 12:19:12,263 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 12:19:12,264 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 12:19:12,264 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 12:19:12,265 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 12:19:12,265 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 12:19:12,265 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 12:19:12,266 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 12:19:12,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {24803#(<= ~counter~0 2)} ~cond := #in~cond; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 12:19:12,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {24803#(<= ~counter~0 2)} assume !(0 == ~cond); {24803#(<= ~counter~0 2)} is VALID [2022-04-28 12:19:12,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {24803#(<= ~counter~0 2)} assume true; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 12:19:12,267 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 12:19:12,268 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 12:19:12,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {24803#(<= ~counter~0 2)} ~cond := #in~cond; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 12:19:12,268 INFO L290 TraceCheckUtils]: 39: Hoare triple {24803#(<= ~counter~0 2)} assume !(0 == ~cond); {24803#(<= ~counter~0 2)} is VALID [2022-04-28 12:19:12,268 INFO L290 TraceCheckUtils]: 40: Hoare triple {24803#(<= ~counter~0 2)} assume true; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 12:19:12,269 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 12:19:12,269 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 12:19:12,270 INFO L290 TraceCheckUtils]: 43: Hoare triple {24803#(<= ~counter~0 2)} ~cond := #in~cond; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 12:19:12,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {24803#(<= ~counter~0 2)} assume !(0 == ~cond); {24803#(<= ~counter~0 2)} is VALID [2022-04-28 12:19:12,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {24803#(<= ~counter~0 2)} assume true; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 12:19:12,271 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 12:19:12,271 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 12:19:12,271 INFO L290 TraceCheckUtils]: 48: Hoare triple {24803#(<= ~counter~0 2)} ~cond := #in~cond; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 12:19:12,272 INFO L290 TraceCheckUtils]: 49: Hoare triple {24803#(<= ~counter~0 2)} assume !(0 == ~cond); {24803#(<= ~counter~0 2)} is VALID [2022-04-28 12:19:12,272 INFO L290 TraceCheckUtils]: 50: Hoare triple {24803#(<= ~counter~0 2)} assume true; {24803#(<= ~counter~0 2)} is VALID [2022-04-28 12:19:12,273 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 12:19:12,273 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 12:19:12,273 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 12:19:12,274 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 12:19:12,274 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 12:19:12,274 INFO L290 TraceCheckUtils]: 56: Hoare triple {24873#(<= ~counter~0 3)} ~cond := #in~cond; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 12:19:12,274 INFO L290 TraceCheckUtils]: 57: Hoare triple {24873#(<= ~counter~0 3)} assume !(0 == ~cond); {24873#(<= ~counter~0 3)} is VALID [2022-04-28 12:19:12,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {24873#(<= ~counter~0 3)} assume true; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 12:19:12,275 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 12:19:12,276 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 12:19:12,276 INFO L290 TraceCheckUtils]: 61: Hoare triple {24873#(<= ~counter~0 3)} ~cond := #in~cond; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 12:19:12,276 INFO L290 TraceCheckUtils]: 62: Hoare triple {24873#(<= ~counter~0 3)} assume !(0 == ~cond); {24873#(<= ~counter~0 3)} is VALID [2022-04-28 12:19:12,276 INFO L290 TraceCheckUtils]: 63: Hoare triple {24873#(<= ~counter~0 3)} assume true; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 12:19:12,277 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 12:19:12,279 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 12:19:12,280 INFO L290 TraceCheckUtils]: 66: Hoare triple {24873#(<= ~counter~0 3)} ~cond := #in~cond; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 12:19:12,280 INFO L290 TraceCheckUtils]: 67: Hoare triple {24873#(<= ~counter~0 3)} assume !(0 == ~cond); {24873#(<= ~counter~0 3)} is VALID [2022-04-28 12:19:12,280 INFO L290 TraceCheckUtils]: 68: Hoare triple {24873#(<= ~counter~0 3)} assume true; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 12:19:12,281 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 12:19:12,281 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 12:19:12,282 INFO L290 TraceCheckUtils]: 71: Hoare triple {24873#(<= ~counter~0 3)} ~cond := #in~cond; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 12:19:12,282 INFO L290 TraceCheckUtils]: 72: Hoare triple {24873#(<= ~counter~0 3)} assume !(0 == ~cond); {24873#(<= ~counter~0 3)} is VALID [2022-04-28 12:19:12,282 INFO L290 TraceCheckUtils]: 73: Hoare triple {24873#(<= ~counter~0 3)} assume true; {24873#(<= ~counter~0 3)} is VALID [2022-04-28 12:19:12,283 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 12:19:12,283 INFO L290 TraceCheckUtils]: 75: Hoare triple {24873#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {24873#(<= ~counter~0 3)} is VALID [2022-04-28 12:19:12,283 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 12:19:12,284 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 12:19:12,284 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 12:19:12,284 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 12:19:12,285 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 12:19:12,285 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 12:19:12,285 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 12:19:12,285 INFO L290 TraceCheckUtils]: 83: Hoare triple {24707#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24707#false} is VALID [2022-04-28 12:19:12,285 INFO L290 TraceCheckUtils]: 84: Hoare triple {24707#false} assume !(#t~post6 < 10);havoc #t~post6; {24707#false} is VALID [2022-04-28 12:19:12,285 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 12:19:12,285 INFO L290 TraceCheckUtils]: 86: Hoare triple {24707#false} ~cond := #in~cond; {24707#false} is VALID [2022-04-28 12:19:12,285 INFO L290 TraceCheckUtils]: 87: Hoare triple {24707#false} assume 0 == ~cond; {24707#false} is VALID [2022-04-28 12:19:12,285 INFO L290 TraceCheckUtils]: 88: Hoare triple {24707#false} assume !false; {24707#false} is VALID [2022-04-28 12:19:12,286 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 12:19:12,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:19:12,613 INFO L290 TraceCheckUtils]: 88: Hoare triple {24707#false} assume !false; {24707#false} is VALID [2022-04-28 12:19:12,614 INFO L290 TraceCheckUtils]: 87: Hoare triple {24707#false} assume 0 == ~cond; {24707#false} is VALID [2022-04-28 12:19:12,614 INFO L290 TraceCheckUtils]: 86: Hoare triple {24707#false} ~cond := #in~cond; {24707#false} is VALID [2022-04-28 12:19:12,614 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 12:19:12,614 INFO L290 TraceCheckUtils]: 84: Hoare triple {24707#false} assume !(#t~post6 < 10);havoc #t~post6; {24707#false} is VALID [2022-04-28 12:19:12,614 INFO L290 TraceCheckUtils]: 83: Hoare triple {24707#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24707#false} is VALID [2022-04-28 12:19:12,614 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 12:19:12,614 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 12:19:12,615 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 12:19:12,615 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 12:19:12,615 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 12:19:12,616 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 12:19:12,616 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 12:19:12,623 INFO L290 TraceCheckUtils]: 75: Hoare triple {25016#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {25016#(< ~counter~0 9)} is VALID [2022-04-28 12:19:12,624 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24706#true} {25016#(< ~counter~0 9)} #92#return; {25016#(< ~counter~0 9)} is VALID [2022-04-28 12:19:12,624 INFO L290 TraceCheckUtils]: 73: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 12:19:12,624 INFO L290 TraceCheckUtils]: 72: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 12:19:12,624 INFO L290 TraceCheckUtils]: 71: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 12:19:12,624 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 12:19:12,625 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {24706#true} {25016#(< ~counter~0 9)} #90#return; {25016#(< ~counter~0 9)} is VALID [2022-04-28 12:19:12,625 INFO L290 TraceCheckUtils]: 68: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 12:19:12,625 INFO L290 TraceCheckUtils]: 67: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 12:19:12,625 INFO L290 TraceCheckUtils]: 66: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 12:19:12,625 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 12:19:12,626 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24706#true} {25016#(< ~counter~0 9)} #88#return; {25016#(< ~counter~0 9)} is VALID [2022-04-28 12:19:12,626 INFO L290 TraceCheckUtils]: 63: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 12:19:12,626 INFO L290 TraceCheckUtils]: 62: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 12:19:12,626 INFO L290 TraceCheckUtils]: 61: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 12:19:12,626 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 12:19:12,627 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24706#true} {25016#(< ~counter~0 9)} #86#return; {25016#(< ~counter~0 9)} is VALID [2022-04-28 12:19:12,627 INFO L290 TraceCheckUtils]: 58: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 12:19:12,627 INFO L290 TraceCheckUtils]: 57: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 12:19:12,627 INFO L290 TraceCheckUtils]: 56: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 12:19:12,627 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 12:19:12,627 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 12:19:12,628 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 12:19:12,629 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 12:19:12,629 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24706#true} {25089#(< ~counter~0 8)} #92#return; {25089#(< ~counter~0 8)} is VALID [2022-04-28 12:19:12,629 INFO L290 TraceCheckUtils]: 50: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 12:19:12,629 INFO L290 TraceCheckUtils]: 49: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 12:19:12,630 INFO L290 TraceCheckUtils]: 48: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 12:19:12,630 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 12:19:12,630 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24706#true} {25089#(< ~counter~0 8)} #90#return; {25089#(< ~counter~0 8)} is VALID [2022-04-28 12:19:12,630 INFO L290 TraceCheckUtils]: 45: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 12:19:12,630 INFO L290 TraceCheckUtils]: 44: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 12:19:12,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 12:19:12,631 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 12:19:12,631 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24706#true} {25089#(< ~counter~0 8)} #88#return; {25089#(< ~counter~0 8)} is VALID [2022-04-28 12:19:12,631 INFO L290 TraceCheckUtils]: 40: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 12:19:12,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 12:19:12,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 12:19:12,632 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 12:19:12,632 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24706#true} {25089#(< ~counter~0 8)} #86#return; {25089#(< ~counter~0 8)} is VALID [2022-04-28 12:19:12,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 12:19:12,632 INFO L290 TraceCheckUtils]: 34: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 12:19:12,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 12:19:12,632 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 12:19:12,633 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 12:19:12,633 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 12:19:12,633 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 12:19:12,634 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 12:19:12,634 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 12:19:12,635 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24706#true} {25169#(< ~counter~0 6)} #84#return; {25169#(< ~counter~0 6)} is VALID [2022-04-28 12:19:12,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 12:19:12,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 12:19:12,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 12:19:12,635 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 12:19:12,639 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {24706#true} {25169#(< ~counter~0 6)} #82#return; {25169#(< ~counter~0 6)} is VALID [2022-04-28 12:19:12,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 12:19:12,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 12:19:12,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 12:19:12,640 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 12:19:12,640 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 12:19:12,640 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24706#true} {25169#(< ~counter~0 6)} #80#return; {25169#(< ~counter~0 6)} is VALID [2022-04-28 12:19:12,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 12:19:12,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 12:19:12,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 12:19:12,641 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 12:19:12,641 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24706#true} {25169#(< ~counter~0 6)} #78#return; {25169#(< ~counter~0 6)} is VALID [2022-04-28 12:19:12,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-28 12:19:12,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-28 12:19:12,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-28 12:19:12,641 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 12:19:12,642 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 12:19:12,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {25169#(< ~counter~0 6)} call #t~ret8 := main(); {25169#(< ~counter~0 6)} is VALID [2022-04-28 12:19:12,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25169#(< ~counter~0 6)} {24706#true} #98#return; {25169#(< ~counter~0 6)} is VALID [2022-04-28 12:19:12,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {25169#(< ~counter~0 6)} assume true; {25169#(< ~counter~0 6)} is VALID [2022-04-28 12:19:12,643 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 12:19:12,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {24706#true} call ULTIMATE.init(); {24706#true} is VALID [2022-04-28 12:19:12,644 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 12:19:12,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:19:12,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137761783] [2022-04-28 12:19:12,644 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:19:12,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888036763] [2022-04-28 12:19:12,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888036763] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:19:12,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:19:12,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 12:19:12,644 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:19:12,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [44687953] [2022-04-28 12:19:12,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [44687953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:19:12,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:19:12,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:19:12,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412654244] [2022-04-28 12:19:12,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:19:12,645 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 12:19:12,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:19:12,645 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 12:19:12,690 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 12:19:12,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:19:12,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:19:12,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:19:12,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:19:12,691 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 12:19:13,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:19:13,692 INFO L93 Difference]: Finished difference Result 463 states and 647 transitions. [2022-04-28 12:19:13,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 12:19:13,692 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 12:19:13,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:19:13,693 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 12:19:13,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-04-28 12:19:13,696 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 12:19:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-04-28 12:19:13,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 133 transitions. [2022-04-28 12:19:13,829 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 12:19:13,837 INFO L225 Difference]: With dead ends: 463 [2022-04-28 12:19:13,837 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 12:19:13,838 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 12:19:13,839 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 12:19:13,839 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 12:19:13,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 12:19:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2022-04-28 12:19:14,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:19:14,481 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 12:19:14,483 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 12:19:14,484 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 12:19:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:19:14,495 INFO L93 Difference]: Finished difference Result 329 states and 435 transitions. [2022-04-28 12:19:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 435 transitions. [2022-04-28 12:19:14,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:19:14,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:19:14,497 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 12:19:14,498 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 12:19:14,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:19:14,509 INFO L93 Difference]: Finished difference Result 329 states and 435 transitions. [2022-04-28 12:19:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 435 transitions. [2022-04-28 12:19:14,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:19:14,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:19:14,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:19:14,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:19:14,512 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 12:19:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 433 transitions. [2022-04-28 12:19:14,524 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 433 transitions. Word has length 89 [2022-04-28 12:19:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:19:14,524 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 433 transitions. [2022-04-28 12:19:14,524 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 12:19:14,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 433 transitions. [2022-04-28 12:19:15,218 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 12:19:15,218 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 433 transitions. [2022-04-28 12:19:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 12:19:15,219 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:19:15,219 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 12:19:15,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 12:19:15,420 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 12:19:15,420 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:19:15,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:19:15,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 1 times [2022-04-28 12:19:15,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:19:15,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [415453378] [2022-04-28 12:19:15,421 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:19:15,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 2 times [2022-04-28 12:19:15,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:19:15,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570634852] [2022-04-28 12:19:15,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:19:15,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:19:15,437 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:19:15,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009521133] [2022-04-28 12:19:15,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:19:15,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:19:15,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:19:15,439 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 12:19:15,440 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 12:19:15,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:19:15,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:19:15,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-28 12:19:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:19:15,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:19:19,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {27497#true} call ULTIMATE.init(); {27497#true} is VALID [2022-04-28 12:19:19,774 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 12:19:19,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 12:19:19,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27497#true} {27497#true} #98#return; {27497#true} is VALID [2022-04-28 12:19:19,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {27497#true} call #t~ret8 := main(); {27497#true} is VALID [2022-04-28 12:19:19,774 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 12:19:19,774 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 12:19:19,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 12:19:19,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 12:19:19,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 12:19:19,775 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27497#true} {27497#true} #78#return; {27497#true} is VALID [2022-04-28 12:19:19,775 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 12:19:19,775 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 12:19:19,776 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 12:19:19,776 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 12:19:19,777 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 12:19:19,777 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 12:19:19,777 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 12:19:19,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 12:19:19,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 12:19:19,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 12:19:19,778 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 12:19:19,778 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 12:19:19,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 12:19:19,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 12:19:19,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 12:19:19,779 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 12:19:19,780 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 12:19:19,781 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 12:19:19,781 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 12:19:19,782 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 12:19:19,782 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 12:19:19,782 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 12:19:19,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 12:19:19,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 12:19:19,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 12:19:19,783 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 12:19:19,784 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 12:19:19,784 INFO L290 TraceCheckUtils]: 38: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 12:19:19,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 12:19:19,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 12:19:19,785 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 12:19:19,785 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 12:19:19,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 12:19:19,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 12:19:19,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 12:19:19,786 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 12:19:19,786 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 12:19:19,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 12:19:19,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 12:19:19,786 INFO L290 TraceCheckUtils]: 50: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 12:19:19,787 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 12:19:19,789 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 12:19:19,789 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 12:19:19,790 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 12:19:19,790 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 12:19:19,790 INFO L290 TraceCheckUtils]: 56: Hoare triple {27497#true} ~cond := #in~cond; {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:19:19,791 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 12:19:19,791 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 12:19:19,793 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 12:19:19,793 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 12:19:19,793 INFO L290 TraceCheckUtils]: 61: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 12:19:19,793 INFO L290 TraceCheckUtils]: 62: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 12:19:19,793 INFO L290 TraceCheckUtils]: 63: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 12:19:19,794 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 12:19:19,794 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 12:19:19,795 INFO L290 TraceCheckUtils]: 66: Hoare triple {27497#true} ~cond := #in~cond; {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:19:19,795 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 12:19:19,795 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 12:19:19,796 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 12:19:19,796 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 12:19:19,797 INFO L290 TraceCheckUtils]: 71: Hoare triple {27497#true} ~cond := #in~cond; {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:19:19,797 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 12:19:19,797 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 12:19:19,798 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 12:19:19,799 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 12:19:19,800 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 12:19:19,801 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 12:19:19,802 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 12:19:19,802 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 12:19:19,803 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 12:19:19,803 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 12:19:19,803 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 12:19:19,803 INFO L290 TraceCheckUtils]: 83: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 12:19:19,804 INFO L290 TraceCheckUtils]: 84: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 12:19:19,804 INFO L290 TraceCheckUtils]: 85: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 12:19:19,804 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 12:19:19,805 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 12:19:19,805 INFO L290 TraceCheckUtils]: 88: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-28 12:19:19,805 INFO L290 TraceCheckUtils]: 89: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-28 12:19:19,805 INFO L290 TraceCheckUtils]: 90: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-28 12:19:19,806 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 12:19:19,806 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 12:19:19,806 INFO L290 TraceCheckUtils]: 93: Hoare triple {27497#true} ~cond := #in~cond; {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:19:19,806 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 12:19:19,807 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 12:19:19,808 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 12:19:19,811 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 12:19:19,811 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 12:19:19,812 INFO L290 TraceCheckUtils]: 99: Hoare triple {27809#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27498#false} is VALID [2022-04-28 12:19:19,812 INFO L290 TraceCheckUtils]: 100: Hoare triple {27498#false} assume !false; {27498#false} is VALID [2022-04-28 12:19:19,812 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 12:19:19,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:19:53,125 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:20:35,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:20:35,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570634852] [2022-04-28 12:20:35,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:20:35,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009521133] [2022-04-28 12:20:35,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009521133] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 12:20:35,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:20:35,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 12:20:35,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:20:35,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [415453378] [2022-04-28 12:20:35,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [415453378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:20:35,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:20:35,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 12:20:35,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112432606] [2022-04-28 12:20:35,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:20:35,252 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 12:20:35,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:20:35,253 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 12:20:35,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:35,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 12:20:35,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:20:35,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 12:20:35,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=368, Unknown=1, NotChecked=0, Total=462 [2022-04-28 12:20:35,336 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 12:20:49,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:49,345 INFO L93 Difference]: Finished difference Result 339 states and 443 transitions. [2022-04-28 12:20:49,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 12:20:49,345 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 12:20:49,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:20:49,345 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 12:20:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-28 12:20:49,347 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 12:20:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-28 12:20:49,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 118 transitions. [2022-04-28 12:20:49,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:20:49,519 INFO L225 Difference]: With dead ends: 339 [2022-04-28 12:20:49,519 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 12:20:49,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=122, Invalid=527, Unknown=1, NotChecked=0, Total=650 [2022-04-28 12:20:49,520 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 57 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s 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 12:20:49,521 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 12:20:49,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 12:20:50,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-04-28 12:20:50,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:20:50,264 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 12:20:50,265 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 12:20:50,265 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 12:20:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:50,274 INFO L93 Difference]: Finished difference Result 337 states and 441 transitions. [2022-04-28 12:20:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2022-04-28 12:20:50,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:20:50,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:20:50,276 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 12:20:50,277 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 12:20:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:20:50,286 INFO L93 Difference]: Finished difference Result 337 states and 441 transitions. [2022-04-28 12:20:50,286 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2022-04-28 12:20:50,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:20:50,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:20:50,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:20:50,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:20:50,288 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 12:20:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 439 transitions. [2022-04-28 12:20:50,298 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 439 transitions. Word has length 101 [2022-04-28 12:20:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:20:50,299 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 439 transitions. [2022-04-28 12:20:50,299 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 12:20:50,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 335 states and 439 transitions. [2022-04-28 12:20:51,055 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 12:20:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2022-04-28 12:20:51,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 12:20:51,056 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:20:51,057 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 12:20:51,081 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 12:20:51,257 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 12:20:51,257 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:20:51,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:20:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1524088572, now seen corresponding path program 5 times [2022-04-28 12:20:51,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:20:51,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1624022423] [2022-04-28 12:20:51,258 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:20:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1524088572, now seen corresponding path program 6 times [2022-04-28 12:20:51,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:20:51,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842233984] [2022-04-28 12:20:51,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:20:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:20:51,279 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:20:51,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [905590144] [2022-04-28 12:20:51,279 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:20:51,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:20:51,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:20:51,283 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 12:20:51,284 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 12:20:51,372 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 12:20:51,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:20:51,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 12:20:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:20:51,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:20:51,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {29932#true} call ULTIMATE.init(); {29932#true} is VALID [2022-04-28 12:20:51,684 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 12:20:51,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:20:51,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29932#true} {29932#true} #98#return; {29932#true} is VALID [2022-04-28 12:20:51,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {29932#true} call #t~ret8 := main(); {29932#true} is VALID [2022-04-28 12:20:51,684 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 12:20:51,685 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 12:20:51,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:20:51,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:20:51,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:20:51,685 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29932#true} {29932#true} #78#return; {29932#true} is VALID [2022-04-28 12:20:51,685 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 12:20:51,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:20:51,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:20:51,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:20:51,685 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29932#true} {29932#true} #80#return; {29932#true} is VALID [2022-04-28 12:20:51,685 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 12:20:51,685 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 12:20:51,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:20:51,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:20:51,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:20:51,686 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {29932#true} {29932#true} #82#return; {29932#true} is VALID [2022-04-28 12:20:51,686 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 12:20:51,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:20:51,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:20:51,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:20:51,686 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29932#true} {29932#true} #84#return; {29932#true} is VALID [2022-04-28 12:20:51,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {29932#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29932#true} is VALID [2022-04-28 12:20:51,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {29932#true} assume !!(#t~post6 < 10);havoc #t~post6; {29932#true} is VALID [2022-04-28 12:20:51,686 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 12:20:51,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-28 12:20:51,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-28 12:20:51,686 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 12:20:51,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:20:51,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:20:51,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:20:51,687 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29932#true} {29932#true} #86#return; {29932#true} is VALID [2022-04-28 12:20:51,687 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 12:20:51,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:20:51,687 INFO L290 TraceCheckUtils]: 39: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:20:51,687 INFO L290 TraceCheckUtils]: 40: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:20:51,687 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29932#true} {29932#true} #88#return; {29932#true} is VALID [2022-04-28 12:20:51,687 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 12:20:51,687 INFO L290 TraceCheckUtils]: 43: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:20:51,687 INFO L290 TraceCheckUtils]: 44: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:20:51,687 INFO L290 TraceCheckUtils]: 45: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:20:51,687 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29932#true} {29932#true} #90#return; {29932#true} is VALID [2022-04-28 12:20:51,688 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 12:20:51,688 INFO L290 TraceCheckUtils]: 48: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:20:51,688 INFO L290 TraceCheckUtils]: 49: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:20:51,688 INFO L290 TraceCheckUtils]: 50: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:20:51,688 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {29932#true} {29932#true} #92#return; {29932#true} is VALID [2022-04-28 12:20:51,688 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 12:20:51,688 INFO L290 TraceCheckUtils]: 53: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-28 12:20:51,688 INFO L290 TraceCheckUtils]: 54: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-28 12:20:51,688 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 12:20:51,688 INFO L290 TraceCheckUtils]: 56: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:20:51,688 INFO L290 TraceCheckUtils]: 57: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:20:51,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:20:51,688 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29932#true} {29932#true} #86#return; {29932#true} is VALID [2022-04-28 12:20:51,689 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 12:20:51,689 INFO L290 TraceCheckUtils]: 61: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:20:51,689 INFO L290 TraceCheckUtils]: 62: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:20:51,689 INFO L290 TraceCheckUtils]: 63: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:20:51,689 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29932#true} {29932#true} #88#return; {29932#true} is VALID [2022-04-28 12:20:51,689 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 12:20:51,689 INFO L290 TraceCheckUtils]: 66: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:20:51,689 INFO L290 TraceCheckUtils]: 67: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:20:51,689 INFO L290 TraceCheckUtils]: 68: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:20:51,689 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {29932#true} {29932#true} #90#return; {29932#true} is VALID [2022-04-28 12:20:51,689 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 12:20:51,689 INFO L290 TraceCheckUtils]: 71: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:20:51,689 INFO L290 TraceCheckUtils]: 72: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:20:51,690 INFO L290 TraceCheckUtils]: 73: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:20:51,690 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29932#true} {29932#true} #92#return; {29932#true} is VALID [2022-04-28 12:20:51,690 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 12:20:51,690 INFO L290 TraceCheckUtils]: 76: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-28 12:20:51,690 INFO L290 TraceCheckUtils]: 77: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-28 12:20:51,690 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 12:20:51,690 INFO L290 TraceCheckUtils]: 79: Hoare triple {29932#true} ~cond := #in~cond; {30174#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:20:51,691 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 12:20:51,691 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 12:20:51,692 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 12:20:51,692 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 12:20:51,692 INFO L290 TraceCheckUtils]: 84: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:20:51,692 INFO L290 TraceCheckUtils]: 85: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:20:51,692 INFO L290 TraceCheckUtils]: 86: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:20:51,693 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 12:20:51,693 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 12:20:51,693 INFO L290 TraceCheckUtils]: 89: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:20:51,693 INFO L290 TraceCheckUtils]: 90: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:20:51,693 INFO L290 TraceCheckUtils]: 91: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:20:51,694 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 12:20:51,694 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 12:20:51,694 INFO L290 TraceCheckUtils]: 94: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:20:51,694 INFO L290 TraceCheckUtils]: 95: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:20:51,694 INFO L290 TraceCheckUtils]: 96: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:20:51,695 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 12:20:51,697 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 12:20:51,698 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 12:20:51,698 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 12:20:51,699 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 12:20:51,700 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 12:20:51,700 INFO L290 TraceCheckUtils]: 103: Hoare triple {30247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29933#false} is VALID [2022-04-28 12:20:51,700 INFO L290 TraceCheckUtils]: 104: Hoare triple {29933#false} assume !false; {29933#false} is VALID [2022-04-28 12:20:51,700 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 12:20:51,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:21:02,226 INFO L290 TraceCheckUtils]: 104: Hoare triple {29933#false} assume !false; {29933#false} is VALID [2022-04-28 12:21:02,226 INFO L290 TraceCheckUtils]: 103: Hoare triple {30247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29933#false} is VALID [2022-04-28 12:21:02,227 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 12:21:02,227 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 12:21:02,228 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 12:21:02,228 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 12:21:02,230 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 12:21:02,231 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 12:21:02,231 INFO L290 TraceCheckUtils]: 96: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:21:02,231 INFO L290 TraceCheckUtils]: 95: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:21:02,231 INFO L290 TraceCheckUtils]: 94: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:21:02,231 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 12:21:02,232 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 12:21:02,232 INFO L290 TraceCheckUtils]: 91: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:21:02,232 INFO L290 TraceCheckUtils]: 90: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:21:02,232 INFO L290 TraceCheckUtils]: 89: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:21:02,232 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 12:21:02,233 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 12:21:02,233 INFO L290 TraceCheckUtils]: 86: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:21:02,233 INFO L290 TraceCheckUtils]: 85: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:21:02,233 INFO L290 TraceCheckUtils]: 84: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:21:02,233 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 12:21:02,233 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 12:21:02,234 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 12:21:02,234 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 12:21:02,234 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 12:21:02,234 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 12:21:02,234 INFO L290 TraceCheckUtils]: 77: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-28 12:21:02,234 INFO L290 TraceCheckUtils]: 76: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-28 12:21:02,235 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 12:21:02,235 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29932#true} {29932#true} #92#return; {29932#true} is VALID [2022-04-28 12:21:02,235 INFO L290 TraceCheckUtils]: 73: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:21:02,235 INFO L290 TraceCheckUtils]: 72: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:21:02,235 INFO L290 TraceCheckUtils]: 71: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:21:02,235 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 12:21:02,235 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {29932#true} {29932#true} #90#return; {29932#true} is VALID [2022-04-28 12:21:02,235 INFO L290 TraceCheckUtils]: 68: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:21:02,235 INFO L290 TraceCheckUtils]: 67: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:21:02,235 INFO L290 TraceCheckUtils]: 66: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:21:02,235 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 12:21:02,235 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29932#true} {29932#true} #88#return; {29932#true} is VALID [2022-04-28 12:21:02,235 INFO L290 TraceCheckUtils]: 63: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:21:02,235 INFO L290 TraceCheckUtils]: 62: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:21:02,235 INFO L290 TraceCheckUtils]: 61: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:21:02,235 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 12:21:02,235 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29932#true} {29932#true} #86#return; {29932#true} is VALID [2022-04-28 12:21:02,235 INFO L290 TraceCheckUtils]: 58: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:21:02,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:21:02,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:21:02,236 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 12:21:02,236 INFO L290 TraceCheckUtils]: 54: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-28 12:21:02,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-28 12:21:02,236 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 12:21:02,236 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {29932#true} {29932#true} #92#return; {29932#true} is VALID [2022-04-28 12:21:02,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:21:02,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:21:02,236 INFO L290 TraceCheckUtils]: 48: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:21:02,236 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 12:21:02,236 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29932#true} {29932#true} #90#return; {29932#true} is VALID [2022-04-28 12:21:02,236 INFO L290 TraceCheckUtils]: 45: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:21:02,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:21:02,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:21:02,236 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 12:21:02,236 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29932#true} {29932#true} #88#return; {29932#true} is VALID [2022-04-28 12:21:02,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:21:02,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:21:02,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:21:02,236 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 12:21:02,236 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29932#true} {29932#true} #86#return; {29932#true} is VALID [2022-04-28 12:21:02,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:21:02,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:21:02,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:21:02,237 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 12:21:02,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-28 12:21:02,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-28 12:21:02,237 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 12:21:02,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {29932#true} assume !!(#t~post6 < 10);havoc #t~post6; {29932#true} is VALID [2022-04-28 12:21:02,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {29932#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29932#true} is VALID [2022-04-28 12:21:02,237 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29932#true} {29932#true} #84#return; {29932#true} is VALID [2022-04-28 12:21:02,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:21:02,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:21:02,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:21:02,237 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 12:21:02,237 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {29932#true} {29932#true} #82#return; {29932#true} is VALID [2022-04-28 12:21:02,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:21:02,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:21:02,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:21:02,237 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 12:21:02,237 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 12:21:02,238 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29932#true} {29932#true} #80#return; {29932#true} is VALID [2022-04-28 12:21:02,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:21:02,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:21:02,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:21:02,238 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 12:21:02,238 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29932#true} {29932#true} #78#return; {29932#true} is VALID [2022-04-28 12:21:02,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:21:02,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-28 12:21:02,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-28 12:21:02,238 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 12:21:02,238 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 12:21:02,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {29932#true} call #t~ret8 := main(); {29932#true} is VALID [2022-04-28 12:21:02,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29932#true} {29932#true} #98#return; {29932#true} is VALID [2022-04-28 12:21:02,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-28 12:21:02,238 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 12:21:02,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {29932#true} call ULTIMATE.init(); {29932#true} is VALID [2022-04-28 12:21:02,239 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 12:21:02,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:21:02,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842233984] [2022-04-28 12:21:02,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:21:02,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905590144] [2022-04-28 12:21:02,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905590144] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:21:02,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:21:02,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-04-28 12:21:02,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:21:02,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1624022423] [2022-04-28 12:21:02,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1624022423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:21:02,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:21:02,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:21:02,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782522057] [2022-04-28 12:21:02,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:21:02,240 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 12:21:02,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:21:02,241 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 12:21:02,292 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 12:21:02,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:21:02,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:02,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:21:02,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:21:02,292 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 12:21:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:03,095 INFO L93 Difference]: Finished difference Result 341 states and 444 transitions. [2022-04-28 12:21:03,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 12:21:03,095 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 12:21:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:21:03,096 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 12:21:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 12:21:03,096 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 12:21:03,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 12:21:03,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-28 12:21:03,139 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 12:21:03,148 INFO L225 Difference]: With dead ends: 341 [2022-04-28 12:21:03,148 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 12:21:03,148 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 12:21:03,149 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 12:21:03,149 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 12:21:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 12:21:03,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2022-04-28 12:21:03,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:21:03,768 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 12:21:03,769 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 12:21:03,769 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 12:21:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:03,777 INFO L93 Difference]: Finished difference Result 339 states and 442 transitions. [2022-04-28 12:21:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-28 12:21:03,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:03,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:03,779 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 12:21:03,780 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 12:21:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:03,788 INFO L93 Difference]: Finished difference Result 339 states and 442 transitions. [2022-04-28 12:21:03,788 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-28 12:21:03,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:03,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:03,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:21:03,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:21:03,790 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 12:21:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 442 transitions. [2022-04-28 12:21:03,800 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 442 transitions. Word has length 105 [2022-04-28 12:21:03,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:21:03,800 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 442 transitions. [2022-04-28 12:21:03,801 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 12:21:03,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 339 states and 442 transitions. [2022-04-28 12:21:04,414 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 12:21:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-28 12:21:04,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 12:21:04,420 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:21:04,420 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 12:21:04,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-28 12:21:04,627 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 12:21:04,627 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:21:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:21:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1026601615, now seen corresponding path program 3 times [2022-04-28 12:21:04,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:04,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1139089194] [2022-04-28 12:21:04,628 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:21:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1026601615, now seen corresponding path program 4 times [2022-04-28 12:21:04,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:21:04,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275319777] [2022-04-28 12:21:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:21:04,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:21:04,638 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:21:04,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [196842344] [2022-04-28 12:21:04,638 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:21:04,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:21:04,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:21:04,639 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 12:21:04,640 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 12:21:04,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:21:04,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:21:04,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:21:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:21:04,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:21:05,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {32611#true} call ULTIMATE.init(); {32611#true} is VALID [2022-04-28 12:21:05,109 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 12:21:05,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {32619#(<= ~counter~0 0)} assume true; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:05,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32619#(<= ~counter~0 0)} {32611#true} #98#return; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:05,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {32619#(<= ~counter~0 0)} call #t~ret8 := main(); {32619#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:05,110 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 12:21:05,110 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 12:21:05,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {32619#(<= ~counter~0 0)} ~cond := #in~cond; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:05,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {32619#(<= ~counter~0 0)} assume !(0 == ~cond); {32619#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:05,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {32619#(<= ~counter~0 0)} assume true; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:05,112 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 12:21:05,112 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 12:21:05,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {32619#(<= ~counter~0 0)} ~cond := #in~cond; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:05,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {32619#(<= ~counter~0 0)} assume !(0 == ~cond); {32619#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:05,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {32619#(<= ~counter~0 0)} assume true; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:05,113 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 12:21:05,113 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 12:21:05,114 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 12:21:05,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {32619#(<= ~counter~0 0)} ~cond := #in~cond; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:05,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {32619#(<= ~counter~0 0)} assume !(0 == ~cond); {32619#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:05,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {32619#(<= ~counter~0 0)} assume true; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:05,115 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 12:21:05,115 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 12:21:05,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {32619#(<= ~counter~0 0)} ~cond := #in~cond; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:05,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {32619#(<= ~counter~0 0)} assume !(0 == ~cond); {32619#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:05,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {32619#(<= ~counter~0 0)} assume true; {32619#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:05,116 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 12:21:05,117 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 12:21:05,118 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 12:21:05,118 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 12:21:05,118 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 12:21:05,119 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 12:21:05,119 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 12:21:05,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {32708#(<= ~counter~0 2)} ~cond := #in~cond; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:05,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {32708#(<= ~counter~0 2)} assume !(0 == ~cond); {32708#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:05,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {32708#(<= ~counter~0 2)} assume true; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:05,120 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 12:21:05,121 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 12:21:05,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {32708#(<= ~counter~0 2)} ~cond := #in~cond; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:05,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {32708#(<= ~counter~0 2)} assume !(0 == ~cond); {32708#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:05,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {32708#(<= ~counter~0 2)} assume true; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:05,122 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 12:21:05,123 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 12:21:05,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {32708#(<= ~counter~0 2)} ~cond := #in~cond; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:05,123 INFO L290 TraceCheckUtils]: 44: Hoare triple {32708#(<= ~counter~0 2)} assume !(0 == ~cond); {32708#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:05,124 INFO L290 TraceCheckUtils]: 45: Hoare triple {32708#(<= ~counter~0 2)} assume true; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:05,124 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 12:21:05,125 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 12:21:05,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {32708#(<= ~counter~0 2)} ~cond := #in~cond; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:05,125 INFO L290 TraceCheckUtils]: 49: Hoare triple {32708#(<= ~counter~0 2)} assume !(0 == ~cond); {32708#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:05,125 INFO L290 TraceCheckUtils]: 50: Hoare triple {32708#(<= ~counter~0 2)} assume true; {32708#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:05,126 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 12:21:05,126 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 12:21:05,127 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 12:21:05,127 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 12:21:05,128 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 12:21:05,128 INFO L290 TraceCheckUtils]: 56: Hoare triple {32778#(<= ~counter~0 3)} ~cond := #in~cond; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:05,128 INFO L290 TraceCheckUtils]: 57: Hoare triple {32778#(<= ~counter~0 3)} assume !(0 == ~cond); {32778#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:05,128 INFO L290 TraceCheckUtils]: 58: Hoare triple {32778#(<= ~counter~0 3)} assume true; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:05,129 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 12:21:05,129 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 12:21:05,130 INFO L290 TraceCheckUtils]: 61: Hoare triple {32778#(<= ~counter~0 3)} ~cond := #in~cond; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:05,131 INFO L290 TraceCheckUtils]: 62: Hoare triple {32778#(<= ~counter~0 3)} assume !(0 == ~cond); {32778#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:05,131 INFO L290 TraceCheckUtils]: 63: Hoare triple {32778#(<= ~counter~0 3)} assume true; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:05,132 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 12:21:05,132 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 12:21:05,132 INFO L290 TraceCheckUtils]: 66: Hoare triple {32778#(<= ~counter~0 3)} ~cond := #in~cond; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:05,133 INFO L290 TraceCheckUtils]: 67: Hoare triple {32778#(<= ~counter~0 3)} assume !(0 == ~cond); {32778#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:05,133 INFO L290 TraceCheckUtils]: 68: Hoare triple {32778#(<= ~counter~0 3)} assume true; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:05,133 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 12:21:05,134 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 12:21:05,134 INFO L290 TraceCheckUtils]: 71: Hoare triple {32778#(<= ~counter~0 3)} ~cond := #in~cond; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:05,135 INFO L290 TraceCheckUtils]: 72: Hoare triple {32778#(<= ~counter~0 3)} assume !(0 == ~cond); {32778#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:05,135 INFO L290 TraceCheckUtils]: 73: Hoare triple {32778#(<= ~counter~0 3)} assume true; {32778#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:05,135 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 12:21:05,136 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 12:21:05,136 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 12:21:05,136 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 12:21:05,137 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 12:21:05,137 INFO L290 TraceCheckUtils]: 79: Hoare triple {32848#(<= ~counter~0 4)} ~cond := #in~cond; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:05,137 INFO L290 TraceCheckUtils]: 80: Hoare triple {32848#(<= ~counter~0 4)} assume !(0 == ~cond); {32848#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:05,138 INFO L290 TraceCheckUtils]: 81: Hoare triple {32848#(<= ~counter~0 4)} assume true; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:05,138 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 12:21:05,139 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 12:21:05,139 INFO L290 TraceCheckUtils]: 84: Hoare triple {32848#(<= ~counter~0 4)} ~cond := #in~cond; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:05,139 INFO L290 TraceCheckUtils]: 85: Hoare triple {32848#(<= ~counter~0 4)} assume !(0 == ~cond); {32848#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:05,139 INFO L290 TraceCheckUtils]: 86: Hoare triple {32848#(<= ~counter~0 4)} assume true; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:05,140 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 12:21:05,140 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 12:21:05,141 INFO L290 TraceCheckUtils]: 89: Hoare triple {32848#(<= ~counter~0 4)} ~cond := #in~cond; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:05,141 INFO L290 TraceCheckUtils]: 90: Hoare triple {32848#(<= ~counter~0 4)} assume !(0 == ~cond); {32848#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:05,141 INFO L290 TraceCheckUtils]: 91: Hoare triple {32848#(<= ~counter~0 4)} assume true; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:05,142 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 12:21:05,142 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 12:21:05,143 INFO L290 TraceCheckUtils]: 94: Hoare triple {32848#(<= ~counter~0 4)} ~cond := #in~cond; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:05,143 INFO L290 TraceCheckUtils]: 95: Hoare triple {32848#(<= ~counter~0 4)} assume !(0 == ~cond); {32848#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:05,143 INFO L290 TraceCheckUtils]: 96: Hoare triple {32848#(<= ~counter~0 4)} assume true; {32848#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:05,144 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 12:21:05,144 INFO L290 TraceCheckUtils]: 98: Hoare triple {32848#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {32848#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:05,144 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 12:21:05,145 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 12:21:05,145 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 12:21:05,145 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 12:21:05,145 INFO L290 TraceCheckUtils]: 103: Hoare triple {32612#false} ~cond := #in~cond; {32612#false} is VALID [2022-04-28 12:21:05,145 INFO L290 TraceCheckUtils]: 104: Hoare triple {32612#false} assume 0 == ~cond; {32612#false} is VALID [2022-04-28 12:21:05,145 INFO L290 TraceCheckUtils]: 105: Hoare triple {32612#false} assume !false; {32612#false} is VALID [2022-04-28 12:21:05,145 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 12:21:05,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:21:05,544 INFO L290 TraceCheckUtils]: 105: Hoare triple {32612#false} assume !false; {32612#false} is VALID [2022-04-28 12:21:05,545 INFO L290 TraceCheckUtils]: 104: Hoare triple {32612#false} assume 0 == ~cond; {32612#false} is VALID [2022-04-28 12:21:05,545 INFO L290 TraceCheckUtils]: 103: Hoare triple {32612#false} ~cond := #in~cond; {32612#false} is VALID [2022-04-28 12:21:05,545 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 12:21:05,545 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 12:21:05,545 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 12:21:05,546 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 12:21:05,546 INFO L290 TraceCheckUtils]: 98: Hoare triple {32953#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {32953#(< ~counter~0 10)} is VALID [2022-04-28 12:21:05,546 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {32611#true} {32953#(< ~counter~0 10)} #92#return; {32953#(< ~counter~0 10)} is VALID [2022-04-28 12:21:05,546 INFO L290 TraceCheckUtils]: 96: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 12:21:05,547 INFO L290 TraceCheckUtils]: 95: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 12:21:05,547 INFO L290 TraceCheckUtils]: 94: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 12:21:05,547 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 12:21:05,547 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32611#true} {32953#(< ~counter~0 10)} #90#return; {32953#(< ~counter~0 10)} is VALID [2022-04-28 12:21:05,547 INFO L290 TraceCheckUtils]: 91: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 12:21:05,547 INFO L290 TraceCheckUtils]: 90: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 12:21:05,547 INFO L290 TraceCheckUtils]: 89: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 12:21:05,547 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 12:21:05,548 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32611#true} {32953#(< ~counter~0 10)} #88#return; {32953#(< ~counter~0 10)} is VALID [2022-04-28 12:21:05,548 INFO L290 TraceCheckUtils]: 86: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 12:21:05,548 INFO L290 TraceCheckUtils]: 85: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 12:21:05,548 INFO L290 TraceCheckUtils]: 84: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 12:21:05,548 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 12:21:05,549 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {32611#true} {32953#(< ~counter~0 10)} #86#return; {32953#(< ~counter~0 10)} is VALID [2022-04-28 12:21:05,549 INFO L290 TraceCheckUtils]: 81: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 12:21:05,549 INFO L290 TraceCheckUtils]: 80: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 12:21:05,549 INFO L290 TraceCheckUtils]: 79: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 12:21:05,549 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 12:21:05,549 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 12:21:05,550 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 12:21:05,550 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 12:21:05,551 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {32611#true} {33026#(< ~counter~0 9)} #92#return; {33026#(< ~counter~0 9)} is VALID [2022-04-28 12:21:05,551 INFO L290 TraceCheckUtils]: 73: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 12:21:05,551 INFO L290 TraceCheckUtils]: 72: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 12:21:05,551 INFO L290 TraceCheckUtils]: 71: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 12:21:05,551 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 12:21:05,551 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {32611#true} {33026#(< ~counter~0 9)} #90#return; {33026#(< ~counter~0 9)} is VALID [2022-04-28 12:21:05,552 INFO L290 TraceCheckUtils]: 68: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 12:21:05,552 INFO L290 TraceCheckUtils]: 67: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 12:21:05,552 INFO L290 TraceCheckUtils]: 66: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 12:21:05,552 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 12:21:05,552 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32611#true} {33026#(< ~counter~0 9)} #88#return; {33026#(< ~counter~0 9)} is VALID [2022-04-28 12:21:05,552 INFO L290 TraceCheckUtils]: 63: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 12:21:05,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 12:21:05,552 INFO L290 TraceCheckUtils]: 61: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 12:21:05,552 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 12:21:05,553 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32611#true} {33026#(< ~counter~0 9)} #86#return; {33026#(< ~counter~0 9)} is VALID [2022-04-28 12:21:05,553 INFO L290 TraceCheckUtils]: 58: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 12:21:05,553 INFO L290 TraceCheckUtils]: 57: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 12:21:05,553 INFO L290 TraceCheckUtils]: 56: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 12:21:05,553 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 12:21:05,553 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 12:21:05,554 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 12:21:05,554 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 12:21:05,555 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {32611#true} {33096#(< ~counter~0 8)} #92#return; {33096#(< ~counter~0 8)} is VALID [2022-04-28 12:21:05,555 INFO L290 TraceCheckUtils]: 50: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 12:21:05,555 INFO L290 TraceCheckUtils]: 49: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 12:21:05,555 INFO L290 TraceCheckUtils]: 48: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 12:21:05,555 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 12:21:05,555 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {32611#true} {33096#(< ~counter~0 8)} #90#return; {33096#(< ~counter~0 8)} is VALID [2022-04-28 12:21:05,556 INFO L290 TraceCheckUtils]: 45: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 12:21:05,556 INFO L290 TraceCheckUtils]: 44: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 12:21:05,556 INFO L290 TraceCheckUtils]: 43: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 12:21:05,556 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 12:21:05,556 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {32611#true} {33096#(< ~counter~0 8)} #88#return; {33096#(< ~counter~0 8)} is VALID [2022-04-28 12:21:05,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 12:21:05,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 12:21:05,556 INFO L290 TraceCheckUtils]: 38: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 12:21:05,556 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 12:21:05,557 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {32611#true} {33096#(< ~counter~0 8)} #86#return; {33096#(< ~counter~0 8)} is VALID [2022-04-28 12:21:05,557 INFO L290 TraceCheckUtils]: 35: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 12:21:05,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 12:21:05,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 12:21:05,557 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 12:21:05,557 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 12:21:05,558 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 12:21:05,558 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 12:21:05,558 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 12:21:05,559 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 12:21:05,559 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {32611#true} {33176#(< ~counter~0 6)} #84#return; {33176#(< ~counter~0 6)} is VALID [2022-04-28 12:21:05,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 12:21:05,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 12:21:05,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 12:21:05,559 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 12:21:05,560 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {32611#true} {33176#(< ~counter~0 6)} #82#return; {33176#(< ~counter~0 6)} is VALID [2022-04-28 12:21:05,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 12:21:05,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 12:21:05,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 12:21:05,560 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 12:21:05,560 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 12:21:05,561 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32611#true} {33176#(< ~counter~0 6)} #80#return; {33176#(< ~counter~0 6)} is VALID [2022-04-28 12:21:05,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 12:21:05,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 12:21:05,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 12:21:05,561 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 12:21:05,561 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32611#true} {33176#(< ~counter~0 6)} #78#return; {33176#(< ~counter~0 6)} is VALID [2022-04-28 12:21:05,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-28 12:21:05,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-28 12:21:05,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-28 12:21:05,561 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 12:21:05,562 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 12:21:05,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {33176#(< ~counter~0 6)} call #t~ret8 := main(); {33176#(< ~counter~0 6)} is VALID [2022-04-28 12:21:05,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33176#(< ~counter~0 6)} {32611#true} #98#return; {33176#(< ~counter~0 6)} is VALID [2022-04-28 12:21:05,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {33176#(< ~counter~0 6)} assume true; {33176#(< ~counter~0 6)} is VALID [2022-04-28 12:21:05,563 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 12:21:05,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {32611#true} call ULTIMATE.init(); {32611#true} is VALID [2022-04-28 12:21:05,563 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 12:21:05,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:21:05,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275319777] [2022-04-28 12:21:05,563 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:21:05,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196842344] [2022-04-28 12:21:05,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196842344] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:21:05,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:21:05,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 12:21:05,564 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:21:05,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1139089194] [2022-04-28 12:21:05,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1139089194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:21:05,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:21:05,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:21:05,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104260346] [2022-04-28 12:21:05,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:21:05,565 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 12:21:05,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:21:05,565 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 12:21:05,619 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 12:21:05,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:21:05,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:05,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:21:05,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:21:05,620 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 12:21:06,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:06,515 INFO L93 Difference]: Finished difference Result 349 states and 452 transitions. [2022-04-28 12:21:06,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 12:21:06,515 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 12:21:06,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:21:06,515 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 12:21:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-28 12:21:06,516 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 12:21:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-28 12:21:06,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2022-04-28 12:21:06,617 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 12:21:06,626 INFO L225 Difference]: With dead ends: 349 [2022-04-28 12:21:06,626 INFO L226 Difference]: Without dead ends: 342 [2022-04-28 12:21:06,627 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 12:21:06,627 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 12:21:06,627 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 12:21:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-28 12:21:07,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-28 12:21:07,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:21:07,319 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 12:21:07,319 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 12:21:07,323 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 12:21:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:07,331 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2022-04-28 12:21:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-28 12:21:07,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:07,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:07,333 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 12:21:07,333 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 12:21:07,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:07,342 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2022-04-28 12:21:07,342 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-28 12:21:07,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:07,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:07,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:21:07,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:21:07,343 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 12:21:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 445 transitions. [2022-04-28 12:21:07,353 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 445 transitions. Word has length 106 [2022-04-28 12:21:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:21:07,354 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 445 transitions. [2022-04-28 12:21:07,354 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 12:21:07,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 445 transitions. [2022-04-28 12:21:08,106 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 12:21:08,106 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-28 12:21:08,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 12:21:08,107 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:21:08,107 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 12:21:08,123 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 12:21:08,311 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 12:21:08,311 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:21:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:21:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1761848073, now seen corresponding path program 3 times [2022-04-28 12:21:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:08,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1773204503] [2022-04-28 12:21:08,312 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:21:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1761848073, now seen corresponding path program 4 times [2022-04-28 12:21:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:21:08,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744282470] [2022-04-28 12:21:08,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:21:08,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:21:08,329 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:21:08,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1113709614] [2022-04-28 12:21:08,329 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:21:08,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:21:08,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:21:08,330 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 12:21:08,333 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 12:21:08,381 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:21:08,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:21:08,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 12:21:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:21:08,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:21:09,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {35332#true} call ULTIMATE.init(); {35332#true} is VALID [2022-04-28 12:21:09,452 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 12:21:09,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 12:21:09,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35332#true} {35332#true} #98#return; {35332#true} is VALID [2022-04-28 12:21:09,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {35332#true} call #t~ret8 := main(); {35332#true} is VALID [2022-04-28 12:21:09,452 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 12:21:09,452 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 12:21:09,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 12:21:09,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 12:21:09,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 12:21:09,452 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35332#true} {35332#true} #78#return; {35332#true} is VALID [2022-04-28 12:21:09,452 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 12:21:09,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 12:21:09,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 12:21:09,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 12:21:09,453 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35332#true} {35332#true} #80#return; {35332#true} is VALID [2022-04-28 12:21:09,453 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 12:21:09,453 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 12:21:09,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 12:21:09,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 12:21:09,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 12:21:09,454 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 12:21:09,454 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 12:21:09,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 12:21:09,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 12:21:09,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 12:21:09,455 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 12:21:09,455 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 12:21:09,455 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 12:21:09,456 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 12:21:09,456 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 12:21:09,456 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 12:21:09,457 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 12:21:09,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 12:21:09,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 12:21:09,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 12:21:09,457 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 12:21:09,457 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 12:21:09,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 12:21:09,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 12:21:09,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 12:21:09,458 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 12:21:09,458 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 12:21:09,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 12:21:09,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 12:21:09,458 INFO L290 TraceCheckUtils]: 45: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 12:21:09,459 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 12:21:09,459 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 12:21:09,459 INFO L290 TraceCheckUtils]: 48: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 12:21:09,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 12:21:09,459 INFO L290 TraceCheckUtils]: 50: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 12:21:09,460 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 12:21:09,461 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 12:21:09,461 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 12:21:09,462 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 12:21:09,462 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 12:21:09,462 INFO L290 TraceCheckUtils]: 56: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 12:21:09,462 INFO L290 TraceCheckUtils]: 57: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 12:21:09,462 INFO L290 TraceCheckUtils]: 58: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 12:21:09,463 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 12:21:09,464 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 12:21:09,464 INFO L290 TraceCheckUtils]: 61: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 12:21:09,464 INFO L290 TraceCheckUtils]: 62: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 12:21:09,464 INFO L290 TraceCheckUtils]: 63: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 12:21:09,464 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 12:21:09,464 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 12:21:09,464 INFO L290 TraceCheckUtils]: 66: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 12:21:09,464 INFO L290 TraceCheckUtils]: 67: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 12:21:09,465 INFO L290 TraceCheckUtils]: 68: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 12:21:09,465 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 12:21:09,465 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 12:21:09,465 INFO L290 TraceCheckUtils]: 71: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 12:21:09,465 INFO L290 TraceCheckUtils]: 72: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 12:21:09,465 INFO L290 TraceCheckUtils]: 73: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 12:21:09,466 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 12:21:09,467 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 12:21:09,467 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 12:21:09,468 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 12:21:09,468 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 12:21:09,468 INFO L290 TraceCheckUtils]: 79: Hoare triple {35332#true} ~cond := #in~cond; {35578#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:21:09,468 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 12:21:09,469 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 12:21:09,470 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 12:21:09,470 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 12:21:09,470 INFO L290 TraceCheckUtils]: 84: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 12:21:09,470 INFO L290 TraceCheckUtils]: 85: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 12:21:09,470 INFO L290 TraceCheckUtils]: 86: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 12:21:09,471 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 12:21:09,471 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 12:21:09,471 INFO L290 TraceCheckUtils]: 89: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 12:21:09,471 INFO L290 TraceCheckUtils]: 90: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 12:21:09,471 INFO L290 TraceCheckUtils]: 91: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 12:21:09,471 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 12:21:09,471 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 12:21:09,472 INFO L290 TraceCheckUtils]: 94: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-28 12:21:09,472 INFO L290 TraceCheckUtils]: 95: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-28 12:21:09,472 INFO L290 TraceCheckUtils]: 96: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-28 12:21:09,472 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 12:21:09,473 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 12:21:09,474 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 12:21:09,475 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 12:21:09,475 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 12:21:09,476 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 12:21:09,476 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 12:21:09,476 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 12:21:09,477 INFO L290 TraceCheckUtils]: 105: Hoare triple {35659#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35333#false} is VALID [2022-04-28 12:21:09,477 INFO L290 TraceCheckUtils]: 106: Hoare triple {35333#false} assume !false; {35333#false} is VALID [2022-04-28 12:21:09,477 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 12:21:09,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:21:20,663 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:21:20,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:21:20,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744282470] [2022-04-28 12:21:20,809 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:21:20,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113709614] [2022-04-28 12:21:20,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113709614] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 12:21:20,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:21:20,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 12:21:20,809 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:21:20,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1773204503] [2022-04-28 12:21:20,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1773204503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:21:20,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:21:20,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:21:20,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708738820] [2022-04-28 12:21:20,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:21:20,810 INFO L78 Accepts]: Start accepts. Automaton has has 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 12:21:20,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:21:20,810 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 12:21:20,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:20,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:21:20,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:20,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:21:20,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-28 12:21:20,887 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 12:21:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:23,831 INFO L93 Difference]: Finished difference Result 369 states and 485 transitions. [2022-04-28 12:21:23,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 12:21:23,831 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 12:21:23,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:21:23,832 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 12:21:23,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2022-04-28 12:21:23,834 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 12:21:23,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2022-04-28 12:21:23,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 125 transitions. [2022-04-28 12:21:24,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:24,013 INFO L225 Difference]: With dead ends: 369 [2022-04-28 12:21:24,013 INFO L226 Difference]: Without dead ends: 366 [2022-04-28 12:21:24,013 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 12:21:24,013 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 33 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:21:24,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 352 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 12:21:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-04-28 12:21:24,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2022-04-28 12:21:24,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:21:24,697 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 12:21:24,698 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 12:21:24,698 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 12:21:24,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:24,707 INFO L93 Difference]: Finished difference Result 366 states and 481 transitions. [2022-04-28 12:21:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 481 transitions. [2022-04-28 12:21:24,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:24,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:24,709 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 12:21:24,709 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 12:21:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:24,719 INFO L93 Difference]: Finished difference Result 366 states and 481 transitions. [2022-04-28 12:21:24,719 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 481 transitions. [2022-04-28 12:21:24,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:24,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:24,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:21:24,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:21:24,720 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 12:21:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 479 transitions. [2022-04-28 12:21:24,732 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 479 transitions. Word has length 107 [2022-04-28 12:21:24,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:21:24,732 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 479 transitions. [2022-04-28 12:21:24,732 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 12:21:24,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 479 transitions. [2022-04-28 12:21:25,436 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 12:21:25,436 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 479 transitions. [2022-04-28 12:21:25,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-28 12:21:25,437 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:21:25,437 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 12:21:25,453 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 12:21:25,637 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 12:21:25,638 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:21:25,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:21:25,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1514731471, now seen corresponding path program 5 times [2022-04-28 12:21:25,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:25,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2124768704] [2022-04-28 12:21:25,638 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:21:25,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1514731471, now seen corresponding path program 6 times [2022-04-28 12:21:25,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:21:25,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945293043] [2022-04-28 12:21:25,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:21:25,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:21:25,653 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:21:25,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845758396] [2022-04-28 12:21:25,654 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:21:25,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:21:25,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:21:25,655 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 12:21:25,656 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 12:21:25,747 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 12:21:25,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:21:25,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 12:21:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:21:25,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:21:26,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {37950#true} call ULTIMATE.init(); {37950#true} is VALID [2022-04-28 12:21:26,222 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 12:21:26,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {37958#(<= ~counter~0 0)} assume true; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:26,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37958#(<= ~counter~0 0)} {37950#true} #98#return; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:26,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {37958#(<= ~counter~0 0)} call #t~ret8 := main(); {37958#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:26,223 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 12:21:26,224 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 12:21:26,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {37958#(<= ~counter~0 0)} ~cond := #in~cond; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:26,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {37958#(<= ~counter~0 0)} assume !(0 == ~cond); {37958#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:26,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {37958#(<= ~counter~0 0)} assume true; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:26,225 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 12:21:26,225 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 12:21:26,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {37958#(<= ~counter~0 0)} ~cond := #in~cond; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:26,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {37958#(<= ~counter~0 0)} assume !(0 == ~cond); {37958#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:26,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {37958#(<= ~counter~0 0)} assume true; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:26,227 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 12:21:26,227 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 12:21:26,227 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 12:21:26,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {37958#(<= ~counter~0 0)} ~cond := #in~cond; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:26,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {37958#(<= ~counter~0 0)} assume !(0 == ~cond); {37958#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:26,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {37958#(<= ~counter~0 0)} assume true; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:26,229 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 12:21:26,229 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 12:21:26,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {37958#(<= ~counter~0 0)} ~cond := #in~cond; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:26,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {37958#(<= ~counter~0 0)} assume !(0 == ~cond); {37958#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:26,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {37958#(<= ~counter~0 0)} assume true; {37958#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:26,231 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 12:21:26,232 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 12:21:26,232 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 12:21:26,232 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 12:21:26,233 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 12:21:26,233 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 12:21:26,234 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 12:21:26,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {38047#(<= ~counter~0 2)} ~cond := #in~cond; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:26,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {38047#(<= ~counter~0 2)} assume !(0 == ~cond); {38047#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:26,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {38047#(<= ~counter~0 2)} assume true; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:26,235 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 12:21:26,236 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 12:21:26,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {38047#(<= ~counter~0 2)} ~cond := #in~cond; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:26,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {38047#(<= ~counter~0 2)} assume !(0 == ~cond); {38047#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:26,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {38047#(<= ~counter~0 2)} assume true; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:26,237 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 12:21:26,238 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 12:21:26,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {38047#(<= ~counter~0 2)} ~cond := #in~cond; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:26,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {38047#(<= ~counter~0 2)} assume !(0 == ~cond); {38047#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:26,239 INFO L290 TraceCheckUtils]: 45: Hoare triple {38047#(<= ~counter~0 2)} assume true; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:26,239 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 12:21:26,240 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 12:21:26,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {38047#(<= ~counter~0 2)} ~cond := #in~cond; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:26,241 INFO L290 TraceCheckUtils]: 49: Hoare triple {38047#(<= ~counter~0 2)} assume !(0 == ~cond); {38047#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:26,241 INFO L290 TraceCheckUtils]: 50: Hoare triple {38047#(<= ~counter~0 2)} assume true; {38047#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:26,242 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 12:21:26,242 INFO L290 TraceCheckUtils]: 52: Hoare triple {38047#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {38047#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:26,242 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 12:21:26,243 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 12:21:26,244 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 12:21:26,244 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 12:21:26,244 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 12:21:26,245 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 12:21:26,245 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 12:21:26,246 INFO L290 TraceCheckUtils]: 60: Hoare triple {38130#(<= ~counter~0 4)} ~cond := #in~cond; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,246 INFO L290 TraceCheckUtils]: 61: Hoare triple {38130#(<= ~counter~0 4)} assume !(0 == ~cond); {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,246 INFO L290 TraceCheckUtils]: 62: Hoare triple {38130#(<= ~counter~0 4)} assume true; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,247 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 12:21:26,247 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 12:21:26,248 INFO L290 TraceCheckUtils]: 65: Hoare triple {38130#(<= ~counter~0 4)} ~cond := #in~cond; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,248 INFO L290 TraceCheckUtils]: 66: Hoare triple {38130#(<= ~counter~0 4)} assume !(0 == ~cond); {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,248 INFO L290 TraceCheckUtils]: 67: Hoare triple {38130#(<= ~counter~0 4)} assume true; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,249 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 12:21:26,249 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 12:21:26,250 INFO L290 TraceCheckUtils]: 70: Hoare triple {38130#(<= ~counter~0 4)} ~cond := #in~cond; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,250 INFO L290 TraceCheckUtils]: 71: Hoare triple {38130#(<= ~counter~0 4)} assume !(0 == ~cond); {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,251 INFO L290 TraceCheckUtils]: 72: Hoare triple {38130#(<= ~counter~0 4)} assume true; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,251 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 12:21:26,252 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 12:21:26,252 INFO L290 TraceCheckUtils]: 75: Hoare triple {38130#(<= ~counter~0 4)} ~cond := #in~cond; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,253 INFO L290 TraceCheckUtils]: 76: Hoare triple {38130#(<= ~counter~0 4)} assume !(0 == ~cond); {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,253 INFO L290 TraceCheckUtils]: 77: Hoare triple {38130#(<= ~counter~0 4)} assume true; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,254 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 12:21:26,254 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 12:21:26,255 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 12:21:26,255 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 12:21:26,256 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 12:21:26,256 INFO L290 TraceCheckUtils]: 83: Hoare triple {38200#(<= ~counter~0 5)} ~cond := #in~cond; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:26,256 INFO L290 TraceCheckUtils]: 84: Hoare triple {38200#(<= ~counter~0 5)} assume !(0 == ~cond); {38200#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:26,256 INFO L290 TraceCheckUtils]: 85: Hoare triple {38200#(<= ~counter~0 5)} assume true; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:26,257 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 12:21:26,258 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 12:21:26,258 INFO L290 TraceCheckUtils]: 88: Hoare triple {38200#(<= ~counter~0 5)} ~cond := #in~cond; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:26,258 INFO L290 TraceCheckUtils]: 89: Hoare triple {38200#(<= ~counter~0 5)} assume !(0 == ~cond); {38200#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:26,259 INFO L290 TraceCheckUtils]: 90: Hoare triple {38200#(<= ~counter~0 5)} assume true; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:26,259 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 12:21:26,260 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 12:21:26,260 INFO L290 TraceCheckUtils]: 93: Hoare triple {38200#(<= ~counter~0 5)} ~cond := #in~cond; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:26,260 INFO L290 TraceCheckUtils]: 94: Hoare triple {38200#(<= ~counter~0 5)} assume !(0 == ~cond); {38200#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:26,261 INFO L290 TraceCheckUtils]: 95: Hoare triple {38200#(<= ~counter~0 5)} assume true; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:26,261 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 12:21:26,262 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 12:21:26,262 INFO L290 TraceCheckUtils]: 98: Hoare triple {38200#(<= ~counter~0 5)} ~cond := #in~cond; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:26,262 INFO L290 TraceCheckUtils]: 99: Hoare triple {38200#(<= ~counter~0 5)} assume !(0 == ~cond); {38200#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:26,263 INFO L290 TraceCheckUtils]: 100: Hoare triple {38200#(<= ~counter~0 5)} assume true; {38200#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:26,263 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 12:21:26,264 INFO L290 TraceCheckUtils]: 102: Hoare triple {38200#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {38200#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:26,264 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 12:21:26,264 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 12:21:26,265 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 12:21:26,265 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 12:21:26,265 INFO L290 TraceCheckUtils]: 107: Hoare triple {37951#false} ~cond := #in~cond; {37951#false} is VALID [2022-04-28 12:21:26,265 INFO L290 TraceCheckUtils]: 108: Hoare triple {37951#false} assume 0 == ~cond; {37951#false} is VALID [2022-04-28 12:21:26,265 INFO L290 TraceCheckUtils]: 109: Hoare triple {37951#false} assume !false; {37951#false} is VALID [2022-04-28 12:21:26,266 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 12:21:26,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:21:26,714 INFO L290 TraceCheckUtils]: 109: Hoare triple {37951#false} assume !false; {37951#false} is VALID [2022-04-28 12:21:26,714 INFO L290 TraceCheckUtils]: 108: Hoare triple {37951#false} assume 0 == ~cond; {37951#false} is VALID [2022-04-28 12:21:26,714 INFO L290 TraceCheckUtils]: 107: Hoare triple {37951#false} ~cond := #in~cond; {37951#false} is VALID [2022-04-28 12:21:26,714 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 12:21:26,715 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 12:21:26,715 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 12:21:26,715 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 12:21:26,715 INFO L290 TraceCheckUtils]: 102: Hoare triple {38305#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {38305#(< ~counter~0 10)} is VALID [2022-04-28 12:21:26,723 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {37950#true} {38305#(< ~counter~0 10)} #92#return; {38305#(< ~counter~0 10)} is VALID [2022-04-28 12:21:26,723 INFO L290 TraceCheckUtils]: 100: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 12:21:26,723 INFO L290 TraceCheckUtils]: 99: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 12:21:26,723 INFO L290 TraceCheckUtils]: 98: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 12:21:26,723 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 12:21:26,723 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {37950#true} {38305#(< ~counter~0 10)} #90#return; {38305#(< ~counter~0 10)} is VALID [2022-04-28 12:21:26,724 INFO L290 TraceCheckUtils]: 95: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 12:21:26,724 INFO L290 TraceCheckUtils]: 94: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 12:21:26,724 INFO L290 TraceCheckUtils]: 93: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 12:21:26,724 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 12:21:26,724 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {37950#true} {38305#(< ~counter~0 10)} #88#return; {38305#(< ~counter~0 10)} is VALID [2022-04-28 12:21:26,724 INFO L290 TraceCheckUtils]: 90: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 12:21:26,724 INFO L290 TraceCheckUtils]: 89: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 12:21:26,724 INFO L290 TraceCheckUtils]: 88: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 12:21:26,724 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 12:21:26,725 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {37950#true} {38305#(< ~counter~0 10)} #86#return; {38305#(< ~counter~0 10)} is VALID [2022-04-28 12:21:26,725 INFO L290 TraceCheckUtils]: 85: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 12:21:26,725 INFO L290 TraceCheckUtils]: 84: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 12:21:26,725 INFO L290 TraceCheckUtils]: 83: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 12:21:26,725 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 12:21:26,725 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 12:21:26,726 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 12:21:26,727 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 12:21:26,727 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {37950#true} {38378#(< ~counter~0 9)} #92#return; {38378#(< ~counter~0 9)} is VALID [2022-04-28 12:21:26,727 INFO L290 TraceCheckUtils]: 77: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 12:21:26,727 INFO L290 TraceCheckUtils]: 76: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 12:21:26,727 INFO L290 TraceCheckUtils]: 75: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 12:21:26,727 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 12:21:26,728 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {37950#true} {38378#(< ~counter~0 9)} #90#return; {38378#(< ~counter~0 9)} is VALID [2022-04-28 12:21:26,728 INFO L290 TraceCheckUtils]: 72: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 12:21:26,728 INFO L290 TraceCheckUtils]: 71: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 12:21:26,728 INFO L290 TraceCheckUtils]: 70: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 12:21:26,728 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 12:21:26,729 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {37950#true} {38378#(< ~counter~0 9)} #88#return; {38378#(< ~counter~0 9)} is VALID [2022-04-28 12:21:26,729 INFO L290 TraceCheckUtils]: 67: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 12:21:26,729 INFO L290 TraceCheckUtils]: 66: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 12:21:26,729 INFO L290 TraceCheckUtils]: 65: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 12:21:26,729 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 12:21:26,729 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37950#true} {38378#(< ~counter~0 9)} #86#return; {38378#(< ~counter~0 9)} is VALID [2022-04-28 12:21:26,729 INFO L290 TraceCheckUtils]: 62: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 12:21:26,729 INFO L290 TraceCheckUtils]: 61: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 12:21:26,729 INFO L290 TraceCheckUtils]: 60: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 12:21:26,729 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 12:21:26,730 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 12:21:26,730 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 12:21:26,731 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 12:21:26,731 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 12:21:26,731 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 12:21:26,732 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 12:21:26,732 INFO L290 TraceCheckUtils]: 52: Hoare triple {38458#(< ~counter~0 7)} assume !(~c~0 >= ~b~0); {38458#(< ~counter~0 7)} is VALID [2022-04-28 12:21:26,732 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {37950#true} {38458#(< ~counter~0 7)} #92#return; {38458#(< ~counter~0 7)} is VALID [2022-04-28 12:21:26,732 INFO L290 TraceCheckUtils]: 50: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 12:21:26,732 INFO L290 TraceCheckUtils]: 49: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 12:21:26,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 12:21:26,733 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 12:21:26,733 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {37950#true} {38458#(< ~counter~0 7)} #90#return; {38458#(< ~counter~0 7)} is VALID [2022-04-28 12:21:26,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 12:21:26,733 INFO L290 TraceCheckUtils]: 44: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 12:21:26,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 12:21:26,733 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 12:21:26,734 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37950#true} {38458#(< ~counter~0 7)} #88#return; {38458#(< ~counter~0 7)} is VALID [2022-04-28 12:21:26,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 12:21:26,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 12:21:26,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 12:21:26,734 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 12:21:26,734 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {37950#true} {38458#(< ~counter~0 7)} #86#return; {38458#(< ~counter~0 7)} is VALID [2022-04-28 12:21:26,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 12:21:26,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 12:21:26,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 12:21:26,735 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 12:21:26,735 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 12:21:26,735 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 12:21:26,736 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 12:21:26,736 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 12:21:26,737 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 12:21:26,737 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {37950#true} {38130#(<= ~counter~0 4)} #84#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 12:21:26,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 12:21:26,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 12:21:26,737 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 12:21:26,737 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {37950#true} {38130#(<= ~counter~0 4)} #82#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 12:21:26,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 12:21:26,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 12:21:26,738 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 12:21:26,738 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 12:21:26,738 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37950#true} {38130#(<= ~counter~0 4)} #80#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 12:21:26,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 12:21:26,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 12:21:26,738 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 12:21:26,739 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37950#true} {38130#(<= ~counter~0 4)} #78#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-28 12:21:26,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-28 12:21:26,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-28 12:21:26,739 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 12:21:26,739 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 12:21:26,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {38130#(<= ~counter~0 4)} call #t~ret8 := main(); {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38130#(<= ~counter~0 4)} {37950#true} #98#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {38130#(<= ~counter~0 4)} assume true; {38130#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:26,741 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 12:21:26,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {37950#true} call ULTIMATE.init(); {37950#true} is VALID [2022-04-28 12:21:26,741 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 12:21:26,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:21:26,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945293043] [2022-04-28 12:21:26,741 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:21:26,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845758396] [2022-04-28 12:21:26,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845758396] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:21:26,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:21:26,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 12:21:26,742 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:21:26,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2124768704] [2022-04-28 12:21:26,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2124768704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:21:26,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:21:26,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:21:26,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962825144] [2022-04-28 12:21:26,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:21:26,743 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 12:21:26,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:21:26,743 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 12:21:26,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:26,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:21:26,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:26,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:21:26,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:21:26,802 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 12:21:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:27,880 INFO L93 Difference]: Finished difference Result 434 states and 549 transitions. [2022-04-28 12:21:27,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 12:21:27,881 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 12:21:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:21:27,881 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 12:21:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2022-04-28 12:21:27,883 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 12:21:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2022-04-28 12:21:27,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 133 transitions. [2022-04-28 12:21:28,020 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 12:21:28,044 INFO L225 Difference]: With dead ends: 434 [2022-04-28 12:21:28,044 INFO L226 Difference]: Without dead ends: 425 [2022-04-28 12:21:28,045 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 12:21:28,045 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 12:21:28,045 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 12:21:28,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-04-28 12:21:28,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 423. [2022-04-28 12:21:28,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:21:28,796 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 12:21:28,797 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 12:21:28,797 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 12:21:28,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:28,805 INFO L93 Difference]: Finished difference Result 425 states and 538 transitions. [2022-04-28 12:21:28,805 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 538 transitions. [2022-04-28 12:21:28,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:28,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:28,806 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 12:21:28,806 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 12:21:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:28,818 INFO L93 Difference]: Finished difference Result 425 states and 538 transitions. [2022-04-28 12:21:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 538 transitions. [2022-04-28 12:21:28,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:28,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:28,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:21:28,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:21:28,820 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 12:21:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 536 transitions. [2022-04-28 12:21:28,834 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 536 transitions. Word has length 110 [2022-04-28 12:21:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:21:28,835 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 536 transitions. [2022-04-28 12:21:28,835 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 12:21:28,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 423 states and 536 transitions. [2022-04-28 12:21:29,597 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 12:21:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 536 transitions. [2022-04-28 12:21:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 12:21:29,598 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:21:29,598 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 12:21:29,603 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 12:21:29,798 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 12:21:29,799 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:21:29,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:21:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash -289933735, now seen corresponding path program 5 times [2022-04-28 12:21:29,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:29,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1878076124] [2022-04-28 12:21:29,800 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:21:29,800 INFO L85 PathProgramCache]: Analyzing trace with hash -289933735, now seen corresponding path program 6 times [2022-04-28 12:21:29,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:21:29,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744553333] [2022-04-28 12:21:29,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:21:29,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:21:29,810 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:21:29,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1009391801] [2022-04-28 12:21:29,810 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:21:29,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:21:29,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:21:29,811 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 12:21:29,815 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 12:21:29,879 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 12:21:29,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:21:29,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:21:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:21:29,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:21:30,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {41195#true} call ULTIMATE.init(); {41195#true} is VALID [2022-04-28 12:21:30,172 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 12:21:30,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41195#true} {41195#true} #98#return; {41195#true} is VALID [2022-04-28 12:21:30,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {41195#true} call #t~ret8 := main(); {41195#true} is VALID [2022-04-28 12:21:30,172 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 12:21:30,172 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 12:21:30,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,173 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41195#true} {41195#true} #78#return; {41195#true} is VALID [2022-04-28 12:21:30,173 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 12:21:30,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,173 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41195#true} {41195#true} #80#return; {41195#true} is VALID [2022-04-28 12:21:30,173 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 12:21:30,173 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 12:21:30,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,173 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41195#true} {41195#true} #82#return; {41195#true} is VALID [2022-04-28 12:21:30,173 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 12:21:30,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,173 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41195#true} {41195#true} #84#return; {41195#true} is VALID [2022-04-28 12:21:30,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {41195#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41195#true} is VALID [2022-04-28 12:21:30,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {41195#true} assume !!(#t~post6 < 10);havoc #t~post6; {41195#true} is VALID [2022-04-28 12:21:30,174 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 12:21:30,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {41195#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41195#true} is VALID [2022-04-28 12:21:30,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {41195#true} assume !!(#t~post7 < 10);havoc #t~post7; {41195#true} is VALID [2022-04-28 12:21:30,174 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 12:21:30,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,174 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {41195#true} {41195#true} #86#return; {41195#true} is VALID [2022-04-28 12:21:30,174 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 12:21:30,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,174 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {41195#true} {41195#true} #88#return; {41195#true} is VALID [2022-04-28 12:21:30,174 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 12:21:30,174 INFO L290 TraceCheckUtils]: 43: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,174 INFO L290 TraceCheckUtils]: 44: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,174 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {41195#true} {41195#true} #90#return; {41195#true} is VALID [2022-04-28 12:21:30,175 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 12:21:30,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,175 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {41195#true} {41195#true} #92#return; {41195#true} is VALID [2022-04-28 12:21:30,179 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 12:21:30,180 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 12:21:30,180 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 12:21:30,180 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 12:21:30,181 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 12:21:30,181 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 12:21:30,181 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 12:21:30,182 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 12:21:30,182 INFO L290 TraceCheckUtils]: 60: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,182 INFO L290 TraceCheckUtils]: 61: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,182 INFO L290 TraceCheckUtils]: 62: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,182 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 12:21:30,182 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 12:21:30,183 INFO L290 TraceCheckUtils]: 65: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,183 INFO L290 TraceCheckUtils]: 66: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,183 INFO L290 TraceCheckUtils]: 67: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,183 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 12:21:30,184 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 12:21:30,184 INFO L290 TraceCheckUtils]: 70: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,184 INFO L290 TraceCheckUtils]: 71: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,184 INFO L290 TraceCheckUtils]: 72: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,184 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 12:21:30,184 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 12:21:30,185 INFO L290 TraceCheckUtils]: 75: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,185 INFO L290 TraceCheckUtils]: 76: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,185 INFO L290 TraceCheckUtils]: 77: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,185 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 12:21:30,187 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 12:21:30,187 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 12:21:30,187 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 12:21:30,188 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 12:21:30,188 INFO L290 TraceCheckUtils]: 83: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,188 INFO L290 TraceCheckUtils]: 84: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,188 INFO L290 TraceCheckUtils]: 85: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,188 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 12:21:30,188 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 12:21:30,188 INFO L290 TraceCheckUtils]: 88: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,189 INFO L290 TraceCheckUtils]: 89: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,189 INFO L290 TraceCheckUtils]: 90: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,189 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 12:21:30,189 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 12:21:30,189 INFO L290 TraceCheckUtils]: 93: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,189 INFO L290 TraceCheckUtils]: 94: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,190 INFO L290 TraceCheckUtils]: 95: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,190 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 12:21:30,190 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 12:21:30,190 INFO L290 TraceCheckUtils]: 98: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,190 INFO L290 TraceCheckUtils]: 99: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,190 INFO L290 TraceCheckUtils]: 100: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,191 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 12:21:30,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 12:21:30,192 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 12:21:30,192 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 12:21:30,193 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 12:21:30,193 INFO L290 TraceCheckUtils]: 106: Hoare triple {41513#(< 0 main_~b~0)} assume !(0 != ~b~0); {41196#false} is VALID [2022-04-28 12:21:30,193 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 12:21:30,193 INFO L290 TraceCheckUtils]: 108: Hoare triple {41196#false} ~cond := #in~cond; {41196#false} is VALID [2022-04-28 12:21:30,193 INFO L290 TraceCheckUtils]: 109: Hoare triple {41196#false} assume 0 == ~cond; {41196#false} is VALID [2022-04-28 12:21:30,193 INFO L290 TraceCheckUtils]: 110: Hoare triple {41196#false} assume !false; {41196#false} is VALID [2022-04-28 12:21:30,194 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 12:21:30,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:21:30,547 INFO L290 TraceCheckUtils]: 110: Hoare triple {41196#false} assume !false; {41196#false} is VALID [2022-04-28 12:21:30,548 INFO L290 TraceCheckUtils]: 109: Hoare triple {41196#false} assume 0 == ~cond; {41196#false} is VALID [2022-04-28 12:21:30,548 INFO L290 TraceCheckUtils]: 108: Hoare triple {41196#false} ~cond := #in~cond; {41196#false} is VALID [2022-04-28 12:21:30,548 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 12:21:30,548 INFO L290 TraceCheckUtils]: 106: Hoare triple {41513#(< 0 main_~b~0)} assume !(0 != ~b~0); {41196#false} is VALID [2022-04-28 12:21:30,548 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 12:21:30,548 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 12:21:30,549 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 12:21:30,549 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 12:21:30,550 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 12:21:30,550 INFO L290 TraceCheckUtils]: 100: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,550 INFO L290 TraceCheckUtils]: 99: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,550 INFO L290 TraceCheckUtils]: 98: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,550 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 12:21:30,550 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 12:21:30,550 INFO L290 TraceCheckUtils]: 95: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,551 INFO L290 TraceCheckUtils]: 94: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,551 INFO L290 TraceCheckUtils]: 93: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,551 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 12:21:30,551 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 12:21:30,551 INFO L290 TraceCheckUtils]: 90: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,551 INFO L290 TraceCheckUtils]: 89: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,551 INFO L290 TraceCheckUtils]: 88: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,551 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 12:21:30,552 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 12:21:30,552 INFO L290 TraceCheckUtils]: 85: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,552 INFO L290 TraceCheckUtils]: 84: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,552 INFO L290 TraceCheckUtils]: 83: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,552 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 12:21:30,552 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 12:21:30,552 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 12:21:30,554 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 12:21:30,554 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 12:21:30,554 INFO L290 TraceCheckUtils]: 77: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,554 INFO L290 TraceCheckUtils]: 76: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,554 INFO L290 TraceCheckUtils]: 75: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,555 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 12:21:30,555 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 12:21:30,555 INFO L290 TraceCheckUtils]: 72: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,555 INFO L290 TraceCheckUtils]: 71: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,555 INFO L290 TraceCheckUtils]: 70: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,555 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 12:21:30,556 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 12:21:30,556 INFO L290 TraceCheckUtils]: 67: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,556 INFO L290 TraceCheckUtils]: 66: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,556 INFO L290 TraceCheckUtils]: 65: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,556 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 12:21:30,556 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 12:21:30,556 INFO L290 TraceCheckUtils]: 62: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,557 INFO L290 TraceCheckUtils]: 61: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,557 INFO L290 TraceCheckUtils]: 60: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,557 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 12:21:30,557 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 12:21:30,557 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 12:21:30,557 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 12:21:30,558 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 12:21:30,558 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 12:21:30,558 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 12:21:30,559 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 12:21:30,559 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {41195#true} {41195#true} #92#return; {41195#true} is VALID [2022-04-28 12:21:30,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,559 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 12:21:30,559 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {41195#true} {41195#true} #90#return; {41195#true} is VALID [2022-04-28 12:21:30,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,559 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 12:21:30,559 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {41195#true} {41195#true} #88#return; {41195#true} is VALID [2022-04-28 12:21:30,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,559 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 12:21:30,560 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {41195#true} {41195#true} #86#return; {41195#true} is VALID [2022-04-28 12:21:30,560 INFO L290 TraceCheckUtils]: 35: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,560 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 12:21:30,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {41195#true} assume !!(#t~post7 < 10);havoc #t~post7; {41195#true} is VALID [2022-04-28 12:21:30,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {41195#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41195#true} is VALID [2022-04-28 12:21:30,560 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 12:21:30,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {41195#true} assume !!(#t~post6 < 10);havoc #t~post6; {41195#true} is VALID [2022-04-28 12:21:30,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {41195#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41195#true} is VALID [2022-04-28 12:21:30,560 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41195#true} {41195#true} #84#return; {41195#true} is VALID [2022-04-28 12:21:30,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,560 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 12:21:30,560 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41195#true} {41195#true} #82#return; {41195#true} is VALID [2022-04-28 12:21:30,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,560 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 12:21:30,561 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 12:21:30,561 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41195#true} {41195#true} #80#return; {41195#true} is VALID [2022-04-28 12:21:30,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,561 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 12:21:30,561 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41195#true} {41195#true} #78#return; {41195#true} is VALID [2022-04-28 12:21:30,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-28 12:21:30,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-28 12:21:30,561 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 12:21:30,561 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 12:21:30,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {41195#true} call #t~ret8 := main(); {41195#true} is VALID [2022-04-28 12:21:30,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41195#true} {41195#true} #98#return; {41195#true} is VALID [2022-04-28 12:21:30,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 12:21:30,561 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 12:21:30,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {41195#true} call ULTIMATE.init(); {41195#true} is VALID [2022-04-28 12:21:30,562 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 12:21:30,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:21:30,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744553333] [2022-04-28 12:21:30,562 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:21:30,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009391801] [2022-04-28 12:21:30,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009391801] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:21:30,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:21:30,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-04-28 12:21:30,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:21:30,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1878076124] [2022-04-28 12:21:30,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1878076124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:21:30,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:21:30,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:21:30,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991758034] [2022-04-28 12:21:30,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:21:30,563 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 12:21:30,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:21:30,563 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 12:21:30,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:30,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:21:30,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:30,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:21:30,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 12:21:30,620 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 12:21:32,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:32,965 INFO L93 Difference]: Finished difference Result 589 states and 810 transitions. [2022-04-28 12:21:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 12:21:32,966 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 12:21:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:21:32,966 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 12:21:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 178 transitions. [2022-04-28 12:21:32,968 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 12:21:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 178 transitions. [2022-04-28 12:21:32,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 178 transitions. [2022-04-28 12:21:33,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:33,160 INFO L225 Difference]: With dead ends: 589 [2022-04-28 12:21:33,160 INFO L226 Difference]: Without dead ends: 581 [2022-04-28 12:21:33,160 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 12:21:33,161 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 12:21:33,161 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 12:21:33,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-04-28 12:21:34,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 470. [2022-04-28 12:21:34,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:21:34,100 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 12:21:34,101 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 12:21:34,101 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 12:21:34,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:34,124 INFO L93 Difference]: Finished difference Result 581 states and 798 transitions. [2022-04-28 12:21:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 798 transitions. [2022-04-28 12:21:34,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:34,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:34,127 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 12:21:34,127 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 12:21:34,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:34,151 INFO L93 Difference]: Finished difference Result 581 states and 798 transitions. [2022-04-28 12:21:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 798 transitions. [2022-04-28 12:21:34,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:34,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:34,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:21:34,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:21:34,153 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 12:21:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 614 transitions. [2022-04-28 12:21:34,165 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 614 transitions. Word has length 111 [2022-04-28 12:21:34,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:21:34,165 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 614 transitions. [2022-04-28 12:21:34,165 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 12:21:34,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 470 states and 614 transitions. [2022-04-28 12:21:35,173 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 12:21:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 614 transitions. [2022-04-28 12:21:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-28 12:21:35,174 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:21:35,174 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 12:21:35,190 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 12:21:35,374 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 12:21:35,375 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:21:35,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:21:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1282766646, now seen corresponding path program 3 times [2022-04-28 12:21:35,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:35,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [38522049] [2022-04-28 12:21:35,375 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:21:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1282766646, now seen corresponding path program 4 times [2022-04-28 12:21:35,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:21:35,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493349022] [2022-04-28 12:21:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:21:35,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:21:35,390 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:21:35,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352074649] [2022-04-28 12:21:35,391 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:21:35,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:21:35,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:21:35,392 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 12:21:35,422 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 12:21:35,470 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:21:35,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:21:35,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 12:21:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:21:35,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:21:35,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {45173#true} call ULTIMATE.init(); {45173#true} is VALID [2022-04-28 12:21:35,907 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 12:21:35,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {45181#(<= ~counter~0 0)} assume true; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:35,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45181#(<= ~counter~0 0)} {45173#true} #98#return; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:35,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {45181#(<= ~counter~0 0)} call #t~ret8 := main(); {45181#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:35,908 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 12:21:35,908 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 12:21:35,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {45181#(<= ~counter~0 0)} ~cond := #in~cond; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:35,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {45181#(<= ~counter~0 0)} assume !(0 == ~cond); {45181#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:35,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {45181#(<= ~counter~0 0)} assume true; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:35,909 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 12:21:35,910 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 12:21:35,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {45181#(<= ~counter~0 0)} ~cond := #in~cond; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:35,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {45181#(<= ~counter~0 0)} assume !(0 == ~cond); {45181#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:35,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {45181#(<= ~counter~0 0)} assume true; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:35,911 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 12:21:35,911 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 12:21:35,911 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 12:21:35,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {45181#(<= ~counter~0 0)} ~cond := #in~cond; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:35,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {45181#(<= ~counter~0 0)} assume !(0 == ~cond); {45181#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:35,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {45181#(<= ~counter~0 0)} assume true; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:35,912 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 12:21:35,913 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 12:21:35,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {45181#(<= ~counter~0 0)} ~cond := #in~cond; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:35,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {45181#(<= ~counter~0 0)} assume !(0 == ~cond); {45181#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:35,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {45181#(<= ~counter~0 0)} assume true; {45181#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:35,914 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 12:21:35,915 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 12:21:35,915 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 12:21:35,915 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 12:21:35,916 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 12:21:35,916 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 12:21:35,917 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 12:21:35,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {45270#(<= ~counter~0 2)} ~cond := #in~cond; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:35,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {45270#(<= ~counter~0 2)} assume !(0 == ~cond); {45270#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:35,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {45270#(<= ~counter~0 2)} assume true; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:35,918 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 12:21:35,918 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 12:21:35,919 INFO L290 TraceCheckUtils]: 38: Hoare triple {45270#(<= ~counter~0 2)} ~cond := #in~cond; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:35,919 INFO L290 TraceCheckUtils]: 39: Hoare triple {45270#(<= ~counter~0 2)} assume !(0 == ~cond); {45270#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:35,919 INFO L290 TraceCheckUtils]: 40: Hoare triple {45270#(<= ~counter~0 2)} assume true; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:35,920 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 12:21:35,920 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 12:21:35,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {45270#(<= ~counter~0 2)} ~cond := #in~cond; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:35,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {45270#(<= ~counter~0 2)} assume !(0 == ~cond); {45270#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:35,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {45270#(<= ~counter~0 2)} assume true; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:35,921 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 12:21:35,922 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 12:21:35,922 INFO L290 TraceCheckUtils]: 48: Hoare triple {45270#(<= ~counter~0 2)} ~cond := #in~cond; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:35,922 INFO L290 TraceCheckUtils]: 49: Hoare triple {45270#(<= ~counter~0 2)} assume !(0 == ~cond); {45270#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:35,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {45270#(<= ~counter~0 2)} assume true; {45270#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:35,923 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 12:21:35,923 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 12:21:35,924 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 12:21:35,924 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 12:21:35,925 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 12:21:35,925 INFO L290 TraceCheckUtils]: 56: Hoare triple {45340#(<= ~counter~0 3)} ~cond := #in~cond; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:35,925 INFO L290 TraceCheckUtils]: 57: Hoare triple {45340#(<= ~counter~0 3)} assume !(0 == ~cond); {45340#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:35,926 INFO L290 TraceCheckUtils]: 58: Hoare triple {45340#(<= ~counter~0 3)} assume true; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:35,926 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 12:21:35,926 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 12:21:35,927 INFO L290 TraceCheckUtils]: 61: Hoare triple {45340#(<= ~counter~0 3)} ~cond := #in~cond; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:35,927 INFO L290 TraceCheckUtils]: 62: Hoare triple {45340#(<= ~counter~0 3)} assume !(0 == ~cond); {45340#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:35,927 INFO L290 TraceCheckUtils]: 63: Hoare triple {45340#(<= ~counter~0 3)} assume true; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:35,928 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 12:21:35,928 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 12:21:35,928 INFO L290 TraceCheckUtils]: 66: Hoare triple {45340#(<= ~counter~0 3)} ~cond := #in~cond; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:35,929 INFO L290 TraceCheckUtils]: 67: Hoare triple {45340#(<= ~counter~0 3)} assume !(0 == ~cond); {45340#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:35,929 INFO L290 TraceCheckUtils]: 68: Hoare triple {45340#(<= ~counter~0 3)} assume true; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:35,929 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 12:21:35,935 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 12:21:35,936 INFO L290 TraceCheckUtils]: 71: Hoare triple {45340#(<= ~counter~0 3)} ~cond := #in~cond; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:35,936 INFO L290 TraceCheckUtils]: 72: Hoare triple {45340#(<= ~counter~0 3)} assume !(0 == ~cond); {45340#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:35,937 INFO L290 TraceCheckUtils]: 73: Hoare triple {45340#(<= ~counter~0 3)} assume true; {45340#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:35,937 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 12:21:35,938 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 12:21:35,939 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 12:21:35,939 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 12:21:35,940 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 12:21:35,940 INFO L290 TraceCheckUtils]: 79: Hoare triple {45410#(<= ~counter~0 4)} ~cond := #in~cond; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:35,940 INFO L290 TraceCheckUtils]: 80: Hoare triple {45410#(<= ~counter~0 4)} assume !(0 == ~cond); {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:35,941 INFO L290 TraceCheckUtils]: 81: Hoare triple {45410#(<= ~counter~0 4)} assume true; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:35,941 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 12:21:35,942 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 12:21:35,942 INFO L290 TraceCheckUtils]: 84: Hoare triple {45410#(<= ~counter~0 4)} ~cond := #in~cond; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:35,942 INFO L290 TraceCheckUtils]: 85: Hoare triple {45410#(<= ~counter~0 4)} assume !(0 == ~cond); {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:35,943 INFO L290 TraceCheckUtils]: 86: Hoare triple {45410#(<= ~counter~0 4)} assume true; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:35,943 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 12:21:35,944 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 12:21:35,944 INFO L290 TraceCheckUtils]: 89: Hoare triple {45410#(<= ~counter~0 4)} ~cond := #in~cond; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:35,945 INFO L290 TraceCheckUtils]: 90: Hoare triple {45410#(<= ~counter~0 4)} assume !(0 == ~cond); {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:35,945 INFO L290 TraceCheckUtils]: 91: Hoare triple {45410#(<= ~counter~0 4)} assume true; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:35,946 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 12:21:35,946 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 12:21:35,947 INFO L290 TraceCheckUtils]: 94: Hoare triple {45410#(<= ~counter~0 4)} ~cond := #in~cond; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:35,947 INFO L290 TraceCheckUtils]: 95: Hoare triple {45410#(<= ~counter~0 4)} assume !(0 == ~cond); {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:35,947 INFO L290 TraceCheckUtils]: 96: Hoare triple {45410#(<= ~counter~0 4)} assume true; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:35,948 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 12:21:35,949 INFO L290 TraceCheckUtils]: 98: Hoare triple {45410#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:35,949 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 12:21:35,950 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 12:21:35,950 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 12:21:35,951 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 12:21:35,951 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 12:21:35,951 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 12:21:35,951 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 12:21:35,952 INFO L290 TraceCheckUtils]: 106: Hoare triple {45174#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45174#false} is VALID [2022-04-28 12:21:35,952 INFO L290 TraceCheckUtils]: 107: Hoare triple {45174#false} assume !(#t~post6 < 10);havoc #t~post6; {45174#false} is VALID [2022-04-28 12:21:35,952 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 12:21:35,952 INFO L290 TraceCheckUtils]: 109: Hoare triple {45174#false} ~cond := #in~cond; {45174#false} is VALID [2022-04-28 12:21:35,952 INFO L290 TraceCheckUtils]: 110: Hoare triple {45174#false} assume 0 == ~cond; {45174#false} is VALID [2022-04-28 12:21:35,952 INFO L290 TraceCheckUtils]: 111: Hoare triple {45174#false} assume !false; {45174#false} is VALID [2022-04-28 12:21:35,952 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 12:21:35,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:21:36,357 INFO L290 TraceCheckUtils]: 111: Hoare triple {45174#false} assume !false; {45174#false} is VALID [2022-04-28 12:21:36,358 INFO L290 TraceCheckUtils]: 110: Hoare triple {45174#false} assume 0 == ~cond; {45174#false} is VALID [2022-04-28 12:21:36,358 INFO L290 TraceCheckUtils]: 109: Hoare triple {45174#false} ~cond := #in~cond; {45174#false} is VALID [2022-04-28 12:21:36,358 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 12:21:36,358 INFO L290 TraceCheckUtils]: 107: Hoare triple {45174#false} assume !(#t~post6 < 10);havoc #t~post6; {45174#false} is VALID [2022-04-28 12:21:36,358 INFO L290 TraceCheckUtils]: 106: Hoare triple {45174#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45174#false} is VALID [2022-04-28 12:21:36,358 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 12:21:36,358 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 12:21:36,358 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 12:21:36,359 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 12:21:36,359 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 12:21:36,360 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 12:21:36,360 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 12:21:36,360 INFO L290 TraceCheckUtils]: 98: Hoare triple {45553#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {45553#(< ~counter~0 9)} is VALID [2022-04-28 12:21:36,361 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {45173#true} {45553#(< ~counter~0 9)} #92#return; {45553#(< ~counter~0 9)} is VALID [2022-04-28 12:21:36,361 INFO L290 TraceCheckUtils]: 96: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 12:21:36,361 INFO L290 TraceCheckUtils]: 95: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 12:21:36,361 INFO L290 TraceCheckUtils]: 94: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 12:21:36,361 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 12:21:36,363 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {45173#true} {45553#(< ~counter~0 9)} #90#return; {45553#(< ~counter~0 9)} is VALID [2022-04-28 12:21:36,364 INFO L290 TraceCheckUtils]: 91: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 12:21:36,364 INFO L290 TraceCheckUtils]: 90: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 12:21:36,364 INFO L290 TraceCheckUtils]: 89: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 12:21:36,364 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 12:21:36,364 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {45173#true} {45553#(< ~counter~0 9)} #88#return; {45553#(< ~counter~0 9)} is VALID [2022-04-28 12:21:36,364 INFO L290 TraceCheckUtils]: 86: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 12:21:36,364 INFO L290 TraceCheckUtils]: 85: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 12:21:36,364 INFO L290 TraceCheckUtils]: 84: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 12:21:36,365 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 12:21:36,365 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {45173#true} {45553#(< ~counter~0 9)} #86#return; {45553#(< ~counter~0 9)} is VALID [2022-04-28 12:21:36,366 INFO L290 TraceCheckUtils]: 81: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 12:21:36,366 INFO L290 TraceCheckUtils]: 80: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 12:21:36,366 INFO L290 TraceCheckUtils]: 79: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 12:21:36,366 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 12:21:36,366 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 12:21:36,367 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 12:21:36,367 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 12:21:36,367 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {45173#true} {45626#(< ~counter~0 8)} #92#return; {45626#(< ~counter~0 8)} is VALID [2022-04-28 12:21:36,367 INFO L290 TraceCheckUtils]: 73: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 12:21:36,368 INFO L290 TraceCheckUtils]: 72: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 12:21:36,368 INFO L290 TraceCheckUtils]: 71: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 12:21:36,368 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 12:21:36,368 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {45173#true} {45626#(< ~counter~0 8)} #90#return; {45626#(< ~counter~0 8)} is VALID [2022-04-28 12:21:36,368 INFO L290 TraceCheckUtils]: 68: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 12:21:36,368 INFO L290 TraceCheckUtils]: 67: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 12:21:36,368 INFO L290 TraceCheckUtils]: 66: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 12:21:36,368 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 12:21:36,369 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {45173#true} {45626#(< ~counter~0 8)} #88#return; {45626#(< ~counter~0 8)} is VALID [2022-04-28 12:21:36,369 INFO L290 TraceCheckUtils]: 63: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 12:21:36,369 INFO L290 TraceCheckUtils]: 62: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 12:21:36,369 INFO L290 TraceCheckUtils]: 61: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 12:21:36,369 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 12:21:36,370 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {45173#true} {45626#(< ~counter~0 8)} #86#return; {45626#(< ~counter~0 8)} is VALID [2022-04-28 12:21:36,370 INFO L290 TraceCheckUtils]: 58: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 12:21:36,370 INFO L290 TraceCheckUtils]: 57: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 12:21:36,370 INFO L290 TraceCheckUtils]: 56: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 12:21:36,370 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 12:21:36,370 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 12:21:36,371 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 12:21:36,371 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 12:21:36,371 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {45173#true} {45696#(< ~counter~0 7)} #92#return; {45696#(< ~counter~0 7)} is VALID [2022-04-28 12:21:36,372 INFO L290 TraceCheckUtils]: 50: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 12:21:36,372 INFO L290 TraceCheckUtils]: 49: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 12:21:36,372 INFO L290 TraceCheckUtils]: 48: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 12:21:36,372 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 12:21:36,372 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {45173#true} {45696#(< ~counter~0 7)} #90#return; {45696#(< ~counter~0 7)} is VALID [2022-04-28 12:21:36,372 INFO L290 TraceCheckUtils]: 45: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 12:21:36,372 INFO L290 TraceCheckUtils]: 44: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 12:21:36,372 INFO L290 TraceCheckUtils]: 43: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 12:21:36,372 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 12:21:36,373 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {45173#true} {45696#(< ~counter~0 7)} #88#return; {45696#(< ~counter~0 7)} is VALID [2022-04-28 12:21:36,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 12:21:36,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 12:21:36,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 12:21:36,373 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 12:21:36,374 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {45173#true} {45696#(< ~counter~0 7)} #86#return; {45696#(< ~counter~0 7)} is VALID [2022-04-28 12:21:36,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 12:21:36,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 12:21:36,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 12:21:36,374 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 12:21:36,374 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 12:21:36,375 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 12:21:36,375 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 12:21:36,375 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 12:21:36,376 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 12:21:36,376 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {45173#true} {45410#(<= ~counter~0 4)} #84#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:36,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 12:21:36,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 12:21:36,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 12:21:36,376 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 12:21:36,377 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {45173#true} {45410#(<= ~counter~0 4)} #82#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:36,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 12:21:36,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 12:21:36,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 12:21:36,377 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 12:21:36,377 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 12:21:36,378 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45173#true} {45410#(<= ~counter~0 4)} #80#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:36,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 12:21:36,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 12:21:36,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 12:21:36,378 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 12:21:36,378 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45173#true} {45410#(<= ~counter~0 4)} #78#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:36,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-28 12:21:36,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-28 12:21:36,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-28 12:21:36,378 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 12:21:36,379 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 12:21:36,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {45410#(<= ~counter~0 4)} call #t~ret8 := main(); {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:36,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45410#(<= ~counter~0 4)} {45173#true} #98#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:36,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {45410#(<= ~counter~0 4)} assume true; {45410#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:36,380 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 12:21:36,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {45173#true} call ULTIMATE.init(); {45173#true} is VALID [2022-04-28 12:21:36,380 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 12:21:36,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:21:36,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493349022] [2022-04-28 12:21:36,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:21:36,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352074649] [2022-04-28 12:21:36,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352074649] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:21:36,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:21:36,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 12:21:36,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:21:36,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [38522049] [2022-04-28 12:21:36,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [38522049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:21:36,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:21:36,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:21:36,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733805518] [2022-04-28 12:21:36,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:21:36,382 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 12:21:36,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:21:36,382 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 12:21:36,451 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 12:21:36,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:21:36,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:36,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:21:36,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:21:36,452 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 12:21:37,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:37,816 INFO L93 Difference]: Finished difference Result 644 states and 881 transitions. [2022-04-28 12:21:37,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 12:21:37,816 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 12:21:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:21:37,816 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 12:21:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 152 transitions. [2022-04-28 12:21:37,817 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 12:21:37,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 152 transitions. [2022-04-28 12:21:37,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 152 transitions. [2022-04-28 12:21:37,947 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 12:21:37,958 INFO L225 Difference]: With dead ends: 644 [2022-04-28 12:21:37,958 INFO L226 Difference]: Without dead ends: 474 [2022-04-28 12:21:37,959 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 12:21:37,959 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 12:21:37,959 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 12:21:37,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-04-28 12:21:39,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-04-28 12:21:39,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:21:39,046 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 12:21:39,047 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 12:21:39,047 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 12:21:39,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:39,062 INFO L93 Difference]: Finished difference Result 474 states and 616 transitions. [2022-04-28 12:21:39,062 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 616 transitions. [2022-04-28 12:21:39,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:39,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:39,064 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 12:21:39,064 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 12:21:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:39,078 INFO L93 Difference]: Finished difference Result 474 states and 616 transitions. [2022-04-28 12:21:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 616 transitions. [2022-04-28 12:21:39,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:39,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:39,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:21:39,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:21:39,080 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 12:21:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 616 transitions. [2022-04-28 12:21:39,095 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 616 transitions. Word has length 112 [2022-04-28 12:21:39,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:21:39,095 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 616 transitions. [2022-04-28 12:21:39,095 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 12:21:39,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 474 states and 616 transitions. [2022-04-28 12:21:40,053 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 12:21:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 616 transitions. [2022-04-28 12:21:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 12:21:40,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:21:40,054 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 12:21:40,070 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 12:21:40,254 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 12:21:40,255 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:21:40,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:21:40,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1546024104, now seen corresponding path program 5 times [2022-04-28 12:21:40,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:40,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [756501817] [2022-04-28 12:21:40,256 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:21:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1546024104, now seen corresponding path program 6 times [2022-04-28 12:21:40,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:21:40,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206777371] [2022-04-28 12:21:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:21:40,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:21:40,272 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:21:40,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [262452798] [2022-04-28 12:21:40,273 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:21:40,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:21:40,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:21:40,274 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 12:21:40,279 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 12:21:40,361 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 12:21:40,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:21:40,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 12:21:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:21:40,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:21:40,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {49050#true} call ULTIMATE.init(); {49050#true} is VALID [2022-04-28 12:21:40,817 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 12:21:40,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {49058#(<= ~counter~0 0)} assume true; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:40,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49058#(<= ~counter~0 0)} {49050#true} #98#return; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:40,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {49058#(<= ~counter~0 0)} call #t~ret8 := main(); {49058#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:40,818 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 12:21:40,819 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 12:21:40,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {49058#(<= ~counter~0 0)} ~cond := #in~cond; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:40,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {49058#(<= ~counter~0 0)} assume !(0 == ~cond); {49058#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:40,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {49058#(<= ~counter~0 0)} assume true; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:40,820 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 12:21:40,820 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 12:21:40,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {49058#(<= ~counter~0 0)} ~cond := #in~cond; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:40,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {49058#(<= ~counter~0 0)} assume !(0 == ~cond); {49058#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:40,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {49058#(<= ~counter~0 0)} assume true; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:40,821 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 12:21:40,821 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 12:21:40,822 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 12:21:40,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {49058#(<= ~counter~0 0)} ~cond := #in~cond; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:40,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {49058#(<= ~counter~0 0)} assume !(0 == ~cond); {49058#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:40,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {49058#(<= ~counter~0 0)} assume true; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:40,823 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 12:21:40,823 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 12:21:40,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {49058#(<= ~counter~0 0)} ~cond := #in~cond; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:40,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {49058#(<= ~counter~0 0)} assume !(0 == ~cond); {49058#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:40,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {49058#(<= ~counter~0 0)} assume true; {49058#(<= ~counter~0 0)} is VALID [2022-04-28 12:21:40,824 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 12:21:40,825 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 12:21:40,826 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 12:21:40,826 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 12:21:40,827 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 12:21:40,827 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 12:21:40,827 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 12:21:40,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {49147#(<= ~counter~0 2)} ~cond := #in~cond; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:40,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {49147#(<= ~counter~0 2)} assume !(0 == ~cond); {49147#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:40,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {49147#(<= ~counter~0 2)} assume true; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:40,828 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 12:21:40,829 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 12:21:40,829 INFO L290 TraceCheckUtils]: 38: Hoare triple {49147#(<= ~counter~0 2)} ~cond := #in~cond; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:40,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {49147#(<= ~counter~0 2)} assume !(0 == ~cond); {49147#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:40,830 INFO L290 TraceCheckUtils]: 40: Hoare triple {49147#(<= ~counter~0 2)} assume true; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:40,830 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 12:21:40,831 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 12:21:40,831 INFO L290 TraceCheckUtils]: 43: Hoare triple {49147#(<= ~counter~0 2)} ~cond := #in~cond; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:40,831 INFO L290 TraceCheckUtils]: 44: Hoare triple {49147#(<= ~counter~0 2)} assume !(0 == ~cond); {49147#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:40,831 INFO L290 TraceCheckUtils]: 45: Hoare triple {49147#(<= ~counter~0 2)} assume true; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:40,832 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 12:21:40,832 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 12:21:40,833 INFO L290 TraceCheckUtils]: 48: Hoare triple {49147#(<= ~counter~0 2)} ~cond := #in~cond; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:40,833 INFO L290 TraceCheckUtils]: 49: Hoare triple {49147#(<= ~counter~0 2)} assume !(0 == ~cond); {49147#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:40,833 INFO L290 TraceCheckUtils]: 50: Hoare triple {49147#(<= ~counter~0 2)} assume true; {49147#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:40,834 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 12:21:40,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {49147#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {49147#(<= ~counter~0 2)} is VALID [2022-04-28 12:21:40,834 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 12:21:40,835 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 12:21:40,835 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 12:21:40,835 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 12:21:40,836 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 12:21:40,836 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 12:21:40,837 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 12:21:40,837 INFO L290 TraceCheckUtils]: 60: Hoare triple {49230#(<= ~counter~0 4)} ~cond := #in~cond; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:40,837 INFO L290 TraceCheckUtils]: 61: Hoare triple {49230#(<= ~counter~0 4)} assume !(0 == ~cond); {49230#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:40,837 INFO L290 TraceCheckUtils]: 62: Hoare triple {49230#(<= ~counter~0 4)} assume true; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:40,838 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 12:21:40,838 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 12:21:40,839 INFO L290 TraceCheckUtils]: 65: Hoare triple {49230#(<= ~counter~0 4)} ~cond := #in~cond; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:40,839 INFO L290 TraceCheckUtils]: 66: Hoare triple {49230#(<= ~counter~0 4)} assume !(0 == ~cond); {49230#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:40,839 INFO L290 TraceCheckUtils]: 67: Hoare triple {49230#(<= ~counter~0 4)} assume true; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:40,840 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 12:21:40,840 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 12:21:40,840 INFO L290 TraceCheckUtils]: 70: Hoare triple {49230#(<= ~counter~0 4)} ~cond := #in~cond; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:40,841 INFO L290 TraceCheckUtils]: 71: Hoare triple {49230#(<= ~counter~0 4)} assume !(0 == ~cond); {49230#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:40,841 INFO L290 TraceCheckUtils]: 72: Hoare triple {49230#(<= ~counter~0 4)} assume true; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:40,841 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 12:21:40,842 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 12:21:40,842 INFO L290 TraceCheckUtils]: 75: Hoare triple {49230#(<= ~counter~0 4)} ~cond := #in~cond; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:40,842 INFO L290 TraceCheckUtils]: 76: Hoare triple {49230#(<= ~counter~0 4)} assume !(0 == ~cond); {49230#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:40,843 INFO L290 TraceCheckUtils]: 77: Hoare triple {49230#(<= ~counter~0 4)} assume true; {49230#(<= ~counter~0 4)} is VALID [2022-04-28 12:21:40,843 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 12:21:40,844 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 12:21:40,844 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 12:21:40,844 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 12:21:40,845 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 12:21:40,845 INFO L290 TraceCheckUtils]: 83: Hoare triple {49300#(<= ~counter~0 5)} ~cond := #in~cond; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:40,845 INFO L290 TraceCheckUtils]: 84: Hoare triple {49300#(<= ~counter~0 5)} assume !(0 == ~cond); {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:40,846 INFO L290 TraceCheckUtils]: 85: Hoare triple {49300#(<= ~counter~0 5)} assume true; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:40,846 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 12:21:40,847 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 12:21:40,847 INFO L290 TraceCheckUtils]: 88: Hoare triple {49300#(<= ~counter~0 5)} ~cond := #in~cond; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:40,847 INFO L290 TraceCheckUtils]: 89: Hoare triple {49300#(<= ~counter~0 5)} assume !(0 == ~cond); {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:40,847 INFO L290 TraceCheckUtils]: 90: Hoare triple {49300#(<= ~counter~0 5)} assume true; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:40,848 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 12:21:40,848 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 12:21:40,849 INFO L290 TraceCheckUtils]: 93: Hoare triple {49300#(<= ~counter~0 5)} ~cond := #in~cond; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:40,849 INFO L290 TraceCheckUtils]: 94: Hoare triple {49300#(<= ~counter~0 5)} assume !(0 == ~cond); {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:40,849 INFO L290 TraceCheckUtils]: 95: Hoare triple {49300#(<= ~counter~0 5)} assume true; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:40,849 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 12:21:40,850 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 12:21:40,850 INFO L290 TraceCheckUtils]: 98: Hoare triple {49300#(<= ~counter~0 5)} ~cond := #in~cond; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:40,851 INFO L290 TraceCheckUtils]: 99: Hoare triple {49300#(<= ~counter~0 5)} assume !(0 == ~cond); {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:40,851 INFO L290 TraceCheckUtils]: 100: Hoare triple {49300#(<= ~counter~0 5)} assume true; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:40,851 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 12:21:40,852 INFO L290 TraceCheckUtils]: 102: Hoare triple {49300#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:40,852 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 12:21:40,852 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 12:21:40,853 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 12:21:40,853 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 12:21:40,853 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 12:21:40,854 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 12:21:40,854 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 12:21:40,854 INFO L290 TraceCheckUtils]: 110: Hoare triple {49051#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49051#false} is VALID [2022-04-28 12:21:40,854 INFO L290 TraceCheckUtils]: 111: Hoare triple {49051#false} assume !(#t~post6 < 10);havoc #t~post6; {49051#false} is VALID [2022-04-28 12:21:40,854 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 12:21:40,854 INFO L290 TraceCheckUtils]: 113: Hoare triple {49051#false} ~cond := #in~cond; {49051#false} is VALID [2022-04-28 12:21:40,854 INFO L290 TraceCheckUtils]: 114: Hoare triple {49051#false} assume 0 == ~cond; {49051#false} is VALID [2022-04-28 12:21:40,854 INFO L290 TraceCheckUtils]: 115: Hoare triple {49051#false} assume !false; {49051#false} is VALID [2022-04-28 12:21:40,854 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 12:21:40,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:21:41,293 INFO L290 TraceCheckUtils]: 115: Hoare triple {49051#false} assume !false; {49051#false} is VALID [2022-04-28 12:21:41,293 INFO L290 TraceCheckUtils]: 114: Hoare triple {49051#false} assume 0 == ~cond; {49051#false} is VALID [2022-04-28 12:21:41,293 INFO L290 TraceCheckUtils]: 113: Hoare triple {49051#false} ~cond := #in~cond; {49051#false} is VALID [2022-04-28 12:21:41,293 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 12:21:41,293 INFO L290 TraceCheckUtils]: 111: Hoare triple {49051#false} assume !(#t~post6 < 10);havoc #t~post6; {49051#false} is VALID [2022-04-28 12:21:41,293 INFO L290 TraceCheckUtils]: 110: Hoare triple {49051#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49051#false} is VALID [2022-04-28 12:21:41,293 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 12:21:41,293 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 12:21:41,294 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 12:21:41,294 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 12:21:41,294 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 12:21:41,295 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 12:21:41,295 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 12:21:41,296 INFO L290 TraceCheckUtils]: 102: Hoare triple {49443#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {49443#(< ~counter~0 9)} is VALID [2022-04-28 12:21:41,296 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {49050#true} {49443#(< ~counter~0 9)} #92#return; {49443#(< ~counter~0 9)} is VALID [2022-04-28 12:21:41,296 INFO L290 TraceCheckUtils]: 100: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 12:21:41,296 INFO L290 TraceCheckUtils]: 99: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 12:21:41,296 INFO L290 TraceCheckUtils]: 98: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 12:21:41,297 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 12:21:41,297 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {49050#true} {49443#(< ~counter~0 9)} #90#return; {49443#(< ~counter~0 9)} is VALID [2022-04-28 12:21:41,297 INFO L290 TraceCheckUtils]: 95: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 12:21:41,297 INFO L290 TraceCheckUtils]: 94: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 12:21:41,297 INFO L290 TraceCheckUtils]: 93: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 12:21:41,297 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 12:21:41,298 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {49050#true} {49443#(< ~counter~0 9)} #88#return; {49443#(< ~counter~0 9)} is VALID [2022-04-28 12:21:41,298 INFO L290 TraceCheckUtils]: 90: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 12:21:41,298 INFO L290 TraceCheckUtils]: 89: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 12:21:41,298 INFO L290 TraceCheckUtils]: 88: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 12:21:41,298 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 12:21:41,298 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {49050#true} {49443#(< ~counter~0 9)} #86#return; {49443#(< ~counter~0 9)} is VALID [2022-04-28 12:21:41,298 INFO L290 TraceCheckUtils]: 85: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 12:21:41,299 INFO L290 TraceCheckUtils]: 84: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 12:21:41,299 INFO L290 TraceCheckUtils]: 83: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 12:21:41,299 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 12:21:41,299 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 12:21:41,299 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 12:21:41,300 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 12:21:41,300 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {49050#true} {49516#(< ~counter~0 8)} #92#return; {49516#(< ~counter~0 8)} is VALID [2022-04-28 12:21:41,300 INFO L290 TraceCheckUtils]: 77: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 12:21:41,300 INFO L290 TraceCheckUtils]: 76: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 12:21:41,300 INFO L290 TraceCheckUtils]: 75: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 12:21:41,301 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 12:21:41,301 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {49050#true} {49516#(< ~counter~0 8)} #90#return; {49516#(< ~counter~0 8)} is VALID [2022-04-28 12:21:41,301 INFO L290 TraceCheckUtils]: 72: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 12:21:41,301 INFO L290 TraceCheckUtils]: 71: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 12:21:41,301 INFO L290 TraceCheckUtils]: 70: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 12:21:41,301 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 12:21:41,302 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {49050#true} {49516#(< ~counter~0 8)} #88#return; {49516#(< ~counter~0 8)} is VALID [2022-04-28 12:21:41,302 INFO L290 TraceCheckUtils]: 67: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 12:21:41,302 INFO L290 TraceCheckUtils]: 66: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 12:21:41,302 INFO L290 TraceCheckUtils]: 65: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 12:21:41,302 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 12:21:41,302 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {49050#true} {49516#(< ~counter~0 8)} #86#return; {49516#(< ~counter~0 8)} is VALID [2022-04-28 12:21:41,302 INFO L290 TraceCheckUtils]: 62: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 12:21:41,302 INFO L290 TraceCheckUtils]: 61: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 12:21:41,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 12:21:41,303 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 12:21:41,303 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 12:21:41,303 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 12:21:41,304 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 12:21:41,304 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 12:21:41,304 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 12:21:41,305 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 12:21:41,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {49300#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:41,306 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {49050#true} {49300#(<= ~counter~0 5)} #92#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:41,306 INFO L290 TraceCheckUtils]: 50: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 12:21:41,306 INFO L290 TraceCheckUtils]: 49: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 12:21:41,306 INFO L290 TraceCheckUtils]: 48: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 12:21:41,306 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 12:21:41,306 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {49050#true} {49300#(<= ~counter~0 5)} #90#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:41,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 12:21:41,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 12:21:41,306 INFO L290 TraceCheckUtils]: 43: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 12:21:41,306 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 12:21:41,307 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {49050#true} {49300#(<= ~counter~0 5)} #88#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:41,307 INFO L290 TraceCheckUtils]: 40: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 12:21:41,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 12:21:41,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 12:21:41,307 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 12:21:41,308 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {49050#true} {49300#(<= ~counter~0 5)} #86#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-28 12:21:41,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 12:21:41,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 12:21:41,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 12:21:41,308 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 12:21:41,308 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 12:21:41,309 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 12:21:41,309 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 12:21:41,309 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 12:21:41,310 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 12:21:41,310 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {49050#true} {49220#(<= ~counter~0 3)} #84#return; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:41,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 12:21:41,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 12:21:41,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 12:21:41,310 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 12:21:41,311 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {49050#true} {49220#(<= ~counter~0 3)} #82#return; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:41,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 12:21:41,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 12:21:41,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 12:21:41,311 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 12:21:41,311 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 12:21:41,311 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {49050#true} {49220#(<= ~counter~0 3)} #80#return; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:41,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 12:21:41,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 12:21:41,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 12:21:41,312 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 12:21:41,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {49050#true} {49220#(<= ~counter~0 3)} #78#return; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:41,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-28 12:21:41,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-28 12:21:41,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-28 12:21:41,312 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 12:21:41,313 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 12:21:41,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {49220#(<= ~counter~0 3)} call #t~ret8 := main(); {49220#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:41,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49220#(<= ~counter~0 3)} {49050#true} #98#return; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:41,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {49220#(<= ~counter~0 3)} assume true; {49220#(<= ~counter~0 3)} is VALID [2022-04-28 12:21:41,316 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 12:21:41,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {49050#true} call ULTIMATE.init(); {49050#true} is VALID [2022-04-28 12:21:41,316 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 12:21:41,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:21:41,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206777371] [2022-04-28 12:21:41,317 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:21:41,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262452798] [2022-04-28 12:21:41,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262452798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:21:41,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:21:41,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 12:21:41,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:21:41,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [756501817] [2022-04-28 12:21:41,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [756501817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:21:41,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:21:41,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 12:21:41,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465318783] [2022-04-28 12:21:41,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:21:41,318 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 12:21:41,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:21:41,318 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 12:21:41,383 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 12:21:41,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 12:21:41,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:41,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 12:21:41,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:21:41,384 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 12:21:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:42,934 INFO L93 Difference]: Finished difference Result 731 states and 966 transitions. [2022-04-28 12:21:42,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 12:21:42,934 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 12:21:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:21:42,935 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 12:21:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 175 transitions. [2022-04-28 12:21:42,937 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 12:21:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 175 transitions. [2022-04-28 12:21:42,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 175 transitions. [2022-04-28 12:21:43,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:43,164 INFO L225 Difference]: With dead ends: 731 [2022-04-28 12:21:43,165 INFO L226 Difference]: Without dead ends: 561 [2022-04-28 12:21:43,166 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 12:21:43,167 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 12:21:43,167 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 12:21:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-04-28 12:21:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 553. [2022-04-28 12:21:44,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:21:44,326 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 12:21:44,326 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 12:21:44,327 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 12:21:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:44,344 INFO L93 Difference]: Finished difference Result 561 states and 699 transitions. [2022-04-28 12:21:44,344 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 699 transitions. [2022-04-28 12:21:44,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:44,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:44,346 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 12:21:44,347 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 12:21:44,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:44,365 INFO L93 Difference]: Finished difference Result 561 states and 699 transitions. [2022-04-28 12:21:44,365 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 699 transitions. [2022-04-28 12:21:44,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:44,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:44,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:21:44,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:21:44,367 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 12:21:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 692 transitions. [2022-04-28 12:21:44,399 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 692 transitions. Word has length 116 [2022-04-28 12:21:44,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:21:44,399 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 692 transitions. [2022-04-28 12:21:44,399 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 12:21:44,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 553 states and 692 transitions. [2022-04-28 12:21:45,541 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 12:21:45,541 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 692 transitions. [2022-04-28 12:21:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 12:21:45,542 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:21:45,542 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 12:21:45,559 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 12:21:45,742 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 12:21:45,743 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:21:45,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:21:45,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1978671899, now seen corresponding path program 3 times [2022-04-28 12:21:45,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:45,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1897610482] [2022-04-28 12:21:45,744 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:21:45,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1978671899, now seen corresponding path program 4 times [2022-04-28 12:21:45,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:21:45,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290507388] [2022-04-28 12:21:45,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:21:45,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:21:45,755 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:21:45,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [947087351] [2022-04-28 12:21:45,756 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:21:45,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:21:45,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:21:45,757 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 12:21:45,757 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 12:21:45,811 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:21:45,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:21:45,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 12:21:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:21:45,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:21:46,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {53459#true} call ULTIMATE.init(); {53459#true} is VALID [2022-04-28 12:21:46,171 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 12:21:46,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53459#true} {53459#true} #98#return; {53459#true} is VALID [2022-04-28 12:21:46,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {53459#true} call #t~ret8 := main(); {53459#true} is VALID [2022-04-28 12:21:46,171 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 12:21:46,171 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 12:21:46,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:46,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:46,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,172 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {53459#true} {53459#true} #78#return; {53459#true} is VALID [2022-04-28 12:21:46,172 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 12:21:46,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:46,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:46,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,172 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {53459#true} {53459#true} #80#return; {53459#true} is VALID [2022-04-28 12:21:46,172 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 12:21:46,172 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 12:21:46,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:46,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:46,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,172 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {53459#true} {53459#true} #82#return; {53459#true} is VALID [2022-04-28 12:21:46,173 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 12:21:46,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:46,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:46,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,173 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {53459#true} {53459#true} #84#return; {53459#true} is VALID [2022-04-28 12:21:46,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {53459#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53459#true} is VALID [2022-04-28 12:21:46,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {53459#true} assume !!(#t~post6 < 10);havoc #t~post6; {53459#true} is VALID [2022-04-28 12:21:46,173 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 12:21:46,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-28 12:21:46,173 INFO L290 TraceCheckUtils]: 31: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-28 12:21:46,173 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 12:21:46,173 INFO L290 TraceCheckUtils]: 33: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:46,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:46,173 INFO L290 TraceCheckUtils]: 35: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,174 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-28 12:21:46,174 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 12:21:46,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:46,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:46,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,174 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-28 12:21:46,174 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 12:21:46,174 INFO L290 TraceCheckUtils]: 43: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:46,174 INFO L290 TraceCheckUtils]: 44: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:46,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,174 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {53459#true} {53459#true} #90#return; {53459#true} is VALID [2022-04-28 12:21:46,174 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 12:21:46,174 INFO L290 TraceCheckUtils]: 48: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:46,174 INFO L290 TraceCheckUtils]: 49: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:46,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,175 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {53459#true} {53459#true} #92#return; {53459#true} is VALID [2022-04-28 12:21:46,175 INFO L290 TraceCheckUtils]: 52: Hoare triple {53459#true} assume !(~c~0 >= ~b~0); {53459#true} is VALID [2022-04-28 12:21:46,175 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 12:21:46,175 INFO L290 TraceCheckUtils]: 54: Hoare triple {53459#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53459#true} is VALID [2022-04-28 12:21:46,175 INFO L290 TraceCheckUtils]: 55: Hoare triple {53459#true} assume !!(#t~post6 < 10);havoc #t~post6; {53459#true} is VALID [2022-04-28 12:21:46,175 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 12:21:46,175 INFO L290 TraceCheckUtils]: 57: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-28 12:21:46,175 INFO L290 TraceCheckUtils]: 58: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-28 12:21:46,175 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 12:21:46,175 INFO L290 TraceCheckUtils]: 60: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:46,175 INFO L290 TraceCheckUtils]: 61: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:46,175 INFO L290 TraceCheckUtils]: 62: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,176 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-28 12:21:46,176 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 12:21:46,176 INFO L290 TraceCheckUtils]: 65: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:46,176 INFO L290 TraceCheckUtils]: 66: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:46,176 INFO L290 TraceCheckUtils]: 67: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,176 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-28 12:21:46,176 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 12:21:46,176 INFO L290 TraceCheckUtils]: 70: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:46,176 INFO L290 TraceCheckUtils]: 71: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:46,176 INFO L290 TraceCheckUtils]: 72: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,176 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {53459#true} {53459#true} #90#return; {53459#true} is VALID [2022-04-28 12:21:46,176 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 12:21:46,176 INFO L290 TraceCheckUtils]: 75: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:46,176 INFO L290 TraceCheckUtils]: 76: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:46,177 INFO L290 TraceCheckUtils]: 77: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,177 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {53459#true} {53459#true} #92#return; {53459#true} is VALID [2022-04-28 12:21:46,177 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 12:21:46,177 INFO L290 TraceCheckUtils]: 80: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-28 12:21:46,177 INFO L290 TraceCheckUtils]: 81: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-28 12:21:46,177 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 12:21:46,177 INFO L290 TraceCheckUtils]: 83: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:46,177 INFO L290 TraceCheckUtils]: 84: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:46,177 INFO L290 TraceCheckUtils]: 85: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,177 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-28 12:21:46,177 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 12:21:46,177 INFO L290 TraceCheckUtils]: 88: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:46,177 INFO L290 TraceCheckUtils]: 89: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:46,177 INFO L290 TraceCheckUtils]: 90: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,178 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-28 12:21:46,178 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 12:21:46,178 INFO L290 TraceCheckUtils]: 93: Hoare triple {53459#true} ~cond := #in~cond; {53743#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:21:46,178 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 12:21:46,179 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 12:21:46,180 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 12:21:46,180 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 12:21:46,180 INFO L290 TraceCheckUtils]: 98: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:46,180 INFO L290 TraceCheckUtils]: 99: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:46,180 INFO L290 TraceCheckUtils]: 100: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,181 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 12:21:46,181 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 12:21:46,182 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 12:21:46,182 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 12:21:46,182 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 12:21:46,183 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 12:21:46,183 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 12:21:46,184 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 12:21:46,184 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 12:21:46,184 INFO L290 TraceCheckUtils]: 110: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:46,184 INFO L290 TraceCheckUtils]: 111: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:46,184 INFO L290 TraceCheckUtils]: 112: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:46,185 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 12:21:46,185 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 12:21:46,186 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 12:21:46,186 INFO L290 TraceCheckUtils]: 116: Hoare triple {53814#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53460#false} is VALID [2022-04-28 12:21:46,186 INFO L290 TraceCheckUtils]: 117: Hoare triple {53460#false} assume !false; {53460#false} is VALID [2022-04-28 12:21:46,187 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 12:21:46,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:21:55,420 INFO L290 TraceCheckUtils]: 117: Hoare triple {53460#false} assume !false; {53460#false} is VALID [2022-04-28 12:21:55,421 INFO L290 TraceCheckUtils]: 116: Hoare triple {53814#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53460#false} is VALID [2022-04-28 12:21:55,421 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 12:21:55,422 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 12:21:55,422 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 12:21:55,422 INFO L290 TraceCheckUtils]: 112: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,422 INFO L290 TraceCheckUtils]: 111: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:55,422 INFO L290 TraceCheckUtils]: 110: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:55,422 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 12:21:55,423 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 12:21:55,424 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 12:21:55,424 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 12:21:55,424 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 12:21:55,425 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 12:21:55,425 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 12:21:55,426 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 12:21:55,427 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 12:21:55,427 INFO L290 TraceCheckUtils]: 100: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,427 INFO L290 TraceCheckUtils]: 99: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:55,427 INFO L290 TraceCheckUtils]: 98: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:55,427 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 12:21:55,428 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 12:21:55,428 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 12:21:55,428 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 12:21:55,429 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 12:21:55,429 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 12:21:55,429 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-28 12:21:55,429 INFO L290 TraceCheckUtils]: 90: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,429 INFO L290 TraceCheckUtils]: 89: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:55,429 INFO L290 TraceCheckUtils]: 88: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:55,429 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 12:21:55,429 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-28 12:21:55,429 INFO L290 TraceCheckUtils]: 85: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,429 INFO L290 TraceCheckUtils]: 84: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:55,429 INFO L290 TraceCheckUtils]: 83: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:55,430 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 12:21:55,430 INFO L290 TraceCheckUtils]: 81: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-28 12:21:55,430 INFO L290 TraceCheckUtils]: 80: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-28 12:21:55,430 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 12:21:55,430 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {53459#true} {53459#true} #92#return; {53459#true} is VALID [2022-04-28 12:21:55,430 INFO L290 TraceCheckUtils]: 77: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,430 INFO L290 TraceCheckUtils]: 76: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:55,430 INFO L290 TraceCheckUtils]: 75: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:55,430 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 12:21:55,430 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {53459#true} {53459#true} #90#return; {53459#true} is VALID [2022-04-28 12:21:55,430 INFO L290 TraceCheckUtils]: 72: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,430 INFO L290 TraceCheckUtils]: 71: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:55,430 INFO L290 TraceCheckUtils]: 70: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:55,431 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 12:21:55,431 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-28 12:21:55,431 INFO L290 TraceCheckUtils]: 67: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,431 INFO L290 TraceCheckUtils]: 66: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:55,431 INFO L290 TraceCheckUtils]: 65: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:55,431 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 12:21:55,431 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-28 12:21:55,431 INFO L290 TraceCheckUtils]: 62: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,431 INFO L290 TraceCheckUtils]: 61: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:55,431 INFO L290 TraceCheckUtils]: 60: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:55,431 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 12:21:55,431 INFO L290 TraceCheckUtils]: 58: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-28 12:21:55,431 INFO L290 TraceCheckUtils]: 57: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-28 12:21:55,431 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 12:21:55,432 INFO L290 TraceCheckUtils]: 55: Hoare triple {53459#true} assume !!(#t~post6 < 10);havoc #t~post6; {53459#true} is VALID [2022-04-28 12:21:55,432 INFO L290 TraceCheckUtils]: 54: Hoare triple {53459#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53459#true} is VALID [2022-04-28 12:21:55,432 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 12:21:55,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {53459#true} assume !(~c~0 >= ~b~0); {53459#true} is VALID [2022-04-28 12:21:55,432 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {53459#true} {53459#true} #92#return; {53459#true} is VALID [2022-04-28 12:21:55,432 INFO L290 TraceCheckUtils]: 50: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,432 INFO L290 TraceCheckUtils]: 49: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:55,432 INFO L290 TraceCheckUtils]: 48: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:55,432 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 12:21:55,432 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {53459#true} {53459#true} #90#return; {53459#true} is VALID [2022-04-28 12:21:55,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:55,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:55,433 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 12:21:55,433 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-28 12:21:55,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,433 INFO L290 TraceCheckUtils]: 39: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:55,433 INFO L290 TraceCheckUtils]: 38: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:55,433 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 12:21:55,433 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-28 12:21:55,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:55,433 INFO L290 TraceCheckUtils]: 33: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:55,433 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 12:21:55,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-28 12:21:55,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-28 12:21:55,434 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 12:21:55,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {53459#true} assume !!(#t~post6 < 10);havoc #t~post6; {53459#true} is VALID [2022-04-28 12:21:55,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {53459#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53459#true} is VALID [2022-04-28 12:21:55,434 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {53459#true} {53459#true} #84#return; {53459#true} is VALID [2022-04-28 12:21:55,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:55,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:55,434 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 12:21:55,434 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {53459#true} {53459#true} #82#return; {53459#true} is VALID [2022-04-28 12:21:55,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:55,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:55,434 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 12:21:55,435 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 12:21:55,435 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {53459#true} {53459#true} #80#return; {53459#true} is VALID [2022-04-28 12:21:55,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:55,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:55,435 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 12:21:55,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {53459#true} {53459#true} #78#return; {53459#true} is VALID [2022-04-28 12:21:55,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-28 12:21:55,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-28 12:21:55,435 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 12:21:55,435 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 12:21:55,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {53459#true} call #t~ret8 := main(); {53459#true} is VALID [2022-04-28 12:21:55,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53459#true} {53459#true} #98#return; {53459#true} is VALID [2022-04-28 12:21:55,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-28 12:21:55,436 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 12:21:55,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {53459#true} call ULTIMATE.init(); {53459#true} is VALID [2022-04-28 12:21:55,436 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 12:21:55,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:21:55,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290507388] [2022-04-28 12:21:55,436 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:21:55,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947087351] [2022-04-28 12:21:55,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947087351] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:21:55,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:21:55,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 12:21:55,437 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:21:55,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1897610482] [2022-04-28 12:21:55,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1897610482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:21:55,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:21:55,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:21:55,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077585813] [2022-04-28 12:21:55,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:21:55,437 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 12:21:55,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:21:55,437 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 12:21:55,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:55,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:21:55,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:55,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:21:55,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:21:55,482 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 12:21:57,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:57,168 INFO L93 Difference]: Finished difference Result 584 states and 734 transitions. [2022-04-28 12:21:57,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:21:57,168 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 12:21:57,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:21:57,169 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 12:21:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-04-28 12:21:57,169 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 12:21:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-04-28 12:21:57,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2022-04-28 12:21:57,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:21:57,253 INFO L225 Difference]: With dead ends: 584 [2022-04-28 12:21:57,253 INFO L226 Difference]: Without dead ends: 581 [2022-04-28 12:21:57,254 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 12:21:57,254 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 12:21:57,254 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 12:21:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-04-28 12:21:58,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 577. [2022-04-28 12:21:58,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:21:58,371 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 12:21:58,372 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 12:21:58,372 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 12:21:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:58,384 INFO L93 Difference]: Finished difference Result 581 states and 730 transitions. [2022-04-28 12:21:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 730 transitions. [2022-04-28 12:21:58,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:58,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:58,386 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 12:21:58,386 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 12:21:58,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:21:58,403 INFO L93 Difference]: Finished difference Result 581 states and 730 transitions. [2022-04-28 12:21:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 730 transitions. [2022-04-28 12:21:58,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:21:58,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:21:58,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:21:58,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:21:58,405 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 12:21:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 726 transitions. [2022-04-28 12:21:58,427 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 726 transitions. Word has length 118 [2022-04-28 12:21:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:21:58,427 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 726 transitions. [2022-04-28 12:21:58,427 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 12:21:58,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 577 states and 726 transitions. [2022-04-28 12:21:59,592 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 12:21:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 726 transitions. [2022-04-28 12:21:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-28 12:21:59,593 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:21:59,593 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 12:21:59,611 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 12:21:59,795 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 12:21:59,795 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:21:59,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:21:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash 992936989, now seen corresponding path program 5 times [2022-04-28 12:21:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:21:59,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [492422378] [2022-04-28 12:21:59,796 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:21:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash 992936989, now seen corresponding path program 6 times [2022-04-28 12:21:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:21:59,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742179674] [2022-04-28 12:21:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:21:59,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:21:59,807 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:21:59,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [991246207] [2022-04-28 12:21:59,808 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:21:59,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:21:59,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:21:59,809 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 12:21:59,817 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 12:22:00,197 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 12:22:00,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:22:00,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 12:22:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:22:00,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:22:24,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {57666#true} call ULTIMATE.init(); {57666#true} is VALID [2022-04-28 12:22:24,367 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 12:22:24,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57666#true} {57666#true} #98#return; {57666#true} is VALID [2022-04-28 12:22:24,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {57666#true} call #t~ret8 := main(); {57666#true} is VALID [2022-04-28 12:22:24,367 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 12:22:24,367 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 12:22:24,368 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 12:22:24,368 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 12:22:24,368 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 12:22:24,369 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 12:22:24,369 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 12:22:24,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 12:22:24,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 12:22:24,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,369 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 12:22:24,370 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 12:22:24,370 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 12:22:24,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 12:22:24,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 12:22:24,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,370 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 12:22:24,371 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 12:22:24,371 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 12:22:24,371 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 12:22:24,371 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 12:22:24,372 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 12:22:24,373 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 12:22:24,373 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 12:22:24,373 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 12:22:24,374 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 12:22:24,374 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 12:22:24,374 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 12:22:24,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 12:22:24,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 12:22:24,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,375 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 12:22:24,375 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 12:22:24,375 INFO L290 TraceCheckUtils]: 38: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 12:22:24,375 INFO L290 TraceCheckUtils]: 39: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 12:22:24,375 INFO L290 TraceCheckUtils]: 40: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,376 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 12:22:24,376 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 12:22:24,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 12:22:24,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 12:22:24,376 INFO L290 TraceCheckUtils]: 45: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,377 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 12:22:24,377 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 12:22:24,377 INFO L290 TraceCheckUtils]: 48: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 12:22:24,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 12:22:24,377 INFO L290 TraceCheckUtils]: 50: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,378 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 12:22:24,378 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 12:22:24,379 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 12:22:24,379 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 12:22:24,379 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 12:22:24,379 INFO L290 TraceCheckUtils]: 56: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 12:22:24,379 INFO L290 TraceCheckUtils]: 57: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 12:22:24,379 INFO L290 TraceCheckUtils]: 58: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,380 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 12:22:24,380 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 12:22:24,380 INFO L290 TraceCheckUtils]: 61: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 12:22:24,380 INFO L290 TraceCheckUtils]: 62: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 12:22:24,380 INFO L290 TraceCheckUtils]: 63: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,381 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 12:22:24,381 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 12:22:24,381 INFO L290 TraceCheckUtils]: 66: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 12:22:24,381 INFO L290 TraceCheckUtils]: 67: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 12:22:24,381 INFO L290 TraceCheckUtils]: 68: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,382 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 12:22:24,382 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 12:22:24,382 INFO L290 TraceCheckUtils]: 71: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 12:22:24,382 INFO L290 TraceCheckUtils]: 72: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 12:22:24,382 INFO L290 TraceCheckUtils]: 73: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,382 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 12:22:24,384 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 12:22:24,384 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 12:22:24,385 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 12:22:24,385 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 12:22:24,385 INFO L290 TraceCheckUtils]: 79: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 12:22:24,385 INFO L290 TraceCheckUtils]: 80: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 12:22:24,385 INFO L290 TraceCheckUtils]: 81: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,385 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 12:22:24,386 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 12:22:24,386 INFO L290 TraceCheckUtils]: 84: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 12:22:24,386 INFO L290 TraceCheckUtils]: 85: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 12:22:24,386 INFO L290 TraceCheckUtils]: 86: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,386 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 12:22:24,386 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 12:22:24,387 INFO L290 TraceCheckUtils]: 89: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 12:22:24,387 INFO L290 TraceCheckUtils]: 90: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 12:22:24,387 INFO L290 TraceCheckUtils]: 91: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,387 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 12:22:24,387 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 12:22:24,387 INFO L290 TraceCheckUtils]: 94: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 12:22:24,387 INFO L290 TraceCheckUtils]: 95: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 12:22:24,387 INFO L290 TraceCheckUtils]: 96: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,388 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 12:22:24,389 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 12:22:24,389 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 12:22:24,389 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 12:22:24,390 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 12:22:24,390 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 12:22:24,391 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 12:22:24,391 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 12:22:24,391 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 12:22:24,391 INFO L290 TraceCheckUtils]: 106: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 12:22:24,391 INFO L290 TraceCheckUtils]: 107: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 12:22:24,391 INFO L290 TraceCheckUtils]: 108: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,392 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 12:22:24,392 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 12:22:24,392 INFO L290 TraceCheckUtils]: 111: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-28 12:22:24,392 INFO L290 TraceCheckUtils]: 112: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-28 12:22:24,392 INFO L290 TraceCheckUtils]: 113: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-28 12:22:24,393 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 12:22:24,393 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 12:22:24,393 INFO L290 TraceCheckUtils]: 116: Hoare triple {57666#true} ~cond := #in~cond; {58028#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:22:24,393 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 12:22:24,394 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 12:22:24,394 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 12:22:24,399 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 12:22:24,399 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 12:22:24,399 INFO L290 TraceCheckUtils]: 122: Hoare triple {58047#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {57667#false} is VALID [2022-04-28 12:22:24,399 INFO L290 TraceCheckUtils]: 123: Hoare triple {57667#false} assume !false; {57667#false} is VALID [2022-04-28 12:22:24,400 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 12:22:24,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:22:56,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:22:56,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742179674] [2022-04-28 12:22:56,029 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:22:56,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991246207] [2022-04-28 12:22:56,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991246207] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 12:22:56,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:22:56,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 12:22:56,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:22:56,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [492422378] [2022-04-28 12:22:56,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [492422378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:22:56,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:22:56,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 12:22:56,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792139155] [2022-04-28 12:22:56,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:22:56,030 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 12:22:56,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:22:56,031 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 12:22:56,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:22:56,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 12:22:56,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:22:56,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 12:22:56,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-04-28 12:22:56,121 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 12:23:10,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:23:10,126 INFO L93 Difference]: Finished difference Result 604 states and 757 transitions. [2022-04-28 12:23:10,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 12:23:10,126 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 12:23:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:23:10,126 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 12:23:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 111 transitions. [2022-04-28 12:23:10,128 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 12:23:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 111 transitions. [2022-04-28 12:23:10,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 111 transitions. [2022-04-28 12:23:10,300 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 12:23:10,318 INFO L225 Difference]: With dead ends: 604 [2022-04-28 12:23:10,318 INFO L226 Difference]: Without dead ends: 600 [2022-04-28 12:23:10,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2022-04-28 12:23:10,319 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 57 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:23:10,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 315 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 12:23:10,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-04-28 12:23:11,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 578. [2022-04-28 12:23:11,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:23:11,559 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 12:23:11,559 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 12:23:11,560 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 12:23:11,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:23:11,572 INFO L93 Difference]: Finished difference Result 600 states and 752 transitions. [2022-04-28 12:23:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 752 transitions. [2022-04-28 12:23:11,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:23:11,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:23:11,573 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 12:23:11,574 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 12:23:11,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:23:11,587 INFO L93 Difference]: Finished difference Result 600 states and 752 transitions. [2022-04-28 12:23:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 752 transitions. [2022-04-28 12:23:11,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:23:11,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:23:11,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:23:11,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:23:11,589 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 12:23:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 720 transitions. [2022-04-28 12:23:11,605 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 720 transitions. Word has length 124 [2022-04-28 12:23:11,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:23:11,606 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 720 transitions. [2022-04-28 12:23:11,606 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 12:23:11,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 578 states and 720 transitions. [2022-04-28 12:23:12,869 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 12:23:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 720 transitions. [2022-04-28 12:23:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 12:23:12,870 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:23:12,870 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 12:23:12,875 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 12:23:13,070 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 12:23:13,071 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:23:13,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:23:13,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1110867224, now seen corresponding path program 7 times [2022-04-28 12:23:13,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:23:13,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [257197758] [2022-04-28 12:23:13,071 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:23:13,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1110867224, now seen corresponding path program 8 times [2022-04-28 12:23:13,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:23:13,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801549513] [2022-04-28 12:23:13,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:23:13,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:23:13,081 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:23:13,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2100258441] [2022-04-28 12:23:13,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:23:13,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:23:13,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:23:13,082 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 12:23:13,083 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 12:23:13,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:23:13,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:23:13,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-28 12:23:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:23:13,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:23:25,295 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:23:31,348 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:23:38,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {61782#true} call ULTIMATE.init(); {61782#true} is VALID [2022-04-28 12:23:38,889 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 12:23:38,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:23:38,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61782#true} {61782#true} #98#return; {61782#true} is VALID [2022-04-28 12:23:38,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {61782#true} call #t~ret8 := main(); {61782#true} is VALID [2022-04-28 12:23:38,889 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 12:23:38,889 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 12:23:38,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:23:38,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:23:38,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:23:38,890 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {61782#true} {61782#true} #78#return; {61782#true} is VALID [2022-04-28 12:23:38,890 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 12:23:38,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:23:38,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:23:38,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:23:38,890 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {61782#true} {61782#true} #80#return; {61782#true} is VALID [2022-04-28 12:23:38,890 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 12:23:38,890 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 12:23:38,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:23:38,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:23:38,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:23:38,891 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 12:23:38,891 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 12:23:38,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:23:38,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:23:38,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:23:38,892 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 12:23:38,892 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 12:23:38,893 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 12:23:38,893 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 12:23:38,893 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 12:23:38,894 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 12:23:38,894 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 12:23:38,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:23:38,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:23:38,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:23:38,895 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 12:23:38,895 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 12:23:38,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:23:38,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:23:38,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:23:38,895 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 12:23:38,895 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 12:23:38,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {61782#true} ~cond := #in~cond; {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:23:38,896 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 12:23:38,896 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 12:23:38,897 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 12:23:38,897 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 12:23:38,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:23:38,897 INFO L290 TraceCheckUtils]: 49: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:23:38,897 INFO L290 TraceCheckUtils]: 50: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:23:38,898 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 12:23:38,898 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 12:23:38,898 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 12:23:38,899 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 12:23:38,899 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 12:23:38,900 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 12:23:38,900 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 12:23:38,900 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 12:23:38,900 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 12:23:38,900 INFO L290 TraceCheckUtils]: 60: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:23:38,900 INFO L290 TraceCheckUtils]: 61: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:23:38,901 INFO L290 TraceCheckUtils]: 62: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:23:38,901 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 12:23:38,901 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 12:23:38,901 INFO L290 TraceCheckUtils]: 65: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:23:38,901 INFO L290 TraceCheckUtils]: 66: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:23:38,901 INFO L290 TraceCheckUtils]: 67: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:23:38,902 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 12:23:38,902 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 12:23:38,902 INFO L290 TraceCheckUtils]: 70: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:23:38,902 INFO L290 TraceCheckUtils]: 71: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:23:38,902 INFO L290 TraceCheckUtils]: 72: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:23:38,903 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 12:23:38,903 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 12:23:38,903 INFO L290 TraceCheckUtils]: 75: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:23:38,903 INFO L290 TraceCheckUtils]: 76: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:23:38,903 INFO L290 TraceCheckUtils]: 77: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:23:38,904 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 12:23:38,905 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 12:23:38,905 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 12:23:38,905 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 12:23:38,905 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 12:23:38,906 INFO L290 TraceCheckUtils]: 83: Hoare triple {61782#true} ~cond := #in~cond; {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:23:38,906 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 12:23:38,906 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 12:23:38,907 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 12:23:38,907 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 12:23:38,907 INFO L290 TraceCheckUtils]: 88: Hoare triple {61782#true} ~cond := #in~cond; {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:23:38,907 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 12:23:38,908 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 12:23:38,909 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 12:23:38,909 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 12:23:38,909 INFO L290 TraceCheckUtils]: 93: Hoare triple {61782#true} ~cond := #in~cond; {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:23:38,909 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 12:23:38,910 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 12:23:38,912 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 12:23:38,912 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 12:23:38,912 INFO L290 TraceCheckUtils]: 98: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:23:38,912 INFO L290 TraceCheckUtils]: 99: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:23:38,912 INFO L290 TraceCheckUtils]: 100: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:23:38,913 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 12:23:38,913 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 12:23:38,917 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 12:23:38,918 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 12:23:38,918 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 12:23:38,919 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 12:23:38,919 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 12:23:38,920 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 12:23:38,920 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 12:23:38,920 INFO L290 TraceCheckUtils]: 110: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:23:38,920 INFO L290 TraceCheckUtils]: 111: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:23:38,920 INFO L290 TraceCheckUtils]: 112: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:23:38,920 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 12:23:38,920 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 12:23:38,921 INFO L290 TraceCheckUtils]: 115: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:23:38,921 INFO L290 TraceCheckUtils]: 116: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:23:38,921 INFO L290 TraceCheckUtils]: 117: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:23:38,921 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 12:23:38,926 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 12:23:38,926 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 12:23:38,927 INFO L290 TraceCheckUtils]: 121: Hoare triple {62158#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {61783#false} is VALID [2022-04-28 12:23:38,927 INFO L290 TraceCheckUtils]: 122: Hoare triple {61783#false} assume !false; {61783#false} is VALID [2022-04-28 12:23:38,927 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 12:23:38,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:24:42,995 INFO L290 TraceCheckUtils]: 122: Hoare triple {61783#false} assume !false; {61783#false} is VALID [2022-04-28 12:24:42,995 INFO L290 TraceCheckUtils]: 121: Hoare triple {62158#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {61783#false} is VALID [2022-04-28 12:24:42,996 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 12:24:42,996 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 12:24:42,997 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 12:24:42,997 INFO L290 TraceCheckUtils]: 117: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:24:42,997 INFO L290 TraceCheckUtils]: 116: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:24:42,997 INFO L290 TraceCheckUtils]: 115: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:24:42,997 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 12:24:42,998 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 12:24:42,998 INFO L290 TraceCheckUtils]: 112: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:24:42,998 INFO L290 TraceCheckUtils]: 111: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:24:42,998 INFO L290 TraceCheckUtils]: 110: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:24:42,998 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 12:24:42,998 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 12:24:42,999 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 12:24:42,999 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 12:24:42,999 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 12:24:43,000 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 12:24:45,002 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 12:24:45,003 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 12:24:45,003 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 12:24:45,004 INFO L290 TraceCheckUtils]: 100: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:24:45,004 INFO L290 TraceCheckUtils]: 99: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:24:45,004 INFO L290 TraceCheckUtils]: 98: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:24:45,004 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 12:24:45,005 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 12:24:45,005 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 12:24:45,005 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 12:24:45,005 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 12:24:45,005 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 12:24:45,006 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 12:24:45,007 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 12:24:45,007 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 12:24:45,007 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 12:24:45,007 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 12:24:45,024 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 12:24:45,024 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 12:24:45,025 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 12:24:45,025 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 12:24:45,025 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 12:24:45,025 INFO L290 TraceCheckUtils]: 81: Hoare triple {61782#true} assume !!(#t~post7 < 10);havoc #t~post7; {61782#true} is VALID [2022-04-28 12:24:45,025 INFO L290 TraceCheckUtils]: 80: Hoare triple {61782#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61782#true} is VALID [2022-04-28 12:24:45,025 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 12:24:45,025 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {61782#true} {61782#true} #92#return; {61782#true} is VALID [2022-04-28 12:24:45,025 INFO L290 TraceCheckUtils]: 77: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:24:45,025 INFO L290 TraceCheckUtils]: 76: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:24:45,025 INFO L290 TraceCheckUtils]: 75: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:24:45,025 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 12:24:45,025 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {61782#true} {61782#true} #90#return; {61782#true} is VALID [2022-04-28 12:24:45,025 INFO L290 TraceCheckUtils]: 72: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:24:45,026 INFO L290 TraceCheckUtils]: 71: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:24:45,026 INFO L290 TraceCheckUtils]: 70: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:24:45,026 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 12:24:45,026 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {61782#true} {61782#true} #88#return; {61782#true} is VALID [2022-04-28 12:24:45,026 INFO L290 TraceCheckUtils]: 67: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:24:45,026 INFO L290 TraceCheckUtils]: 66: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:24:45,026 INFO L290 TraceCheckUtils]: 65: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:24:45,026 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 12:24:45,026 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {61782#true} {61782#true} #86#return; {61782#true} is VALID [2022-04-28 12:24:45,026 INFO L290 TraceCheckUtils]: 62: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:24:45,026 INFO L290 TraceCheckUtils]: 61: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:24:45,026 INFO L290 TraceCheckUtils]: 60: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:24:45,026 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 12:24:45,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {61782#true} assume !!(#t~post7 < 10);havoc #t~post7; {61782#true} is VALID [2022-04-28 12:24:45,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {61782#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61782#true} is VALID [2022-04-28 12:24:45,026 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 12:24:45,026 INFO L290 TraceCheckUtils]: 55: Hoare triple {61782#true} assume !!(#t~post6 < 10);havoc #t~post6; {61782#true} is VALID [2022-04-28 12:24:45,026 INFO L290 TraceCheckUtils]: 54: Hoare triple {61782#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61782#true} is VALID [2022-04-28 12:24:45,026 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 12:24:45,026 INFO L290 TraceCheckUtils]: 52: Hoare triple {61782#true} assume !(~c~0 >= ~b~0); {61782#true} is VALID [2022-04-28 12:24:45,026 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {61782#true} {61782#true} #92#return; {61782#true} is VALID [2022-04-28 12:24:45,027 INFO L290 TraceCheckUtils]: 50: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:24:45,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:24:45,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:24:45,027 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 12:24:45,027 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {61782#true} {61782#true} #90#return; {61782#true} is VALID [2022-04-28 12:24:45,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:24:45,027 INFO L290 TraceCheckUtils]: 44: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:24:45,027 INFO L290 TraceCheckUtils]: 43: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:24:45,027 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 12:24:45,027 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {61782#true} {61782#true} #88#return; {61782#true} is VALID [2022-04-28 12:24:45,027 INFO L290 TraceCheckUtils]: 40: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:24:45,027 INFO L290 TraceCheckUtils]: 39: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:24:45,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:24:45,027 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 12:24:45,027 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {61782#true} {61782#true} #86#return; {61782#true} is VALID [2022-04-28 12:24:45,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:24:45,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:24:45,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:24:45,027 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 12:24:45,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {61782#true} assume !!(#t~post7 < 10);havoc #t~post7; {61782#true} is VALID [2022-04-28 12:24:45,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {61782#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61782#true} is VALID [2022-04-28 12:24:45,028 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 12:24:45,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {61782#true} assume !!(#t~post6 < 10);havoc #t~post6; {61782#true} is VALID [2022-04-28 12:24:45,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {61782#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61782#true} is VALID [2022-04-28 12:24:45,028 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {61782#true} {61782#true} #84#return; {61782#true} is VALID [2022-04-28 12:24:45,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:24:45,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:24:45,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:24:45,028 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 12:24:45,028 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {61782#true} {61782#true} #82#return; {61782#true} is VALID [2022-04-28 12:24:45,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:24:45,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:24:45,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:24:45,028 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 12:24:45,028 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 12:24:45,028 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {61782#true} {61782#true} #80#return; {61782#true} is VALID [2022-04-28 12:24:45,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:24:45,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:24:45,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:24:45,028 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 12:24:45,029 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {61782#true} {61782#true} #78#return; {61782#true} is VALID [2022-04-28 12:24:45,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:24:45,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-28 12:24:45,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-28 12:24:45,029 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 12:24:45,029 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 12:24:45,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {61782#true} call #t~ret8 := main(); {61782#true} is VALID [2022-04-28 12:24:45,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61782#true} {61782#true} #98#return; {61782#true} is VALID [2022-04-28 12:24:45,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-28 12:24:45,029 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 12:24:45,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {61782#true} call ULTIMATE.init(); {61782#true} is VALID [2022-04-28 12:24:45,029 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 12:24:45,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:24:45,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801549513] [2022-04-28 12:24:45,030 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:24:45,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100258441] [2022-04-28 12:24:45,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100258441] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:24:45,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:24:45,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2022-04-28 12:24:45,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:24:45,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [257197758] [2022-04-28 12:24:45,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [257197758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:24:45,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:24:45,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 12:24:45,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839837238] [2022-04-28 12:24:45,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:24:45,031 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 12:24:45,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:24:45,031 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 12:24:45,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:24:45,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 12:24:45,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:24:45,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 12:24:45,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-28 12:24:45,134 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 12:24:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:24:48,776 INFO L93 Difference]: Finished difference Result 613 states and 769 transitions. [2022-04-28 12:24:48,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 12:24:48,776 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 12:24:48,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:24:48,776 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 12:24:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2022-04-28 12:24:48,778 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 12:24:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2022-04-28 12:24:48,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 138 transitions. [2022-04-28 12:24:48,955 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 12:24:48,972 INFO L225 Difference]: With dead ends: 613 [2022-04-28 12:24:48,972 INFO L226 Difference]: Without dead ends: 611 [2022-04-28 12:24:48,972 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 12:24:48,972 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 12:24:48,973 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 12:24:48,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-04-28 12:24:50,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 605. [2022-04-28 12:24:50,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:24:50,295 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 12:24:50,296 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 12:24:50,296 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 12:24:50,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:24:50,316 INFO L93 Difference]: Finished difference Result 611 states and 767 transitions. [2022-04-28 12:24:50,316 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 767 transitions. [2022-04-28 12:24:50,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:24:50,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:24:50,318 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 12:24:50,319 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 12:24:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:24:50,338 INFO L93 Difference]: Finished difference Result 611 states and 767 transitions. [2022-04-28 12:24:50,339 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 767 transitions. [2022-04-28 12:24:50,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:24:50,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:24:50,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:24:50,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:24:50,341 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 12:24:50,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 761 transitions. [2022-04-28 12:24:50,367 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 761 transitions. Word has length 123 [2022-04-28 12:24:50,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:24:50,367 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 761 transitions. [2022-04-28 12:24:50,367 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 12:24:50,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 605 states and 761 transitions. [2022-04-28 12:24:51,790 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 12:24:51,790 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 761 transitions. [2022-04-28 12:24:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-28 12:24:51,791 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:24:51,791 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 12:24:51,808 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 12:24:51,995 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 12:24:51,995 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:24:51,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:24:51,996 INFO L85 PathProgramCache]: Analyzing trace with hash -270396677, now seen corresponding path program 9 times [2022-04-28 12:24:51,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:24:51,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [940355626] [2022-04-28 12:24:51,996 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:24:51,996 INFO L85 PathProgramCache]: Analyzing trace with hash -270396677, now seen corresponding path program 10 times [2022-04-28 12:24:51,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:24:51,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287860443] [2022-04-28 12:24:51,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:24:51,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:24:52,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:24:52,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50065893] [2022-04-28 12:24:52,006 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:24:52,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:24:52,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:24:52,007 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 12:24:52,008 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 12:24:52,088 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:24:52,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:24:52,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-28 12:24:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:24:52,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:24:53,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {66204#true} call ULTIMATE.init(); {66204#true} is VALID [2022-04-28 12:24:53,704 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 12:24:53,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66204#true} {66204#true} #98#return; {66204#true} is VALID [2022-04-28 12:24:53,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {66204#true} call #t~ret8 := main(); {66204#true} is VALID [2022-04-28 12:24:53,705 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 12:24:53,705 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 12:24:53,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:24:53,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:24:53,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,705 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {66204#true} {66204#true} #78#return; {66204#true} is VALID [2022-04-28 12:24:53,705 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 12:24:53,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:24:53,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:24:53,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,705 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {66204#true} {66204#true} #80#return; {66204#true} is VALID [2022-04-28 12:24:53,706 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 12:24:53,706 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 12:24:53,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:24:53,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:24:53,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,707 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 12:24:53,707 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 12:24:53,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:24:53,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:24:53,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,707 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 12:24:53,708 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 12:24:53,708 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 12:24:53,709 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 12:24:53,709 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 12:24:53,710 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 12:24:53,710 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 12:24:53,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:24:53,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:24:53,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,711 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 12:24:53,711 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 12:24:53,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {66204#true} ~cond := #in~cond; {66325#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:24:53,711 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 12:24:53,711 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 12:24:53,712 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 12:24:53,713 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 12:24:53,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {66204#true} ~cond := #in~cond; {66325#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:24:53,713 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 12:24:53,713 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 12:24:53,714 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 12:24:53,714 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 12:24:53,714 INFO L290 TraceCheckUtils]: 48: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:24:53,714 INFO L290 TraceCheckUtils]: 49: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:24:53,714 INFO L290 TraceCheckUtils]: 50: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,715 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 12:24:53,715 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 12:24:53,716 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 12:24:53,716 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 12:24:53,717 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 12:24:53,717 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 12:24:53,718 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 12:24:53,718 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 12:24:53,718 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 12:24:53,718 INFO L290 TraceCheckUtils]: 60: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:24:53,718 INFO L290 TraceCheckUtils]: 61: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:24:53,718 INFO L290 TraceCheckUtils]: 62: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,719 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 12:24:53,719 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 12:24:53,719 INFO L290 TraceCheckUtils]: 65: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:24:53,719 INFO L290 TraceCheckUtils]: 66: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:24:53,719 INFO L290 TraceCheckUtils]: 67: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,720 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 12:24:53,720 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 12:24:53,720 INFO L290 TraceCheckUtils]: 70: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:24:53,720 INFO L290 TraceCheckUtils]: 71: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:24:53,720 INFO L290 TraceCheckUtils]: 72: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,721 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 12:24:53,721 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 12:24:53,721 INFO L290 TraceCheckUtils]: 75: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:24:53,721 INFO L290 TraceCheckUtils]: 76: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:24:53,721 INFO L290 TraceCheckUtils]: 77: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,722 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 12:24:53,722 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 12:24:53,723 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 12:24:53,723 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 12:24:53,723 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 12:24:53,723 INFO L290 TraceCheckUtils]: 83: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:24:53,724 INFO L290 TraceCheckUtils]: 84: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:24:53,724 INFO L290 TraceCheckUtils]: 85: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,725 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 12:24:53,725 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 12:24:53,725 INFO L290 TraceCheckUtils]: 88: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:24:53,725 INFO L290 TraceCheckUtils]: 89: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:24:53,725 INFO L290 TraceCheckUtils]: 90: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,726 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 12:24:53,726 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 12:24:53,726 INFO L290 TraceCheckUtils]: 93: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:24:53,726 INFO L290 TraceCheckUtils]: 94: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:24:53,726 INFO L290 TraceCheckUtils]: 95: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,726 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 12:24:53,727 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 12:24:53,727 INFO L290 TraceCheckUtils]: 98: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:24:53,727 INFO L290 TraceCheckUtils]: 99: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:24:53,727 INFO L290 TraceCheckUtils]: 100: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,727 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 12:24:53,728 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 12:24:53,728 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 12:24:53,729 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 12:24:53,729 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 12:24:53,730 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 12:24:53,730 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 12:24:53,731 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 12:24:53,731 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 12:24:53,731 INFO L290 TraceCheckUtils]: 110: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:24:53,731 INFO L290 TraceCheckUtils]: 111: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:24:53,731 INFO L290 TraceCheckUtils]: 112: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,731 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 12:24:53,732 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 12:24:53,732 INFO L290 TraceCheckUtils]: 115: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:24:53,732 INFO L290 TraceCheckUtils]: 116: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:24:53,732 INFO L290 TraceCheckUtils]: 117: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:24:53,732 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 12:24:53,732 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 12:24:53,733 INFO L290 TraceCheckUtils]: 120: Hoare triple {66204#true} ~cond := #in~cond; {66325#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:24:53,733 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 12:24:53,733 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 12:24:53,734 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 12:24:53,736 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 12:24:53,737 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 12:24:53,737 INFO L290 TraceCheckUtils]: 126: Hoare triple {66594#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {66205#false} is VALID [2022-04-28 12:24:53,737 INFO L290 TraceCheckUtils]: 127: Hoare triple {66205#false} assume !false; {66205#false} is VALID [2022-04-28 12:24:53,738 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 12:24:53,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:26:08,995 INFO L290 TraceCheckUtils]: 127: Hoare triple {66205#false} assume !false; {66205#false} is VALID [2022-04-28 12:26:08,995 INFO L290 TraceCheckUtils]: 126: Hoare triple {66594#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {66205#false} is VALID [2022-04-28 12:26:08,995 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 12:26:08,996 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 12:26:08,997 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 12:26:08,997 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 12:26:08,997 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 12:26:08,998 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 12:26:08,998 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 12:26:08,998 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 12:26:08,999 INFO L290 TraceCheckUtils]: 117: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:08,999 INFO L290 TraceCheckUtils]: 116: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:26:08,999 INFO L290 TraceCheckUtils]: 115: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:26:08,999 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 12:26:09,010 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 12:26:09,010 INFO L290 TraceCheckUtils]: 112: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:09,010 INFO L290 TraceCheckUtils]: 111: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:26:09,010 INFO L290 TraceCheckUtils]: 110: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:26:09,010 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 12:26:09,011 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 12:26:09,011 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 12:26:09,012 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 12:26:09,012 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 12:26:09,013 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 12:26:11,015 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 12:26:11,016 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 12:26:11,016 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 12:26:11,016 INFO L290 TraceCheckUtils]: 100: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:11,016 INFO L290 TraceCheckUtils]: 99: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:26:11,016 INFO L290 TraceCheckUtils]: 98: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:26:11,017 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 12:26:11,017 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 12:26:11,017 INFO L290 TraceCheckUtils]: 95: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:11,017 INFO L290 TraceCheckUtils]: 94: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:26:11,017 INFO L290 TraceCheckUtils]: 93: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:26:11,017 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 12:26:11,018 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 12:26:11,018 INFO L290 TraceCheckUtils]: 90: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:11,018 INFO L290 TraceCheckUtils]: 89: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:26:11,018 INFO L290 TraceCheckUtils]: 88: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:26:11,018 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 12:26:11,019 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 12:26:11,019 INFO L290 TraceCheckUtils]: 85: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:11,019 INFO L290 TraceCheckUtils]: 84: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:26:11,019 INFO L290 TraceCheckUtils]: 83: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:26:11,019 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 12:26:11,020 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 12:26:11,020 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 12:26:13,022 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 12:26:13,023 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 12:26:13,023 INFO L290 TraceCheckUtils]: 77: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:13,023 INFO L290 TraceCheckUtils]: 76: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:26:13,023 INFO L290 TraceCheckUtils]: 75: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:26:13,023 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 12:26:13,024 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 12:26:13,024 INFO L290 TraceCheckUtils]: 72: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:13,024 INFO L290 TraceCheckUtils]: 71: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:26:13,024 INFO L290 TraceCheckUtils]: 70: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:26:13,024 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 12:26:13,025 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 12:26:13,025 INFO L290 TraceCheckUtils]: 67: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:13,025 INFO L290 TraceCheckUtils]: 66: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:26:13,025 INFO L290 TraceCheckUtils]: 65: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:26:13,025 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 12:26:13,026 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 12:26:13,026 INFO L290 TraceCheckUtils]: 62: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:13,026 INFO L290 TraceCheckUtils]: 61: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:26:13,026 INFO L290 TraceCheckUtils]: 60: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:26:13,026 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 12:26:13,027 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 12:26:13,027 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 12:26:13,320 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 12:26:13,321 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 12:26:13,321 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 12:26:15,323 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 12:26:15,324 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 12:26:15,325 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 12:26:15,325 INFO L290 TraceCheckUtils]: 50: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:15,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:26:15,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:26:15,325 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 12:26:15,327 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 12:26:15,327 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 12:26:15,327 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 12:26:15,328 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 12:26:15,328 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 12:26:15,329 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 12:26:15,334 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 12:26:15,335 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 12:26:15,335 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 12:26:15,335 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 12:26:15,336 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 12:26:15,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:15,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:26:15,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:26:15,336 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 12:26:15,337 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 12:26:15,338 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 12:26:15,338 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 12:26:15,339 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 12:26:15,339 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 12:26:15,340 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 12:26:15,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:15,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:26:15,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:26:15,340 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 12:26:15,341 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 12:26:15,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:15,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:26:15,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:26:15,341 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 12:26:15,343 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 12:26:15,343 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {66204#true} {66204#true} #80#return; {66204#true} is VALID [2022-04-28 12:26:15,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:15,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:26:15,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:26:15,343 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 12:26:15,343 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {66204#true} {66204#true} #78#return; {66204#true} is VALID [2022-04-28 12:26:15,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:15,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-28 12:26:15,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-28 12:26:15,343 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 12:26:15,343 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 12:26:15,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {66204#true} call #t~ret8 := main(); {66204#true} is VALID [2022-04-28 12:26:15,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66204#true} {66204#true} #98#return; {66204#true} is VALID [2022-04-28 12:26:15,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-28 12:26:15,344 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 12:26:15,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {66204#true} call ULTIMATE.init(); {66204#true} is VALID [2022-04-28 12:26:15,345 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 12:26:15,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:26:15,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287860443] [2022-04-28 12:26:15,345 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:26:15,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50065893] [2022-04-28 12:26:15,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50065893] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:26:15,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:26:15,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 23 [2022-04-28 12:26:15,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:26:15,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [940355626] [2022-04-28 12:26:15,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [940355626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:26:15,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:26:15,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:26:15,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3418855] [2022-04-28 12:26:15,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:26:15,347 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 12:26:15,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:26:15,347 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 12:26:15,481 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 12:26:15,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:26:15,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:26:15,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:26:15,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=386, Unknown=1, NotChecked=0, Total=506 [2022-04-28 12:26:15,482 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 12:26:30,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:26:30,738 INFO L93 Difference]: Finished difference Result 617 states and 772 transitions. [2022-04-28 12:26:30,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 12:26:30,738 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 12:26:30,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:26:30,738 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 12:26:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-28 12:26:30,739 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 12:26:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-28 12:26:30,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 138 transitions. [2022-04-28 12:26:30,958 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 12:26:30,975 INFO L225 Difference]: With dead ends: 617 [2022-04-28 12:26:30,975 INFO L226 Difference]: Without dead ends: 615 [2022-04-28 12:26:30,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=158, Invalid=543, Unknown=1, NotChecked=0, Total=702 [2022-04-28 12:26:30,975 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 37 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 12:26:30,976 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.4s Time] [2022-04-28 12:26:30,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-04-28 12:26:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 609. [2022-04-28 12:26:32,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:26:32,263 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 12:26:32,264 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 12:26:32,264 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 12:26:32,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:26:32,277 INFO L93 Difference]: Finished difference Result 615 states and 770 transitions. [2022-04-28 12:26:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 770 transitions. [2022-04-28 12:26:32,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:26:32,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:26:32,278 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 12:26:32,278 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 12:26:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:26:32,297 INFO L93 Difference]: Finished difference Result 615 states and 770 transitions. [2022-04-28 12:26:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 770 transitions. [2022-04-28 12:26:32,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:26:32,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:26:32,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:26:32,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:26:32,299 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 12:26:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 764 transitions. [2022-04-28 12:26:32,334 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 764 transitions. Word has length 128 [2022-04-28 12:26:32,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:26:32,334 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 764 transitions. [2022-04-28 12:26:32,334 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 12:26:32,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 609 states and 764 transitions. [2022-04-28 12:26:33,990 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 12:26:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 764 transitions. [2022-04-28 12:26:33,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-28 12:26:33,991 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:26:33,991 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 12:26:34,007 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 12:26:34,191 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 12:26:34,192 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:26:34,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:26:34,192 INFO L85 PathProgramCache]: Analyzing trace with hash -677811269, now seen corresponding path program 7 times [2022-04-28 12:26:34,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:26:34,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [109176252] [2022-04-28 12:26:34,192 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:26:34,192 INFO L85 PathProgramCache]: Analyzing trace with hash -677811269, now seen corresponding path program 8 times [2022-04-28 12:26:34,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:26:34,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597804886] [2022-04-28 12:26:34,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:26:34,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:26:34,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:26:34,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [974518871] [2022-04-28 12:26:34,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:26:34,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:26:34,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:26:34,215 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 12:26:34,216 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 12:26:34,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:26:34,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:26:34,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 12:26:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:26:34,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:26:35,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {70684#true} call ULTIMATE.init(); {70684#true} is VALID [2022-04-28 12:26:35,676 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 12:26:35,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70684#true} {70684#true} #98#return; {70684#true} is VALID [2022-04-28 12:26:35,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {70684#true} call #t~ret8 := main(); {70684#true} is VALID [2022-04-28 12:26:35,676 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 12:26:35,676 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 12:26:35,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,676 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {70684#true} {70684#true} #78#return; {70684#true} is VALID [2022-04-28 12:26:35,676 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 12:26:35,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,677 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {70684#true} {70684#true} #80#return; {70684#true} is VALID [2022-04-28 12:26:35,677 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 12:26:35,677 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 12:26:35,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,678 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 12:26:35,678 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 12:26:35,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,679 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 12:26:35,680 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 12:26:35,680 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 12:26:35,681 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 12:26:35,681 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 12:26:35,682 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 12:26:35,682 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 12:26:35,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,683 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 12:26:35,683 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 12:26:35,683 INFO L290 TraceCheckUtils]: 38: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,683 INFO L290 TraceCheckUtils]: 39: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,683 INFO L290 TraceCheckUtils]: 40: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,684 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 12:26:35,684 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 12:26:35,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,684 INFO L290 TraceCheckUtils]: 44: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,684 INFO L290 TraceCheckUtils]: 45: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,685 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 12:26:35,685 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 12:26:35,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,685 INFO L290 TraceCheckUtils]: 50: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,686 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 12:26:35,689 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 12:26:35,689 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 12:26:35,690 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 12:26:35,690 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 12:26:35,690 INFO L290 TraceCheckUtils]: 56: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,690 INFO L290 TraceCheckUtils]: 57: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,690 INFO L290 TraceCheckUtils]: 58: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,691 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 12:26:35,691 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 12:26:35,691 INFO L290 TraceCheckUtils]: 61: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,691 INFO L290 TraceCheckUtils]: 62: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,691 INFO L290 TraceCheckUtils]: 63: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,692 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 12:26:35,692 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 12:26:35,692 INFO L290 TraceCheckUtils]: 66: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,693 INFO L290 TraceCheckUtils]: 67: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,693 INFO L290 TraceCheckUtils]: 68: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,693 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 12:26:35,693 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 12:26:35,693 INFO L290 TraceCheckUtils]: 71: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,694 INFO L290 TraceCheckUtils]: 72: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,694 INFO L290 TraceCheckUtils]: 73: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,695 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 12:26:35,696 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 12:26:35,697 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 12:26:35,697 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 12:26:35,698 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 12:26:35,698 INFO L290 TraceCheckUtils]: 79: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,698 INFO L290 TraceCheckUtils]: 80: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,698 INFO L290 TraceCheckUtils]: 81: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,699 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 12:26:35,699 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 12:26:35,699 INFO L290 TraceCheckUtils]: 84: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,699 INFO L290 TraceCheckUtils]: 85: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,699 INFO L290 TraceCheckUtils]: 86: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,700 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 12:26:35,700 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 12:26:35,700 INFO L290 TraceCheckUtils]: 89: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,700 INFO L290 TraceCheckUtils]: 90: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,700 INFO L290 TraceCheckUtils]: 91: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,701 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 12:26:35,701 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 12:26:35,701 INFO L290 TraceCheckUtils]: 94: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,701 INFO L290 TraceCheckUtils]: 95: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,701 INFO L290 TraceCheckUtils]: 96: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,702 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 12:26:35,704 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 12:26:35,705 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 12:26:35,705 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 12:26:35,705 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 12:26:35,706 INFO L290 TraceCheckUtils]: 102: Hoare triple {70684#true} ~cond := #in~cond; {71000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:26:35,706 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 12:26:35,706 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 12:26:35,708 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 12:26:35,708 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 12:26:35,708 INFO L290 TraceCheckUtils]: 107: Hoare triple {70684#true} ~cond := #in~cond; {71000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:26:35,709 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 12:26:35,709 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 12:26:35,711 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 12:26:35,711 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 12:26:35,712 INFO L290 TraceCheckUtils]: 112: Hoare triple {70684#true} ~cond := #in~cond; {71000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:26:35,712 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 12:26:35,713 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 12:26:35,714 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 12:26:35,714 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 12:26:35,714 INFO L290 TraceCheckUtils]: 117: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:26:35,714 INFO L290 TraceCheckUtils]: 118: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:26:35,714 INFO L290 TraceCheckUtils]: 119: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:26:35,715 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 12:26:35,716 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 12:26:35,720 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 12:26:35,721 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 12:26:35,721 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 12:26:35,722 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 12:26:35,722 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 12:26:35,723 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 12:26:35,723 INFO L290 TraceCheckUtils]: 128: Hoare triple {71083#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {70685#false} is VALID [2022-04-28 12:26:35,723 INFO L290 TraceCheckUtils]: 129: Hoare triple {70685#false} assume !false; {70685#false} is VALID [2022-04-28 12:26:35,724 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 12:26:35,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:28:37,736 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:29:13,980 INFO L290 TraceCheckUtils]: 129: Hoare triple {70685#false} assume !false; {70685#false} is VALID [2022-04-28 12:29:13,981 INFO L290 TraceCheckUtils]: 128: Hoare triple {71083#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {70685#false} is VALID [2022-04-28 12:29:13,981 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 12:29:13,981 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 12:29:13,982 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 12:29:13,982 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 12:29:13,982 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 12:29:15,224 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 12:29:15,224 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 12:29:15,225 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 12:29:15,225 INFO L290 TraceCheckUtils]: 119: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,225 INFO L290 TraceCheckUtils]: 118: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,225 INFO L290 TraceCheckUtils]: 117: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,225 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 12:29:15,226 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 12:29:15,226 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 12:29:15,227 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 12:29:15,227 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 12:29:15,227 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 12:29:15,228 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 12:29:15,228 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 12:29:15,228 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 12:29:15,229 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 12:29:15,229 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 12:29:15,247 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 12:29:15,247 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 12:29:15,248 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 12:29:15,248 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 12:29:15,248 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 12:29:15,248 INFO L290 TraceCheckUtils]: 100: Hoare triple {70684#true} assume !!(#t~post7 < 10);havoc #t~post7; {70684#true} is VALID [2022-04-28 12:29:15,248 INFO L290 TraceCheckUtils]: 99: Hoare triple {70684#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70684#true} is VALID [2022-04-28 12:29:15,248 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 12:29:15,248 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {70684#true} {70684#true} #92#return; {70684#true} is VALID [2022-04-28 12:29:15,248 INFO L290 TraceCheckUtils]: 96: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,248 INFO L290 TraceCheckUtils]: 95: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,248 INFO L290 TraceCheckUtils]: 94: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,248 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 12:29:15,249 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {70684#true} {70684#true} #90#return; {70684#true} is VALID [2022-04-28 12:29:15,249 INFO L290 TraceCheckUtils]: 91: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,249 INFO L290 TraceCheckUtils]: 90: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,249 INFO L290 TraceCheckUtils]: 89: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,249 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 12:29:15,249 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {70684#true} {70684#true} #88#return; {70684#true} is VALID [2022-04-28 12:29:15,249 INFO L290 TraceCheckUtils]: 86: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,249 INFO L290 TraceCheckUtils]: 85: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,249 INFO L290 TraceCheckUtils]: 84: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,249 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 12:29:15,249 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {70684#true} {70684#true} #86#return; {70684#true} is VALID [2022-04-28 12:29:15,249 INFO L290 TraceCheckUtils]: 81: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,249 INFO L290 TraceCheckUtils]: 80: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,249 INFO L290 TraceCheckUtils]: 79: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,249 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 12:29:15,249 INFO L290 TraceCheckUtils]: 77: Hoare triple {70684#true} assume !!(#t~post7 < 10);havoc #t~post7; {70684#true} is VALID [2022-04-28 12:29:15,249 INFO L290 TraceCheckUtils]: 76: Hoare triple {70684#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70684#true} is VALID [2022-04-28 12:29:15,249 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 12:29:15,249 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {70684#true} {70684#true} #92#return; {70684#true} is VALID [2022-04-28 12:29:15,249 INFO L290 TraceCheckUtils]: 73: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,249 INFO L290 TraceCheckUtils]: 72: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,250 INFO L290 TraceCheckUtils]: 71: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,250 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 12:29:15,250 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {70684#true} {70684#true} #90#return; {70684#true} is VALID [2022-04-28 12:29:15,250 INFO L290 TraceCheckUtils]: 68: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,250 INFO L290 TraceCheckUtils]: 67: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,250 INFO L290 TraceCheckUtils]: 66: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,250 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 12:29:15,250 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {70684#true} {70684#true} #88#return; {70684#true} is VALID [2022-04-28 12:29:15,250 INFO L290 TraceCheckUtils]: 63: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,250 INFO L290 TraceCheckUtils]: 62: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,250 INFO L290 TraceCheckUtils]: 61: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,250 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 12:29:15,250 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {70684#true} {70684#true} #86#return; {70684#true} is VALID [2022-04-28 12:29:15,250 INFO L290 TraceCheckUtils]: 58: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,250 INFO L290 TraceCheckUtils]: 57: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,250 INFO L290 TraceCheckUtils]: 56: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,250 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 12:29:15,250 INFO L290 TraceCheckUtils]: 54: Hoare triple {70684#true} assume !!(#t~post7 < 10);havoc #t~post7; {70684#true} is VALID [2022-04-28 12:29:15,250 INFO L290 TraceCheckUtils]: 53: Hoare triple {70684#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70684#true} is VALID [2022-04-28 12:29:15,250 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 12:29:15,250 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {70684#true} {70684#true} #92#return; {70684#true} is VALID [2022-04-28 12:29:15,251 INFO L290 TraceCheckUtils]: 50: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,251 INFO L290 TraceCheckUtils]: 49: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,251 INFO L290 TraceCheckUtils]: 48: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,251 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 12:29:15,251 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {70684#true} {70684#true} #90#return; {70684#true} is VALID [2022-04-28 12:29:15,251 INFO L290 TraceCheckUtils]: 45: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,251 INFO L290 TraceCheckUtils]: 43: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,251 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 12:29:15,251 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {70684#true} {70684#true} #88#return; {70684#true} is VALID [2022-04-28 12:29:15,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,251 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 12:29:15,251 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {70684#true} {70684#true} #86#return; {70684#true} is VALID [2022-04-28 12:29:15,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,251 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 12:29:15,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {70684#true} assume !!(#t~post7 < 10);havoc #t~post7; {70684#true} is VALID [2022-04-28 12:29:15,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {70684#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70684#true} is VALID [2022-04-28 12:29:15,252 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 12:29:15,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {70684#true} assume !!(#t~post6 < 10);havoc #t~post6; {70684#true} is VALID [2022-04-28 12:29:15,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {70684#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70684#true} is VALID [2022-04-28 12:29:15,252 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {70684#true} {70684#true} #84#return; {70684#true} is VALID [2022-04-28 12:29:15,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,252 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 12:29:15,252 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {70684#true} {70684#true} #82#return; {70684#true} is VALID [2022-04-28 12:29:15,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,252 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 12:29:15,252 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 12:29:15,252 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {70684#true} {70684#true} #80#return; {70684#true} is VALID [2022-04-28 12:29:15,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,252 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 12:29:15,252 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {70684#true} {70684#true} #78#return; {70684#true} is VALID [2022-04-28 12:29:15,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-28 12:29:15,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-28 12:29:15,253 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 12:29:15,253 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 12:29:15,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {70684#true} call #t~ret8 := main(); {70684#true} is VALID [2022-04-28 12:29:15,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70684#true} {70684#true} #98#return; {70684#true} is VALID [2022-04-28 12:29:15,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-28 12:29:15,253 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 12:29:15,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {70684#true} call ULTIMATE.init(); {70684#true} is VALID [2022-04-28 12:29:15,253 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 12:29:15,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:15,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597804886] [2022-04-28 12:29:15,254 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:15,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974518871] [2022-04-28 12:29:15,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974518871] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:29:15,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:29:15,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2022-04-28 12:29:15,254 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:15,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [109176252] [2022-04-28 12:29:15,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [109176252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:15,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:15,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 12:29:15,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259520391] [2022-04-28 12:29:15,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:15,255 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 12:29:15,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:15,255 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 12:29:15,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:15,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 12:29:15,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:15,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 12:29:15,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2022-04-28 12:29:15,352 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 12:29:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:20,297 INFO L93 Difference]: Finished difference Result 642 states and 811 transitions. [2022-04-28 12:29:20,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 12:29:20,297 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 12:29:20,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:20,298 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 12:29:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2022-04-28 12:29:20,299 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 12:29:20,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2022-04-28 12:29:20,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 138 transitions. [2022-04-28 12:29:20,472 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 12:29:20,489 INFO L225 Difference]: With dead ends: 642 [2022-04-28 12:29:20,489 INFO L226 Difference]: Without dead ends: 637 [2022-04-28 12:29:20,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-04-28 12:29:20,490 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 40 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:20,490 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.4s Time] [2022-04-28 12:29:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-04-28 12:29:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 613. [2022-04-28 12:29:21,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:21,785 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 12:29:21,785 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 12:29:21,785 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 12:29:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:21,802 INFO L93 Difference]: Finished difference Result 637 states and 805 transitions. [2022-04-28 12:29:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 805 transitions. [2022-04-28 12:29:21,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:21,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:21,804 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 12:29:21,804 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 12:29:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:21,821 INFO L93 Difference]: Finished difference Result 637 states and 805 transitions. [2022-04-28 12:29:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 805 transitions. [2022-04-28 12:29:21,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:21,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:21,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:21,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:21,822 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 12:29:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 769 transitions. [2022-04-28 12:29:21,839 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 769 transitions. Word has length 130 [2022-04-28 12:29:21,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:21,839 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 769 transitions. [2022-04-28 12:29:21,839 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 12:29:21,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 613 states and 769 transitions. [2022-04-28 12:29:23,466 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 12:29:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 769 transitions. [2022-04-28 12:29:23,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 12:29:23,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:23,467 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 12:29:23,484 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 12:29:23,668 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 12:29:23,668 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:23,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:23,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2098906485, now seen corresponding path program 7 times [2022-04-28 12:29:23,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:23,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [243114535] [2022-04-28 12:29:23,669 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:23,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2098906485, now seen corresponding path program 8 times [2022-04-28 12:29:23,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:23,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553541896] [2022-04-28 12:29:23,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:23,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:23,678 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:23,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1919783856] [2022-04-28 12:29:23,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:23,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:23,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:23,680 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 12:29:23,702 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 12:29:23,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:23,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:23,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 12:29:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:23,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:24,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {75275#true} call ULTIMATE.init(); {75275#true} is VALID [2022-04-28 12:29:24,262 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 12:29:24,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {75283#(<= ~counter~0 0)} assume true; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:24,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75283#(<= ~counter~0 0)} {75275#true} #98#return; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:24,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {75283#(<= ~counter~0 0)} call #t~ret8 := main(); {75283#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:24,263 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 12:29:24,263 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 12:29:24,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {75283#(<= ~counter~0 0)} ~cond := #in~cond; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:24,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {75283#(<= ~counter~0 0)} assume !(0 == ~cond); {75283#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:24,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {75283#(<= ~counter~0 0)} assume true; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:24,264 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 12:29:24,264 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 12:29:24,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {75283#(<= ~counter~0 0)} ~cond := #in~cond; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:24,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {75283#(<= ~counter~0 0)} assume !(0 == ~cond); {75283#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:24,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {75283#(<= ~counter~0 0)} assume true; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:24,266 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 12:29:24,266 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 12:29:24,266 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 12:29:24,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {75283#(<= ~counter~0 0)} ~cond := #in~cond; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:24,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {75283#(<= ~counter~0 0)} assume !(0 == ~cond); {75283#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:24,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {75283#(<= ~counter~0 0)} assume true; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:24,267 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 12:29:24,268 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 12:29:24,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {75283#(<= ~counter~0 0)} ~cond := #in~cond; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:24,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {75283#(<= ~counter~0 0)} assume !(0 == ~cond); {75283#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:24,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {75283#(<= ~counter~0 0)} assume true; {75283#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:24,269 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 12:29:24,270 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 12:29:24,270 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 12:29:24,271 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 12:29:24,271 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 12:29:24,272 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 12:29:24,272 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 12:29:24,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {75372#(<= ~counter~0 2)} ~cond := #in~cond; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:24,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {75372#(<= ~counter~0 2)} assume !(0 == ~cond); {75372#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:24,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {75372#(<= ~counter~0 2)} assume true; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:24,273 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 12:29:24,274 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 12:29:24,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {75372#(<= ~counter~0 2)} ~cond := #in~cond; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:24,274 INFO L290 TraceCheckUtils]: 39: Hoare triple {75372#(<= ~counter~0 2)} assume !(0 == ~cond); {75372#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:24,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {75372#(<= ~counter~0 2)} assume true; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:24,275 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 12:29:24,276 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 12:29:24,276 INFO L290 TraceCheckUtils]: 43: Hoare triple {75372#(<= ~counter~0 2)} ~cond := #in~cond; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:24,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {75372#(<= ~counter~0 2)} assume !(0 == ~cond); {75372#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:24,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {75372#(<= ~counter~0 2)} assume true; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:24,277 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 12:29:24,277 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 12:29:24,278 INFO L290 TraceCheckUtils]: 48: Hoare triple {75372#(<= ~counter~0 2)} ~cond := #in~cond; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:24,278 INFO L290 TraceCheckUtils]: 49: Hoare triple {75372#(<= ~counter~0 2)} assume !(0 == ~cond); {75372#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:24,278 INFO L290 TraceCheckUtils]: 50: Hoare triple {75372#(<= ~counter~0 2)} assume true; {75372#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:24,279 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 12:29:24,279 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 12:29:24,280 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 12:29:24,280 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 12:29:24,281 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 12:29:24,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {75442#(<= ~counter~0 3)} ~cond := #in~cond; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {75442#(<= ~counter~0 3)} assume !(0 == ~cond); {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,281 INFO L290 TraceCheckUtils]: 58: Hoare triple {75442#(<= ~counter~0 3)} assume true; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,282 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 12:29:24,282 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 12:29:24,283 INFO L290 TraceCheckUtils]: 61: Hoare triple {75442#(<= ~counter~0 3)} ~cond := #in~cond; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,283 INFO L290 TraceCheckUtils]: 62: Hoare triple {75442#(<= ~counter~0 3)} assume !(0 == ~cond); {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,283 INFO L290 TraceCheckUtils]: 63: Hoare triple {75442#(<= ~counter~0 3)} assume true; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,284 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 12:29:24,284 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 12:29:24,284 INFO L290 TraceCheckUtils]: 66: Hoare triple {75442#(<= ~counter~0 3)} ~cond := #in~cond; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,285 INFO L290 TraceCheckUtils]: 67: Hoare triple {75442#(<= ~counter~0 3)} assume !(0 == ~cond); {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,285 INFO L290 TraceCheckUtils]: 68: Hoare triple {75442#(<= ~counter~0 3)} assume true; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,285 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 12:29:24,286 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 12:29:24,286 INFO L290 TraceCheckUtils]: 71: Hoare triple {75442#(<= ~counter~0 3)} ~cond := #in~cond; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,286 INFO L290 TraceCheckUtils]: 72: Hoare triple {75442#(<= ~counter~0 3)} assume !(0 == ~cond); {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,287 INFO L290 TraceCheckUtils]: 73: Hoare triple {75442#(<= ~counter~0 3)} assume true; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,287 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 12:29:24,288 INFO L290 TraceCheckUtils]: 75: Hoare triple {75442#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,288 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 12:29:24,289 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 12:29:24,289 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 12:29:24,289 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 12:29:24,290 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 12:29:24,290 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 12:29:24,291 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 12:29:24,291 INFO L290 TraceCheckUtils]: 83: Hoare triple {75525#(<= ~counter~0 5)} ~cond := #in~cond; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:24,291 INFO L290 TraceCheckUtils]: 84: Hoare triple {75525#(<= ~counter~0 5)} assume !(0 == ~cond); {75525#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:24,291 INFO L290 TraceCheckUtils]: 85: Hoare triple {75525#(<= ~counter~0 5)} assume true; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:24,292 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 12:29:24,292 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 12:29:24,293 INFO L290 TraceCheckUtils]: 88: Hoare triple {75525#(<= ~counter~0 5)} ~cond := #in~cond; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:24,293 INFO L290 TraceCheckUtils]: 89: Hoare triple {75525#(<= ~counter~0 5)} assume !(0 == ~cond); {75525#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:24,293 INFO L290 TraceCheckUtils]: 90: Hoare triple {75525#(<= ~counter~0 5)} assume true; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:24,294 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 12:29:24,294 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 12:29:24,294 INFO L290 TraceCheckUtils]: 93: Hoare triple {75525#(<= ~counter~0 5)} ~cond := #in~cond; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:24,295 INFO L290 TraceCheckUtils]: 94: Hoare triple {75525#(<= ~counter~0 5)} assume !(0 == ~cond); {75525#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:24,295 INFO L290 TraceCheckUtils]: 95: Hoare triple {75525#(<= ~counter~0 5)} assume true; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:24,295 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 12:29:24,296 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 12:29:24,296 INFO L290 TraceCheckUtils]: 98: Hoare triple {75525#(<= ~counter~0 5)} ~cond := #in~cond; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:24,297 INFO L290 TraceCheckUtils]: 99: Hoare triple {75525#(<= ~counter~0 5)} assume !(0 == ~cond); {75525#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:24,297 INFO L290 TraceCheckUtils]: 100: Hoare triple {75525#(<= ~counter~0 5)} assume true; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:24,297 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 12:29:24,298 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 12:29:24,299 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 12:29:24,299 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 12:29:24,299 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 12:29:24,300 INFO L290 TraceCheckUtils]: 106: Hoare triple {75595#(<= ~counter~0 6)} ~cond := #in~cond; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,300 INFO L290 TraceCheckUtils]: 107: Hoare triple {75595#(<= ~counter~0 6)} assume !(0 == ~cond); {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,300 INFO L290 TraceCheckUtils]: 108: Hoare triple {75595#(<= ~counter~0 6)} assume true; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,300 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 12:29:24,301 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 12:29:24,301 INFO L290 TraceCheckUtils]: 111: Hoare triple {75595#(<= ~counter~0 6)} ~cond := #in~cond; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,301 INFO L290 TraceCheckUtils]: 112: Hoare triple {75595#(<= ~counter~0 6)} assume !(0 == ~cond); {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,302 INFO L290 TraceCheckUtils]: 113: Hoare triple {75595#(<= ~counter~0 6)} assume true; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,302 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 12:29:24,303 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 12:29:24,303 INFO L290 TraceCheckUtils]: 116: Hoare triple {75595#(<= ~counter~0 6)} ~cond := #in~cond; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,303 INFO L290 TraceCheckUtils]: 117: Hoare triple {75595#(<= ~counter~0 6)} assume !(0 == ~cond); {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,304 INFO L290 TraceCheckUtils]: 118: Hoare triple {75595#(<= ~counter~0 6)} assume true; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,304 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 12:29:24,305 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 12:29:24,305 INFO L290 TraceCheckUtils]: 121: Hoare triple {75595#(<= ~counter~0 6)} ~cond := #in~cond; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,305 INFO L290 TraceCheckUtils]: 122: Hoare triple {75595#(<= ~counter~0 6)} assume !(0 == ~cond); {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,305 INFO L290 TraceCheckUtils]: 123: Hoare triple {75595#(<= ~counter~0 6)} assume true; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,306 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 12:29:24,306 INFO L290 TraceCheckUtils]: 125: Hoare triple {75595#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,306 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 12:29:24,307 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 12:29:24,307 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 12:29:24,307 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 12:29:24,307 INFO L290 TraceCheckUtils]: 130: Hoare triple {75276#false} ~cond := #in~cond; {75276#false} is VALID [2022-04-28 12:29:24,307 INFO L290 TraceCheckUtils]: 131: Hoare triple {75276#false} assume 0 == ~cond; {75276#false} is VALID [2022-04-28 12:29:24,307 INFO L290 TraceCheckUtils]: 132: Hoare triple {75276#false} assume !false; {75276#false} is VALID [2022-04-28 12:29:24,308 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 12:29:24,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:29:24,781 INFO L290 TraceCheckUtils]: 132: Hoare triple {75276#false} assume !false; {75276#false} is VALID [2022-04-28 12:29:24,782 INFO L290 TraceCheckUtils]: 131: Hoare triple {75276#false} assume 0 == ~cond; {75276#false} is VALID [2022-04-28 12:29:24,782 INFO L290 TraceCheckUtils]: 130: Hoare triple {75276#false} ~cond := #in~cond; {75276#false} is VALID [2022-04-28 12:29:24,782 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 12:29:24,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 12:29:24,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 12:29:24,783 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 12:29:24,783 INFO L290 TraceCheckUtils]: 125: Hoare triple {75700#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {75700#(< ~counter~0 10)} is VALID [2022-04-28 12:29:24,783 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {75275#true} {75700#(< ~counter~0 10)} #92#return; {75700#(< ~counter~0 10)} is VALID [2022-04-28 12:29:24,784 INFO L290 TraceCheckUtils]: 123: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,784 INFO L290 TraceCheckUtils]: 122: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,784 INFO L290 TraceCheckUtils]: 121: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,784 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 12:29:24,784 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {75275#true} {75700#(< ~counter~0 10)} #90#return; {75700#(< ~counter~0 10)} is VALID [2022-04-28 12:29:24,784 INFO L290 TraceCheckUtils]: 118: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,787 INFO L290 TraceCheckUtils]: 117: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,787 INFO L290 TraceCheckUtils]: 116: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,787 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 12:29:24,792 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {75275#true} {75700#(< ~counter~0 10)} #88#return; {75700#(< ~counter~0 10)} is VALID [2022-04-28 12:29:24,792 INFO L290 TraceCheckUtils]: 113: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,792 INFO L290 TraceCheckUtils]: 112: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,792 INFO L290 TraceCheckUtils]: 111: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,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 12:29:24,793 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {75275#true} {75700#(< ~counter~0 10)} #86#return; {75700#(< ~counter~0 10)} is VALID [2022-04-28 12:29:24,793 INFO L290 TraceCheckUtils]: 108: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,793 INFO L290 TraceCheckUtils]: 107: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,793 INFO L290 TraceCheckUtils]: 106: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,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 12:29:24,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 12:29:24,795 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 12:29:24,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 12:29:24,796 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {75275#true} {75773#(< ~counter~0 9)} #92#return; {75773#(< ~counter~0 9)} is VALID [2022-04-28 12:29:24,796 INFO L290 TraceCheckUtils]: 100: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,796 INFO L290 TraceCheckUtils]: 99: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,796 INFO L290 TraceCheckUtils]: 98: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,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 12:29:24,797 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {75275#true} {75773#(< ~counter~0 9)} #90#return; {75773#(< ~counter~0 9)} is VALID [2022-04-28 12:29:24,797 INFO L290 TraceCheckUtils]: 95: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,797 INFO L290 TraceCheckUtils]: 94: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,797 INFO L290 TraceCheckUtils]: 93: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,797 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 12:29:24,798 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {75275#true} {75773#(< ~counter~0 9)} #88#return; {75773#(< ~counter~0 9)} is VALID [2022-04-28 12:29:24,798 INFO L290 TraceCheckUtils]: 90: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,798 INFO L290 TraceCheckUtils]: 89: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,798 INFO L290 TraceCheckUtils]: 88: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,798 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 12:29:24,799 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {75275#true} {75773#(< ~counter~0 9)} #86#return; {75773#(< ~counter~0 9)} is VALID [2022-04-28 12:29:24,799 INFO L290 TraceCheckUtils]: 85: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,799 INFO L290 TraceCheckUtils]: 84: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,799 INFO L290 TraceCheckUtils]: 83: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,799 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 12:29:24,800 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 12:29:24,809 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 12:29:24,810 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 12:29:24,810 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 12:29:24,811 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 12:29:24,811 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 12:29:24,811 INFO L290 TraceCheckUtils]: 75: Hoare triple {75595#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,812 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {75275#true} {75595#(<= ~counter~0 6)} #92#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,812 INFO L290 TraceCheckUtils]: 73: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,812 INFO L290 TraceCheckUtils]: 72: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,812 INFO L290 TraceCheckUtils]: 71: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,812 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 12:29:24,813 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {75275#true} {75595#(<= ~counter~0 6)} #90#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,813 INFO L290 TraceCheckUtils]: 68: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,813 INFO L290 TraceCheckUtils]: 67: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,813 INFO L290 TraceCheckUtils]: 66: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,813 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 12:29:24,813 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {75275#true} {75595#(<= ~counter~0 6)} #88#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,813 INFO L290 TraceCheckUtils]: 63: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,813 INFO L290 TraceCheckUtils]: 62: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,813 INFO L290 TraceCheckUtils]: 61: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,813 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 12:29:24,814 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {75275#true} {75595#(<= ~counter~0 6)} #86#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:24,814 INFO L290 TraceCheckUtils]: 58: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,814 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 12:29:24,814 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 12:29:24,815 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 12:29:24,815 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 12:29:24,816 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {75275#true} {75525#(<= ~counter~0 5)} #92#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:24,816 INFO L290 TraceCheckUtils]: 50: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,816 INFO L290 TraceCheckUtils]: 49: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,816 INFO L290 TraceCheckUtils]: 48: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,816 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 12:29:24,817 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {75275#true} {75525#(<= ~counter~0 5)} #90#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:24,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,817 INFO L290 TraceCheckUtils]: 44: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,817 INFO L290 TraceCheckUtils]: 43: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,817 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 12:29:24,817 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {75275#true} {75525#(<= ~counter~0 5)} #88#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:24,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,818 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 12:29:24,818 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {75275#true} {75525#(<= ~counter~0 5)} #86#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:24,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,818 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 12:29:24,818 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 12:29:24,819 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 12:29:24,819 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 12:29:24,820 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 12:29:24,820 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 12:29:24,821 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {75275#true} {75442#(<= ~counter~0 3)} #84#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,821 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 12:29:24,821 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {75275#true} {75442#(<= ~counter~0 3)} #82#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,822 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 12:29:24,822 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 12:29:24,822 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {75275#true} {75442#(<= ~counter~0 3)} #80#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,822 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 12:29:24,823 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {75275#true} {75442#(<= ~counter~0 3)} #78#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-28 12:29:24,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-28 12:29:24,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-28 12:29:24,823 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 12:29:24,823 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 12:29:24,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {75442#(<= ~counter~0 3)} call #t~ret8 := main(); {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75442#(<= ~counter~0 3)} {75275#true} #98#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {75442#(<= ~counter~0 3)} assume true; {75442#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:24,824 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 12:29:24,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {75275#true} call ULTIMATE.init(); {75275#true} is VALID [2022-04-28 12:29:24,825 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 12:29:24,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:24,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553541896] [2022-04-28 12:29:24,825 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:24,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919783856] [2022-04-28 12:29:24,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919783856] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:29:24,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:29:24,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 12:29:24,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:24,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [243114535] [2022-04-28 12:29:24,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [243114535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:24,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:24,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 12:29:24,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930541476] [2022-04-28 12:29:24,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:24,826 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 12:29:24,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:24,826 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 12:29:24,911 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 12:29:24,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 12:29:24,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:24,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 12:29:24,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:29:24,912 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 12:29:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:26,720 INFO L93 Difference]: Finished difference Result 629 states and 787 transitions. [2022-04-28 12:29:26,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 12:29:26,720 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 12:29:26,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:26,720 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 12:29:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 150 transitions. [2022-04-28 12:29:26,721 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 12:29:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 150 transitions. [2022-04-28 12:29:26,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 150 transitions. [2022-04-28 12:29:26,861 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 12:29:26,888 INFO L225 Difference]: With dead ends: 629 [2022-04-28 12:29:26,888 INFO L226 Difference]: Without dead ends: 622 [2022-04-28 12:29:26,889 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 12:29:26,889 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:26,889 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.2s Time] [2022-04-28 12:29:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states.