/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 08:39:33,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 08:39:33,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 08:39:33,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 08:39:33,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 08:39:33,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 08:39:33,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 08:39:33,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 08:39:33,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 08:39:33,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 08:39:33,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 08:39:33,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 08:39:33,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 08:39:33,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 08:39:33,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 08:39:33,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 08:39:33,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 08:39:33,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 08:39:33,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 08:39:33,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 08:39:33,842 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 08:39:33,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 08:39:33,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 08:39:33,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 08:39:33,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 08:39:33,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 08:39:33,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 08:39:33,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 08:39:33,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 08:39:33,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 08:39:33,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 08:39:33,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 08:39:33,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 08:39:33,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 08:39:33,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 08:39:33,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 08:39:33,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 08:39:33,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 08:39:33,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 08:39:33,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 08:39:33,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 08:39:33,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 08:39:33,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 08:39:33,875 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 08:39:33,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 08:39:33,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 08:39:33,876 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 08:39:33,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 08:39:33,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 08:39:33,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 08:39:33,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 08:39:33,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 08:39:33,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 08:39:33,876 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 08:39:33,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 08:39:33,876 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 08:39:33,876 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 08:39:33,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 08:39:33,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 08:39:33,877 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 08:39:33,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 08:39:33,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:39:33,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 08:39:33,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 08:39:33,877 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 08:39:33,877 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 08:39:33,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 08:39:33,877 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 08:39:33,878 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-15 08:39:34,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 08:39:34,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 08:39:34,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 08:39:34,067 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 08:39:34,067 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 08:39:34,068 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-15 08:39:34,131 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f199c2ffe/2c5b07d9dbdc479a800c1dcfe1a98ca5/FLAGb0281da74 [2022-04-15 08:39:34,450 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 08:39:34,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound10.c [2022-04-15 08:39:34,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f199c2ffe/2c5b07d9dbdc479a800c1dcfe1a98ca5/FLAGb0281da74 [2022-04-15 08:39:34,898 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f199c2ffe/2c5b07d9dbdc479a800c1dcfe1a98ca5 [2022-04-15 08:39:34,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 08:39:34,901 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 08:39:34,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 08:39:34,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 08:39:34,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 08:39:34,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:39:34" (1/1) ... [2022-04-15 08:39:34,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374be873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:39:34, skipping insertion in model container [2022-04-15 08:39:34,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:39:34" (1/1) ... [2022-04-15 08:39:34,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 08:39:34,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 08:39:35,034 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-15 08:39:35,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:39:35,067 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 08:39:35,074 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-15 08:39:35,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:39:35,096 INFO L208 MainTranslator]: Completed translation [2022-04-15 08:39:35,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:39:35 WrapperNode [2022-04-15 08:39:35,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 08:39:35,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 08:39:35,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 08:39:35,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 08:39:35,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:39:35" (1/1) ... [2022-04-15 08:39:35,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:39:35" (1/1) ... [2022-04-15 08:39:35,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:39:35" (1/1) ... [2022-04-15 08:39:35,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:39:35" (1/1) ... [2022-04-15 08:39:35,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:39:35" (1/1) ... [2022-04-15 08:39:35,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:39:35" (1/1) ... [2022-04-15 08:39:35,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:39:35" (1/1) ... [2022-04-15 08:39:35,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 08:39:35,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 08:39:35,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 08:39:35,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 08:39:35,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:39:35" (1/1) ... [2022-04-15 08:39:35,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:39:35,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:39:35,180 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-15 08:39:35,206 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-15 08:39:35,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 08:39:35,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 08:39:35,214 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 08:39:35,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 08:39:35,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 08:39:35,215 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 08:39:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 08:39:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 08:39:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 08:39:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 08:39:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 08:39:35,216 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 08:39:35,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 08:39:35,216 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 08:39:35,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 08:39:35,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 08:39:35,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 08:39:35,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 08:39:35,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 08:39:35,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 08:39:35,287 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 08:39:35,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 08:39:35,463 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 08:39:35,469 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 08:39:35,470 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 08:39:35,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:39:35 BoogieIcfgContainer [2022-04-15 08:39:35,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 08:39:35,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 08:39:35,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 08:39:35,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 08:39:35,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 08:39:34" (1/3) ... [2022-04-15 08:39:35,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9635eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:39:35, skipping insertion in model container [2022-04-15 08:39:35,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:39:35" (2/3) ... [2022-04-15 08:39:35,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9635eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:39:35, skipping insertion in model container [2022-04-15 08:39:35,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:39:35" (3/3) ... [2022-04-15 08:39:35,478 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound10.c [2022-04-15 08:39:35,484 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 08:39:35,484 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 08:39:35,516 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 08:39:35,521 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 08:39:35,522 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 08:39:35,536 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-15 08:39:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 08:39:35,542 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:39:35,542 INFO L499 BasicCegarLoop]: 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-15 08:39:35,543 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:39:35,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:39:35,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 1 times [2022-04-15 08:39:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:39:35,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1744256055] [2022-04-15 08:39:35,560 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:39:35,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 2 times [2022-04-15 08:39:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:39:35,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359173483] [2022-04-15 08:39:35,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:39:35,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:39:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:39:35,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 08:39:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:39:35,701 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-15 08:39:35,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-15 08:39:35,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-15 08:39:35,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 08:39:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:39:35,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 08:39:35,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 08:39:35,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 08:39:35,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-15 08:39:35,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 08:39:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:39:35,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 08:39:35,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 08:39:35,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 08:39:35,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-15 08:39:35,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 08:39:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:39:35,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 08:39:35,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 08:39:35,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 08:39:35,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-15 08:39:35,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 08:39:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:39:35,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 08:39:35,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 08:39:35,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 08:39:35,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-15 08:39:35,747 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-15 08:39:35,747 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-15 08:39:35,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-15 08:39:35,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-15 08:39:35,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret8 := main(); {42#true} is VALID [2022-04-15 08:39:35,748 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-15 08:39:35,748 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-15 08:39:35,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 08:39:35,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 08:39:35,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 08:39:35,749 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-15 08:39:35,749 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-15 08:39:35,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 08:39:35,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 08:39:35,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 08:39:35,750 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-15 08:39:35,750 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-15 08:39:35,750 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-15 08:39:35,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 08:39:35,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 08:39:35,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 08:39:35,751 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-15 08:39:35,751 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-15 08:39:35,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 08:39:35,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 08:39:35,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 08:39:35,752 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-15 08:39:35,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-15 08:39:35,753 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-15 08:39:35,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-15 08:39:35,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-15 08:39:35,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-15 08:39:35,753 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-15 08:39:35,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:39:35,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359173483] [2022-04-15 08:39:35,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359173483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:39:35,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:39:35,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:39:35,757 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:39:35,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1744256055] [2022-04-15 08:39:35,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1744256055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:39:35,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:39:35,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:39:35,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782643665] [2022-04-15 08:39:35,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:39:35,761 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-15 08:39:35,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:39:35,765 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-15 08:39:35,815 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-15 08:39:35,816 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 08:39:35,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:39:35,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 08:39:35,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:39:35,831 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-15 08:39:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:35,997 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-04-15 08:39:35,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 08:39:35,998 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-15 08:39:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:39:35,999 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-15 08:39:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-15 08:39:36,015 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-15 08:39:36,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-15 08:39:36,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-04-15 08:39:36,142 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-15 08:39:36,151 INFO L225 Difference]: With dead ends: 72 [2022-04-15 08:39:36,152 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 08:39:36,154 INFO L912 BasicCegarLoop]: 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-15 08:39:36,159 INFO L913 BasicCegarLoop]: 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-15 08:39:36,160 INFO L914 BasicCegarLoop]: 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-15 08:39:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 08:39:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 08:39:36,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:39:36,189 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-15 08:39:36,191 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-15 08:39:36,191 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-15 08:39:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:36,197 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-15 08:39:36,197 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-15 08:39:36,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:39:36,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:39:36,199 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-15 08:39: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-15 08:39:36,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:36,207 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-15 08:39:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-15 08:39:36,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:39:36,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:39:36,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:39:36,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:39:36,209 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-15 08:39:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-15 08:39:36,213 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-15 08:39:36,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:39:36,214 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-15 08:39:36,214 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (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-15 08:39:36,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-15 08:39:36,252 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-15 08:39:36,253 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-15 08:39:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 08:39:36,255 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:39:36,256 INFO L499 BasicCegarLoop]: 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-15 08:39:36,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 08:39:36,256 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:39:36,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:39:36,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 1 times [2022-04-15 08:39:36,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:39:36,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2072921925] [2022-04-15 08:39:36,259 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:39:36,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 2 times [2022-04-15 08:39:36,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:39:36,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526472591] [2022-04-15 08:39:36,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:39:36,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:39:36,281 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:39:36,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [852074848] [2022-04-15 08:39:36,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:39:36,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:39:36,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:39:36,283 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-15 08:39:36,284 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-15 08:39:36,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:39:36,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:39:36,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 08:39:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:39:36,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:39:36,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-15 08:39:36,600 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-15 08:39:36,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {356#(<= ~counter~0 0)} {348#true} #98#return; {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {356#(<= ~counter~0 0)} call #t~ret8 := main(); {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,603 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-15 08:39:36,604 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-15 08:39:36,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,606 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #78#return; {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,606 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-15 08:39:36,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,608 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #80#return; {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,608 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-15 08:39:36,609 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-15 08:39:36,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,610 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #82#return; {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,611 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-15 08:39:36,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,612 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #84#return; {356#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:36,613 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-15 08:39:36,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {349#false} is VALID [2022-04-15 08:39:36,614 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-15 08:39:36,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {349#false} ~cond := #in~cond; {349#false} is VALID [2022-04-15 08:39:36,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {349#false} assume 0 == ~cond; {349#false} is VALID [2022-04-15 08:39:36,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-15 08:39:36,616 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-15 08:39:36,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:39:36,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:39:36,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526472591] [2022-04-15 08:39:36,616 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:39:36,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852074848] [2022-04-15 08:39:36,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852074848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:39:36,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:39:36,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:39:36,618 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:39:36,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2072921925] [2022-04-15 08:39:36,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2072921925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:39:36,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:39:36,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:39:36,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633339526] [2022-04-15 08:39:36,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:39:36,620 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-15 08:39:36,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:39:36,621 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-15 08:39:36,638 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-15 08:39:36,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 08:39:36,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:39:36,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 08:39:36,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 08:39:36,647 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-15 08:39:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:36,745 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-15 08:39:36,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 08:39:36,745 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-15 08:39:36,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:39:36,746 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-15 08:39:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-15 08:39:36,750 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-15 08:39:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-15 08:39:36,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-15 08:39:36,796 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-15 08:39:36,798 INFO L225 Difference]: With dead ends: 44 [2022-04-15 08:39:36,798 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 08:39:36,799 INFO L912 BasicCegarLoop]: 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-15 08:39:36,800 INFO L913 BasicCegarLoop]: 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-15 08:39:36,803 INFO L914 BasicCegarLoop]: 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-15 08:39:36,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 08:39:36,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 08:39:36,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:39:36,819 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-15 08:39:36,820 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-15 08:39:36,821 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-15 08:39:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:36,827 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-15 08:39:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-15 08:39:36,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:39:36,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:39:36,834 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-15 08:39:36,834 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-15 08:39:36,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:36,837 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-15 08:39:36,837 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-15 08:39:36,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:39:36,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:39:36,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:39:36,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:39:36,839 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-15 08:39:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-15 08:39:36,840 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-15 08:39:36,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:39:36,841 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-15 08:39:36,841 INFO L479 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-15 08:39:36,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 47 transitions. [2022-04-15 08:39:36,876 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-15 08:39:36,876 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-15 08:39:36,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 08:39:36,877 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:39:36,877 INFO L499 BasicCegarLoop]: 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-15 08:39:36,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 08:39:37,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:39:37,092 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:39:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:39:37,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 1 times [2022-04-15 08:39:37,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:39:37,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1932658020] [2022-04-15 08:39:37,093 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:39:37,093 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 2 times [2022-04-15 08:39:37,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:39:37,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136084995] [2022-04-15 08:39:37,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:39:37,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:39:37,110 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:39:37,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [71340266] [2022-04-15 08:39:37,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:39:37,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:39:37,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:39:37,113 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-15 08:39:37,114 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-15 08:39:37,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:39:37,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:39:37,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:39:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:39:37,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:39:37,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-15 08:39:37,295 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-15 08:39:37,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 08:39:37,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #98#return; {682#true} is VALID [2022-04-15 08:39:37,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret8 := main(); {682#true} is VALID [2022-04-15 08:39:37,296 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-15 08:39:37,296 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-15 08:39:37,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 08:39:37,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 08:39:37,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 08:39:37,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {682#true} {682#true} #78#return; {682#true} is VALID [2022-04-15 08:39:37,297 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-15 08:39:37,297 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-15 08:39:37,297 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-15 08:39:37,298 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-15 08:39:37,298 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-15 08:39:37,300 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-15 08:39:37,300 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-15 08:39:37,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 08:39:37,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 08:39:37,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 08:39:37,301 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #82#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 08:39:37,301 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-15 08:39:37,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 08:39:37,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 08:39:37,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 08:39:37,302 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #84#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 08:39:37,303 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-15 08:39:37,303 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-15 08:39:37,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {738#(<= 1 main_~b~0)} assume !(0 != ~b~0); {683#false} is VALID [2022-04-15 08:39:37,304 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-15 08:39:37,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-15 08:39:37,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-15 08:39:37,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-15 08:39:37,307 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-15 08:39:37,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:39:37,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-15 08:39:37,507 INFO L290 TraceCheckUtils]: 32: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-15 08:39:37,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-15 08:39:37,507 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-15 08:39:37,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {738#(<= 1 main_~b~0)} assume !(0 != ~b~0); {683#false} is VALID [2022-04-15 08:39:37,525 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-15 08:39:37,525 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-15 08:39:37,526 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #84#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 08:39:37,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 08:39:37,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 08:39:37,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 08:39:37,526 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-15 08:39:37,527 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #82#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 08:39:37,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 08:39:37,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 08:39:37,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 08:39:37,529 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-15 08:39:37,530 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-15 08:39:37,531 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-15 08:39:37,531 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-15 08:39:37,531 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-15 08:39:37,532 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-15 08:39:37,532 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-15 08:39:37,532 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {682#true} {682#true} #78#return; {682#true} is VALID [2022-04-15 08:39:37,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 08:39:37,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 08:39:37,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 08:39:37,532 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-15 08:39:37,532 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-15 08:39:37,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret8 := main(); {682#true} is VALID [2022-04-15 08:39:37,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #98#return; {682#true} is VALID [2022-04-15 08:39:37,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 08:39:37,533 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-15 08:39:37,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-15 08:39:37,533 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-15 08:39:37,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:39:37,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136084995] [2022-04-15 08:39:37,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:39:37,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71340266] [2022-04-15 08:39:37,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71340266] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:39:37,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:39:37,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-15 08:39:37,534 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:39:37,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1932658020] [2022-04-15 08:39:37,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1932658020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:39:37,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:39:37,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:39:37,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403094236] [2022-04-15 08:39:37,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:39:37,535 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-15 08:39:37,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:39:37,535 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-15 08:39:37,550 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-15 08:39:37,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:39:37,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:39:37,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:39:37,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 08:39:37,551 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-15 08:39:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:37,827 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-15 08:39:37,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:39:37,827 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-15 08:39:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:39:37,828 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-15 08:39:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-15 08:39:37,829 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-15 08:39:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-15 08:39:37,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-15 08:39:37,905 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-15 08:39:37,910 INFO L225 Difference]: With dead ends: 53 [2022-04-15 08:39:37,910 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 08:39:37,911 INFO L912 BasicCegarLoop]: 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-15 08:39:37,916 INFO L913 BasicCegarLoop]: 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-15 08:39:37,917 INFO L914 BasicCegarLoop]: 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-15 08:39:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 08:39:37,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-15 08:39:37,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:39:37,948 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-15 08:39:37,950 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-15 08:39:37,950 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-15 08:39:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:37,954 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-15 08:39:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-15 08:39:37,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:39:37,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:39:37,955 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-15 08:39:37,955 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-15 08:39:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:37,960 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-15 08:39:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-15 08:39:37,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:39:37,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:39:37,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:39:37,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:39:37,961 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-15 08:39:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-15 08:39:37,962 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-15 08:39:37,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:39:37,964 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-15 08:39:37,964 INFO L479 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-15 08:39:37,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 48 transitions. [2022-04-15 08:39:38,004 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-15 08:39:38,005 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-15 08:39:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 08:39:38,006 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:39:38,007 INFO L499 BasicCegarLoop]: 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-15 08:39:38,025 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-15 08:39:38,224 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 08:39:38,225 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:39:38,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:39:38,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 1 times [2022-04-15 08:39:38,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:39:38,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [442103643] [2022-04-15 08:39:38,226 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:39:38,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 2 times [2022-04-15 08:39:38,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:39:38,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542110428] [2022-04-15 08:39:38,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:39:38,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:39:38,242 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:39:38,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016579176] [2022-04-15 08:39:38,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:39:38,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:39:38,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:39:38,243 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-15 08:39:38,244 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-15 08:39:38,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:39:38,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:39:38,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 08:39:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:39:38,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:39:38,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {1166#true} call ULTIMATE.init(); {1166#true} is VALID [2022-04-15 08:39:38,392 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-15 08:39:38,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-15 08:39:38,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1166#true} {1166#true} #98#return; {1166#true} is VALID [2022-04-15 08:39:38,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {1166#true} call #t~ret8 := main(); {1166#true} is VALID [2022-04-15 08:39:38,393 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-15 08:39:38,393 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-15 08:39:38,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-15 08:39:38,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-15 08:39:38,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-15 08:39:38,393 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1166#true} {1166#true} #78#return; {1166#true} is VALID [2022-04-15 08:39:38,393 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-15 08:39:38,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-15 08:39:38,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-15 08:39:38,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-15 08:39:38,394 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1166#true} {1166#true} #80#return; {1166#true} is VALID [2022-04-15 08:39:38,394 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-15 08:39:38,394 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-15 08:39:38,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-15 08:39:38,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-15 08:39:38,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-15 08:39:38,394 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1166#true} {1166#true} #82#return; {1166#true} is VALID [2022-04-15 08:39:38,395 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-15 08:39:38,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-15 08:39:38,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-15 08:39:38,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-15 08:39:38,395 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1166#true} {1166#true} #84#return; {1166#true} is VALID [2022-04-15 08:39:38,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {1166#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1166#true} is VALID [2022-04-15 08:39:38,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {1166#true} assume !!(#t~post6 < 10);havoc #t~post6; {1166#true} is VALID [2022-04-15 08:39:38,396 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-15 08:39:38,396 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-15 08:39:38,397 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-15 08:39:38,397 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-15 08:39:38,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1272#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:39:38,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {1272#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1167#false} is VALID [2022-04-15 08:39:38,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {1167#false} assume !false; {1167#false} is VALID [2022-04-15 08:39:38,401 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-15 08:39:38,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:39:38,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:39:38,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542110428] [2022-04-15 08:39:38,402 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:39:38,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016579176] [2022-04-15 08:39:38,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016579176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:39:38,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:39:38,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:39:38,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:39:38,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [442103643] [2022-04-15 08:39:38,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [442103643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:39:38,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:39:38,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:39:38,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197632065] [2022-04-15 08:39:38,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:39:38,403 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-15 08:39:38,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:39:38,404 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-15 08:39:38,418 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-15 08:39:38,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:39:38,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:39:38,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:39:38,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:39:38,419 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-15 08:39:38,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:38,595 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-15 08:39:38,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:39:38,595 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-15 08:39:38,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:39:38,596 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-15 08:39:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 08:39:38,598 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-15 08:39:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 08:39:38,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-15 08:39:38,650 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-15 08:39:38,653 INFO L225 Difference]: With dead ends: 51 [2022-04-15 08:39:38,653 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 08:39:38,653 INFO L912 BasicCegarLoop]: 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-15 08:39:38,654 INFO L913 BasicCegarLoop]: 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-15 08:39:38,655 INFO L914 BasicCegarLoop]: 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-15 08:39:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 08:39:38,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2022-04-15 08:39:38,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:39:38,690 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-15 08:39:38,691 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-15 08:39:38,691 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-15 08:39:38,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:38,694 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-15 08:39:38,694 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-15 08:39:38,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:39:38,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:39:38,695 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-15 08:39:38,696 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-15 08:39:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:38,698 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-15 08:39:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-15 08:39:38,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:39:38,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:39:38,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:39:38,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:39:38,699 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-15 08:39:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-04-15 08:39:38,701 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 36 [2022-04-15 08:39:38,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:39:38,701 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-04-15 08:39:38,701 INFO L479 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-15 08:39:38,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 56 transitions. [2022-04-15 08:39:38,750 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-15 08:39:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-04-15 08:39:38,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 08:39:38,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:39:38,751 INFO L499 BasicCegarLoop]: 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-15 08:39:38,774 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-15 08:39:38,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:39:38,962 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:39:38,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:39:38,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 1 times [2022-04-15 08:39:38,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:39:38,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [742157584] [2022-04-15 08:39:38,963 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:39:38,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 2 times [2022-04-15 08:39:38,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:39:38,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802774867] [2022-04-15 08:39:38,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:39:38,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:39:38,975 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:39:38,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281096581] [2022-04-15 08:39:38,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:39:38,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:39:38,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:39:38,981 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-15 08:39:38,981 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-15 08:39:39,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:39:39,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:39:39,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:39:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:39:39,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:39:39,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {1568#true} call ULTIMATE.init(); {1568#true} is VALID [2022-04-15 08:39:39,224 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-15 08:39:39,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#(<= ~counter~0 0)} {1568#true} #98#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#(<= ~counter~0 0)} call #t~ret8 := main(); {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,226 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-15 08:39:39,226 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-15 08:39:39,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,231 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #78#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,232 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-15 08:39:39,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,233 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #80#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,233 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-15 08:39:39,234 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-15 08:39:39,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,235 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #82#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,235 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-15 08:39:39,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,237 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #84#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-15 08:39:39,237 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-15 08:39:39,237 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-15 08:39:39,238 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-15 08:39:39,238 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-15 08:39:39,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {1665#(<= |main_#t~post7| 1)} assume !(#t~post7 < 10);havoc #t~post7; {1569#false} is VALID [2022-04-15 08:39:39,239 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-15 08:39:39,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {1569#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1569#false} is VALID [2022-04-15 08:39:39,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {1569#false} assume !(#t~post6 < 10);havoc #t~post6; {1569#false} is VALID [2022-04-15 08:39:39,239 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-15 08:39:39,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {1569#false} ~cond := #in~cond; {1569#false} is VALID [2022-04-15 08:39:39,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {1569#false} assume 0 == ~cond; {1569#false} is VALID [2022-04-15 08:39:39,239 INFO L290 TraceCheckUtils]: 38: Hoare triple {1569#false} assume !false; {1569#false} is VALID [2022-04-15 08:39:39,239 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-15 08:39:39,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:39:39,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:39:39,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802774867] [2022-04-15 08:39:39,241 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:39:39,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281096581] [2022-04-15 08:39:39,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281096581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:39:39,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:39:39,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:39:39,242 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:39:39,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [742157584] [2022-04-15 08:39:39,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [742157584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:39:39,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:39:39,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:39:39,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151473703] [2022-04-15 08:39:39,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:39:39,243 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-15 08:39:39,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:39:39,243 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-15 08:39:39,262 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-15 08:39:39,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:39:39,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:39:39,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:39:39,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:39:39,263 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-15 08:39:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:39,400 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-15 08:39:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:39:39,400 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-15 08:39:39,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:39:39,400 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-15 08:39:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-15 08:39:39,402 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-15 08:39:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-15 08:39:39,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-15 08:39:39,453 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-15 08:39:39,455 INFO L225 Difference]: With dead ends: 72 [2022-04-15 08:39:39,455 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 08:39:39,455 INFO L912 BasicCegarLoop]: 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-15 08:39:39,456 INFO L913 BasicCegarLoop]: 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-15 08:39:39,456 INFO L914 BasicCegarLoop]: 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-15 08:39:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 08:39:39,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-15 08:39:39,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:39:39,497 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-15 08:39:39,497 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-15 08:39:39,497 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-15 08:39:39,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:39,499 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-15 08:39:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-15 08:39:39,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:39:39,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:39:39,499 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-15 08:39:39,499 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-15 08:39:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:39,501 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-15 08:39:39,501 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-15 08:39:39,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:39:39,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:39:39,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:39:39,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:39:39,502 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-15 08:39:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-04-15 08:39:39,503 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 39 [2022-04-15 08:39:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:39:39,504 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-04-15 08:39:39,504 INFO L479 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-15 08:39:39,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 58 transitions. [2022-04-15 08:39:39,551 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-15 08:39:39,552 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-15 08:39:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 08:39:39,552 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:39:39,552 INFO L499 BasicCegarLoop]: 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-15 08:39:39,568 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-15 08:39:39,758 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:39:39,758 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:39:39,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:39:39,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 1 times [2022-04-15 08:39:39,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:39:39,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [900571101] [2022-04-15 08:39:39,759 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:39:39,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 2 times [2022-04-15 08:39:39,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:39:39,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133254503] [2022-04-15 08:39:39,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:39:39,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:39:39,801 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:39:39,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50529032] [2022-04-15 08:39:39,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:39:39,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:39:39,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:39:39,803 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-15 08:39:39,804 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-15 08:39:39,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:39:39,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:39:39,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 08:39:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:39:39,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:39:40,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2022-04-15 08:39:40,063 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-15 08:39:40,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 08:39:40,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #98#return; {2017#true} is VALID [2022-04-15 08:39:40,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret8 := main(); {2017#true} is VALID [2022-04-15 08:39:40,064 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-15 08:39:40,064 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-15 08:39:40,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 08:39:40,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 08:39:40,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 08:39:40,064 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2017#true} {2017#true} #78#return; {2017#true} is VALID [2022-04-15 08:39:40,064 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-15 08:39:40,065 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-15 08:39:40,065 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-15 08:39:40,065 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-15 08:39:40,066 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-15 08:39:40,066 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-15 08:39:40,066 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-15 08:39:40,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 08:39:40,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 08:39:40,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 08:39:40,068 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-15 08:39:40,068 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-15 08:39:40,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 08:39:40,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 08:39:40,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 08:39:40,069 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-15 08:39:40,070 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-15 08:39:40,072 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-15 08:39:40,073 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-15 08:39:40,073 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-15 08:39:40,073 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-15 08:39:40,073 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-15 08:39:40,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 08:39:40,074 INFO L290 TraceCheckUtils]: 34: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 08:39:40,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 08:39:40,074 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-15 08:39:40,075 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-15 08:39:40,075 INFO L290 TraceCheckUtils]: 38: Hoare triple {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:39:40,075 INFO L290 TraceCheckUtils]: 39: Hoare triple {2141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2018#false} is VALID [2022-04-15 08:39:40,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2022-04-15 08:39:40,076 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-15 08:39:40,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:39:40,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2022-04-15 08:39:40,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {2141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2018#false} is VALID [2022-04-15 08:39:40,249 INFO L290 TraceCheckUtils]: 38: Hoare triple {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:39:40,250 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-15 08:39:40,250 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-15 08:39:40,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 08:39:40,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 08:39:40,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 08:39:40,251 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-15 08:39:40,251 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-15 08:39:40,252 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-15 08:39:40,252 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-15 08:39:40,252 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-15 08:39:40,253 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-15 08:39:40,253 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-15 08:39:40,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 08:39:40,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 08:39:40,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 08:39:40,253 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-15 08:39:40,254 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-15 08:39:40,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 08:39:40,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 08:39:40,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 08:39:40,254 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-15 08:39:40,255 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-15 08:39:40,255 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2017#true} {2017#true} #80#return; {2017#true} is VALID [2022-04-15 08:39:40,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 08:39:40,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 08:39:40,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 08:39:40,255 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-15 08:39:40,255 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2017#true} {2017#true} #78#return; {2017#true} is VALID [2022-04-15 08:39:40,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 08:39:40,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-15 08:39:40,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-15 08:39:40,256 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-15 08:39:40,256 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-15 08:39:40,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret8 := main(); {2017#true} is VALID [2022-04-15 08:39:40,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #98#return; {2017#true} is VALID [2022-04-15 08:39:40,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-15 08:39:40,256 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-15 08:39:40,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2022-04-15 08:39:40,256 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-15 08:39:40,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:39:40,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133254503] [2022-04-15 08:39:40,257 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:39:40,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50529032] [2022-04-15 08:39:40,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50529032] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 08:39:40,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 08:39:40,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-15 08:39:40,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:39:40,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [900571101] [2022-04-15 08:39:40,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [900571101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:39:40,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:39:40,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:39:40,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857525034] [2022-04-15 08:39:40,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:39:40,258 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-15 08:39:40,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:39:40,258 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-15 08:39:40,278 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-15 08:39:40,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:39:40,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:39:40,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:39:40,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 08:39:40,279 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-15 08:39:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:40,473 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2022-04-15 08:39:40,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:39:40,473 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-15 08:39:40,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:39:40,473 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-15 08:39:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 08:39:40,474 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-15 08:39:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 08:39:40,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 08:39:40,523 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-15 08:39:40,524 INFO L225 Difference]: With dead ends: 61 [2022-04-15 08:39:40,524 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 08:39:40,525 INFO L912 BasicCegarLoop]: 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-15 08:39:40,525 INFO L913 BasicCegarLoop]: 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-15 08:39:40,525 INFO L914 BasicCegarLoop]: 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-15 08:39:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 08:39:40,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-15 08:39:40,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:39:40,573 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-15 08:39:40,573 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-15 08:39:40,574 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-15 08:39:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:40,575 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-15 08:39:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-15 08:39:40,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:39:40,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:39:40,576 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-15 08:39:40,576 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-15 08:39:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:40,578 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-15 08:39:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-15 08:39:40,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:39:40,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:39:40,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:39:40,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:39:40,579 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-15 08:39:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-04-15 08:39:40,581 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 41 [2022-04-15 08:39:40,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:39:40,581 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-04-15 08:39:40,581 INFO L479 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-15 08:39:40,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 76 transitions. [2022-04-15 08:39:40,653 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-15 08:39:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-15 08:39:40,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 08:39:40,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:39:40,654 INFO L499 BasicCegarLoop]: 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-15 08:39:40,670 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-15 08:39:40,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:39:40,860 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:39:40,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:39:40,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 1 times [2022-04-15 08:39:40,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:39:40,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1157524561] [2022-04-15 08:39:40,860 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:39:40,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 2 times [2022-04-15 08:39:40,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:39:40,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108819102] [2022-04-15 08:39:40,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:39:40,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:39:40,870 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:39:40,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1931772827] [2022-04-15 08:39:40,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:39:40,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:39:40,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:39:40,871 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-15 08:39:40,872 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-15 08:39:40,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:39:40,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:39:40,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 08:39:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:39:40,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:39:41,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {2629#true} call ULTIMATE.init(); {2629#true} is VALID [2022-04-15 08:39:41,174 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-15 08:39:41,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 08:39:41,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #98#return; {2629#true} is VALID [2022-04-15 08:39:41,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {2629#true} call #t~ret8 := main(); {2629#true} is VALID [2022-04-15 08:39:41,174 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-15 08:39:41,185 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-15 08:39:41,186 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-15 08:39:41,186 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-15 08:39:41,187 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-15 08:39:41,187 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-15 08:39:41,187 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-15 08:39:41,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 08:39:41,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 08:39:41,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 08:39:41,188 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2629#true} {2666#(<= 1 main_~x~0)} #80#return; {2666#(<= 1 main_~x~0)} is VALID [2022-04-15 08:39:41,188 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-15 08:39:41,189 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-15 08:39:41,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 08:39:41,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 08:39:41,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 08:39:41,191 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-15 08:39:41,191 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-15 08:39:41,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 08:39:41,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 08:39:41,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 08:39:41,192 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-15 08:39:41,192 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-15 08:39:41,193 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-15 08:39:41,193 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-15 08:39:41,193 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-15 08:39:41,194 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-15 08:39:41,194 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-15 08:39:41,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 08:39:41,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 08:39:41,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 08:39:41,195 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-15 08:39:41,195 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-15 08:39:41,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 08:39:41,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 08:39:41,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 08:39:41,195 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-15 08:39:41,196 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-15 08:39:41,196 INFO L290 TraceCheckUtils]: 43: Hoare triple {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2768#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:39:41,197 INFO L290 TraceCheckUtils]: 44: Hoare triple {2768#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2630#false} is VALID [2022-04-15 08:39:41,197 INFO L290 TraceCheckUtils]: 45: Hoare triple {2630#false} assume !false; {2630#false} is VALID [2022-04-15 08:39:41,197 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-15 08:39:41,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:39:41,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {2630#false} assume !false; {2630#false} is VALID [2022-04-15 08:39:41,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {2768#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2630#false} is VALID [2022-04-15 08:39:41,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2768#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:39:41,371 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-15 08:39:41,372 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-15 08:39:41,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 08:39:41,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 08:39:41,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 08:39:41,372 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-15 08:39:41,373 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-15 08:39:41,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 08:39:41,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 08:39:41,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 08:39:41,373 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-15 08:39:41,374 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-15 08:39:41,374 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-15 08:39:41,375 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-15 08:39:41,375 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-15 08:39:41,375 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-15 08:39:41,377 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-15 08:39:41,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 08:39:41,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 08:39:41,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 08:39:41,384 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-15 08:39:41,384 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-15 08:39:41,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 08:39:41,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 08:39:41,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 08:39:41,395 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-15 08:39:41,396 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-15 08:39:41,396 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2629#true} {2629#true} #80#return; {2629#true} is VALID [2022-04-15 08:39:41,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 08:39:41,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 08:39:41,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 08:39:41,396 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-15 08:39:41,397 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2629#true} {2629#true} #78#return; {2629#true} is VALID [2022-04-15 08:39:41,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 08:39:41,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-15 08:39:41,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-15 08:39:41,397 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-15 08:39:41,397 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-15 08:39:41,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {2629#true} call #t~ret8 := main(); {2629#true} is VALID [2022-04-15 08:39:41,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #98#return; {2629#true} is VALID [2022-04-15 08:39:41,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-15 08:39:41,397 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-15 08:39:41,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {2629#true} call ULTIMATE.init(); {2629#true} is VALID [2022-04-15 08:39:41,397 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-15 08:39:41,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:39:41,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108819102] [2022-04-15 08:39:41,398 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:39:41,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931772827] [2022-04-15 08:39:41,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931772827] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 08:39:41,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 08:39:41,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-15 08:39:41,398 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:39:41,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1157524561] [2022-04-15 08:39:41,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1157524561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:39:41,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:39:41,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:39:41,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966221047] [2022-04-15 08:39:41,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:39:41,399 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-15 08:39:41,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:39:41,399 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-15 08:39:41,420 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-15 08:39:41,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:39:41,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:39:41,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:39:41,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 08:39:41,420 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-15 08:39:41,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:41,637 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2022-04-15 08:39:41,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:39:41,637 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-15 08:39:41,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:39:41,638 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-15 08:39:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 08:39:41,640 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-15 08:39:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 08:39:41,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 08:39:41,688 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-15 08:39:41,689 INFO L225 Difference]: With dead ends: 65 [2022-04-15 08:39:41,689 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 08:39:41,690 INFO L912 BasicCegarLoop]: 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-15 08:39:41,690 INFO L913 BasicCegarLoop]: 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-15 08:39:41,690 INFO L914 BasicCegarLoop]: 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-15 08:39:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 08:39:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-15 08:39:41,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:39:41,739 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-15 08:39:41,739 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-15 08:39:41,739 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-15 08:39:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:41,741 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-15 08:39:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-15 08:39:41,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:39:41,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:39:41,742 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-15 08:39:41,742 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-15 08:39:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:39:41,743 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-15 08:39:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-15 08:39:41,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:39:41,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:39:41,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:39:41,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:39:41,744 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-15 08:39:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-04-15 08:39:41,746 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 46 [2022-04-15 08:39:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:39:41,746 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-04-15 08:39:41,746 INFO L479 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-15 08:39:41,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 79 transitions. [2022-04-15 08:39:41,812 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-15 08:39:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-04-15 08:39:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 08:39:41,812 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:39:41,812 INFO L499 BasicCegarLoop]: 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-15 08:39:41,829 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-15 08:39:42,013 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:39:42,013 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:39:42,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:39:42,014 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 1 times [2022-04-15 08:39:42,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:39:42,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1917922108] [2022-04-15 08:39:42,014 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:39:42,014 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 2 times [2022-04-15 08:39:42,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:39:42,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513363960] [2022-04-15 08:39:42,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:39:42,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:39:42,026 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:39:42,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [270909701] [2022-04-15 08:39:42,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:39:42,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:39:42,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:39:42,041 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-15 08:39:42,041 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-15 08:39:42,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:39:42,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:39:42,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 08:39:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:39:42,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:39:42,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {3295#true} call ULTIMATE.init(); {3295#true} is VALID [2022-04-15 08:39:42,337 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-15 08:39:42,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-15 08:39:42,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3295#true} {3295#true} #98#return; {3295#true} is VALID [2022-04-15 08:39:42,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {3295#true} call #t~ret8 := main(); {3295#true} is VALID [2022-04-15 08:39:42,337 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-15 08:39:42,337 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-15 08:39:42,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-15 08:39:42,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-15 08:39:42,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-15 08:39:42,337 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3295#true} {3295#true} #78#return; {3295#true} is VALID [2022-04-15 08:39:42,338 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-15 08:39:42,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-15 08:39:42,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-15 08:39:42,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-15 08:39:42,338 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3295#true} {3295#true} #80#return; {3295#true} is VALID [2022-04-15 08:39:42,338 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-15 08:39:42,338 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-15 08:39:42,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-15 08:39:42,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-15 08:39:42,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-15 08:39:42,339 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-15 08:39:42,339 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-15 08:39:42,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-15 08:39:42,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-15 08:39:42,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-15 08:39:42,340 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-15 08:39:42,340 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-15 08:39:42,341 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-15 08:39:42,341 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-15 08:39:42,341 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-15 08:39:42,342 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-15 08:39:42,342 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-15 08:39:42,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-15 08:39:42,342 INFO L290 TraceCheckUtils]: 34: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-15 08:39:42,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-15 08:39:42,344 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-15 08:39:42,344 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-15 08:39:42,344 INFO L290 TraceCheckUtils]: 38: Hoare triple {3295#true} ~cond := #in~cond; {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:39:42,345 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-15 08:39:42,345 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-15 08:39:42,346 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-15 08:39:42,346 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-15 08:39:42,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {3295#true} ~cond := #in~cond; {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:39:42,346 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-15 08:39:42,347 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-15 08:39:42,347 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-15 08:39:42,348 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-15 08:39:42,348 INFO L290 TraceCheckUtils]: 48: Hoare triple {3444#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3448#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:39:42,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {3448#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3296#false} is VALID [2022-04-15 08:39:42,349 INFO L290 TraceCheckUtils]: 50: Hoare triple {3296#false} assume !false; {3296#false} is VALID [2022-04-15 08:39:42,349 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-15 08:39:42,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:40:41,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:40:41,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513363960] [2022-04-15 08:40:41,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:40:41,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270909701] [2022-04-15 08:40:41,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270909701] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 08:40:41,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 08:40:41,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-15 08:40:41,818 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:40:41,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1917922108] [2022-04-15 08:40:41,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1917922108] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:40:41,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:40:41,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 08:40:41,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323363114] [2022-04-15 08:40:41,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:40:41,819 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-15 08:40:41,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:40:41,819 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-15 08:40:41,856 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-15 08:40:41,856 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 08:40:41,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:40:41,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 08:40:41,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 08:40:41,857 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-15 08:40:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:40:42,252 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-04-15 08:40:42,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 08:40:42,252 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-15 08:40:42,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:40:42,253 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-15 08:40:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-15 08:40:42,254 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-15 08:40:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-15 08:40:42,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-15 08:40:42,318 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-15 08:40:42,319 INFO L225 Difference]: With dead ends: 69 [2022-04-15 08:40:42,319 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 08:40:42,320 INFO L912 BasicCegarLoop]: 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-15 08:40:42,320 INFO L913 BasicCegarLoop]: 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-15 08:40:42,320 INFO L914 BasicCegarLoop]: 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-15 08:40:42,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 08:40:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-15 08:40:42,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:40:42,368 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-15 08:40:42,368 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-15 08:40:42,368 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-15 08:40:42,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:40:42,370 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-15 08:40:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-04-15 08:40:42,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:40:42,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:40:42,370 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-15 08:40:42,371 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-15 08:40:42,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:40:42,372 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-15 08:40:42,372 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-04-15 08:40:42,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:40:42,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:40:42,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:40:42,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:40:42,373 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-15 08:40:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2022-04-15 08:40:42,377 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 51 [2022-04-15 08:40:42,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:40:42,377 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2022-04-15 08:40:42,377 INFO L479 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-15 08:40:42,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 82 transitions. [2022-04-15 08:40:42,455 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-15 08:40:42,455 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2022-04-15 08:40:42,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 08:40:42,456 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:40:42,456 INFO L499 BasicCegarLoop]: 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-15 08:40:42,472 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-15 08:40:42,656 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:40:42,657 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:40:42,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:40:42,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2044027516, now seen corresponding path program 1 times [2022-04-15 08:40:42,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:40:42,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1129638777] [2022-04-15 08:40:42,657 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:40:42,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2044027516, now seen corresponding path program 2 times [2022-04-15 08:40:42,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:40:42,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155934933] [2022-04-15 08:40:42,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:40:42,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:40:42,672 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:40:42,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621974376] [2022-04-15 08:40:42,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:40:42,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:40:42,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:40:42,673 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-15 08:40:42,673 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-15 08:40:42,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:40:42,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:40:42,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 08:40:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:40:42,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:40:42,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {3879#true} call ULTIMATE.init(); {3879#true} is VALID [2022-04-15 08:40:42,899 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-15 08:40:42,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:40:42,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3879#true} {3879#true} #98#return; {3879#true} is VALID [2022-04-15 08:40:42,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {3879#true} call #t~ret8 := main(); {3879#true} is VALID [2022-04-15 08:40:42,899 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-15 08:40:42,899 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-15 08:40:42,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 08:40:42,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 08:40:42,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:40:42,900 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3879#true} {3879#true} #78#return; {3879#true} is VALID [2022-04-15 08:40:42,900 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-15 08:40:42,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 08:40:42,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 08:40:42,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:40:42,900 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3879#true} {3879#true} #80#return; {3879#true} is VALID [2022-04-15 08:40:42,900 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-15 08:40:42,900 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-15 08:40:42,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 08:40:42,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 08:40:42,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:40:42,900 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3879#true} {3879#true} #82#return; {3879#true} is VALID [2022-04-15 08:40:42,900 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-15 08:40:42,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 08:40:42,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 08:40:42,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:40:42,901 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3879#true} {3879#true} #84#return; {3879#true} is VALID [2022-04-15 08:40:42,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3879#true} is VALID [2022-04-15 08:40:42,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#true} assume !!(#t~post6 < 10);havoc #t~post6; {3879#true} is VALID [2022-04-15 08:40:42,901 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-15 08:40:42,902 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-15 08:40:42,902 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-15 08:40:42,902 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-15 08:40:42,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 08:40:42,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 08:40:42,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:40:42,903 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-15 08:40:42,903 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-15 08:40:42,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 08:40:42,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 08:40:42,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:40:42,904 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-15 08:40:42,904 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-15 08:40:42,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 08:40:42,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 08:40:42,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:40:42,905 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-15 08:40:42,905 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-15 08:40:42,905 INFO L290 TraceCheckUtils]: 48: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 08:40:42,905 INFO L290 TraceCheckUtils]: 49: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 08:40:42,905 INFO L290 TraceCheckUtils]: 50: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:40:42,906 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-15 08:40:42,907 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-15 08:40:42,907 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-15 08:40:42,908 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-15 08:40:42,908 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-15 08:40:42,909 INFO L290 TraceCheckUtils]: 56: Hoare triple {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:40:42,909 INFO L290 TraceCheckUtils]: 57: Hoare triple {4055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3880#false} is VALID [2022-04-15 08:40:42,909 INFO L290 TraceCheckUtils]: 58: Hoare triple {3880#false} assume !false; {3880#false} is VALID [2022-04-15 08:40:42,909 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-15 08:40:42,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:41:03,369 INFO L290 TraceCheckUtils]: 58: Hoare triple {3880#false} assume !false; {3880#false} is VALID [2022-04-15 08:41:03,369 INFO L290 TraceCheckUtils]: 57: Hoare triple {4055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3880#false} is VALID [2022-04-15 08:41:03,370 INFO L290 TraceCheckUtils]: 56: Hoare triple {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:41:03,370 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-15 08:41:03,371 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-15 08:41:03,371 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-15 08:41:03,372 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-15 08:41:03,372 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-15 08:41:03,372 INFO L290 TraceCheckUtils]: 50: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:41:03,373 INFO L290 TraceCheckUtils]: 49: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 08:41:03,373 INFO L290 TraceCheckUtils]: 48: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 08:41:03,373 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-15 08:41:03,373 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-15 08:41:03,373 INFO L290 TraceCheckUtils]: 45: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:41:03,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 08:41:03,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 08:41:03,374 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-15 08:41:03,374 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-15 08:41:03,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:41:03,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 08:41:03,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 08:41:03,374 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-15 08:41:03,375 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-15 08:41:03,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:41:03,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 08:41:03,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 08:41:03,375 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-15 08:41:03,376 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-15 08:41:03,376 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-15 08:41:03,376 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-15 08:41:03,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#true} assume !!(#t~post6 < 10);havoc #t~post6; {3879#true} is VALID [2022-04-15 08:41:03,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3879#true} is VALID [2022-04-15 08:41:03,376 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3879#true} {3879#true} #84#return; {3879#true} is VALID [2022-04-15 08:41:03,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:41:03,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 08:41:03,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 08:41:03,377 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-15 08:41:03,377 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3879#true} {3879#true} #82#return; {3879#true} is VALID [2022-04-15 08:41:03,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:41:03,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 08:41:03,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 08:41:03,377 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-15 08:41:03,377 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-15 08:41:03,377 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3879#true} {3879#true} #80#return; {3879#true} is VALID [2022-04-15 08:41:03,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:41:03,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 08:41:03,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 08:41:03,378 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-15 08:41:03,378 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3879#true} {3879#true} #78#return; {3879#true} is VALID [2022-04-15 08:41:03,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:41:03,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-15 08:41:03,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-15 08:41:03,378 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-15 08:41:03,378 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-15 08:41:03,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {3879#true} call #t~ret8 := main(); {3879#true} is VALID [2022-04-15 08:41:03,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3879#true} {3879#true} #98#return; {3879#true} is VALID [2022-04-15 08:41:03,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-15 08:41:03,378 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-15 08:41:03,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {3879#true} call ULTIMATE.init(); {3879#true} is VALID [2022-04-15 08:41:03,379 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-15 08:41:03,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:41:03,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155934933] [2022-04-15 08:41:03,379 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:41:03,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621974376] [2022-04-15 08:41:03,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621974376] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:41:03,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:41:03,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-15 08:41:03,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:41:03,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1129638777] [2022-04-15 08:41:03,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1129638777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:41:03,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:41:03,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:41:03,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592080134] [2022-04-15 08:41:03,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:41:03,380 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-15 08:41:03,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:41:03,380 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-15 08:41:03,413 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-15 08:41:03,414 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:41:03,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:41:03,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:41:03,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 08:41:03,414 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-15 08:41:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:03,794 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2022-04-15 08:41:03,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:41:03,794 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-15 08:41:03,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:41:03,794 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-15 08:41:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-15 08:41:03,796 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-15 08:41:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-15 08:41:03,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-15 08:41:03,850 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-15 08:41:03,852 INFO L225 Difference]: With dead ends: 96 [2022-04-15 08:41:03,852 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 08:41:03,852 INFO L912 BasicCegarLoop]: 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-15 08:41:03,852 INFO L913 BasicCegarLoop]: 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-15 08:41:03,853 INFO L914 BasicCegarLoop]: 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-15 08:41:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 08:41:03,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2022-04-15 08:41:03,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:41:03,918 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-15 08:41:03,918 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-15 08:41:03,919 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-15 08:41:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:03,927 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2022-04-15 08:41:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2022-04-15 08:41:03,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:41:03,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:41:03,933 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-15 08:41:03,933 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-15 08:41:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:03,936 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2022-04-15 08:41:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2022-04-15 08:41:03,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:41:03,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:41:03,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:41:03,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:41:03,939 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-15 08:41:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2022-04-15 08:41:03,940 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 59 [2022-04-15 08:41:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:41:03,941 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2022-04-15 08:41:03,941 INFO L479 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-15 08:41:03,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 111 transitions. [2022-04-15 08:41:04,055 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-15 08:41:04,055 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2022-04-15 08:41:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 08:41:04,056 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:41:04,056 INFO L499 BasicCegarLoop]: 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-15 08:41:04,074 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-15 08:41:04,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 08:41:04,257 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:41:04,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:41:04,257 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 1 times [2022-04-15 08:41:04,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:41:04,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1287314476] [2022-04-15 08:41:04,258 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:41:04,258 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 2 times [2022-04-15 08:41:04,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:41:04,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236948615] [2022-04-15 08:41:04,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:41:04,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:41:04,272 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:41:04,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1712108043] [2022-04-15 08:41:04,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:41:04,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:41:04,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:41:04,273 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-15 08:41:04,274 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-15 08:41:04,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:41:04,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:41:04,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 08:41:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:41:04,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:41:04,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {4789#true} call ULTIMATE.init(); {4789#true} is VALID [2022-04-15 08:41:04,536 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-15 08:41:04,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4797#(<= ~counter~0 0)} {4789#true} #98#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {4797#(<= ~counter~0 0)} call #t~ret8 := main(); {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,538 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-15 08:41:04,538 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-15 08:41:04,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,539 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #78#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,539 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-15 08:41:04,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,541 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #80#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,541 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-15 08:41:04,541 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-15 08:41:04,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,542 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #82#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,543 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-15 08:41:04,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,544 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #84#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:04,544 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-15 08:41:04,545 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-15 08:41:04,545 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-15 08:41:04,545 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-15 08:41:04,545 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-15 08:41:04,546 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-15 08:41:04,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,547 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #86#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,548 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-15 08:41:04,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,549 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #88#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,549 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-15 08:41:04,550 INFO L290 TraceCheckUtils]: 43: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,550 INFO L290 TraceCheckUtils]: 44: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,550 INFO L290 TraceCheckUtils]: 45: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,551 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #90#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,551 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-15 08:41:04,552 INFO L290 TraceCheckUtils]: 48: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,552 INFO L290 TraceCheckUtils]: 49: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,552 INFO L290 TraceCheckUtils]: 50: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,553 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #92#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,553 INFO L290 TraceCheckUtils]: 52: Hoare triple {4886#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {4886#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:04,553 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-15 08:41:04,554 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-15 08:41:04,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {4959#(<= |main_#t~post6| 2)} assume !(#t~post6 < 10);havoc #t~post6; {4790#false} is VALID [2022-04-15 08:41:04,554 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-15 08:41:04,554 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#false} ~cond := #in~cond; {4790#false} is VALID [2022-04-15 08:41:04,554 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#false} assume 0 == ~cond; {4790#false} is VALID [2022-04-15 08:41:04,554 INFO L290 TraceCheckUtils]: 59: Hoare triple {4790#false} assume !false; {4790#false} is VALID [2022-04-15 08:41:04,554 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-15 08:41:04,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:41:04,773 INFO L290 TraceCheckUtils]: 59: Hoare triple {4790#false} assume !false; {4790#false} is VALID [2022-04-15 08:41:04,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#false} assume 0 == ~cond; {4790#false} is VALID [2022-04-15 08:41:04,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#false} ~cond := #in~cond; {4790#false} is VALID [2022-04-15 08:41:04,774 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-15 08:41:04,774 INFO L290 TraceCheckUtils]: 55: Hoare triple {4987#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {4790#false} is VALID [2022-04-15 08:41:04,774 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-15 08:41:04,775 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-15 08:41:04,775 INFO L290 TraceCheckUtils]: 52: Hoare triple {4991#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {4991#(< ~counter~0 10)} is VALID [2022-04-15 08:41:04,775 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4789#true} {4991#(< ~counter~0 10)} #92#return; {4991#(< ~counter~0 10)} is VALID [2022-04-15 08:41:04,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-15 08:41:04,776 INFO L290 TraceCheckUtils]: 49: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-15 08:41:04,776 INFO L290 TraceCheckUtils]: 48: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-15 08:41:04,776 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-15 08:41:04,776 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4789#true} {4991#(< ~counter~0 10)} #90#return; {4991#(< ~counter~0 10)} is VALID [2022-04-15 08:41:04,776 INFO L290 TraceCheckUtils]: 45: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-15 08:41:04,776 INFO L290 TraceCheckUtils]: 44: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-15 08:41:04,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-15 08:41:04,777 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-15 08:41:04,798 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4789#true} {4991#(< ~counter~0 10)} #88#return; {4991#(< ~counter~0 10)} is VALID [2022-04-15 08:41:04,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-15 08:41:04,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-15 08:41:04,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-15 08:41:04,798 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-15 08:41:04,798 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4789#true} {4991#(< ~counter~0 10)} #86#return; {4991#(< ~counter~0 10)} is VALID [2022-04-15 08:41:04,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-15 08:41:04,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-15 08:41:04,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-15 08:41:04,799 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-15 08:41:04,801 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-15 08:41:04,801 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-15 08:41:04,801 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-15 08:41:04,802 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-15 08:41:04,802 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-15 08:41:04,802 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4789#true} {5074#(< ~counter~0 8)} #84#return; {5074#(< ~counter~0 8)} is VALID [2022-04-15 08:41:04,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-15 08:41:04,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-15 08:41:04,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-15 08:41:04,803 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-15 08:41:04,803 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4789#true} {5074#(< ~counter~0 8)} #82#return; {5074#(< ~counter~0 8)} is VALID [2022-04-15 08:41:04,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-15 08:41:04,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-15 08:41:04,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-15 08:41:04,803 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-15 08:41:04,804 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-15 08:41:04,804 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4789#true} {5074#(< ~counter~0 8)} #80#return; {5074#(< ~counter~0 8)} is VALID [2022-04-15 08:41:04,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-15 08:41:04,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-15 08:41:04,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-15 08:41:04,804 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-15 08:41:04,805 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4789#true} {5074#(< ~counter~0 8)} #78#return; {5074#(< ~counter~0 8)} is VALID [2022-04-15 08:41:04,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-15 08:41:04,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-15 08:41:04,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-15 08:41:04,805 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-15 08:41:04,805 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-15 08:41:04,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {5074#(< ~counter~0 8)} call #t~ret8 := main(); {5074#(< ~counter~0 8)} is VALID [2022-04-15 08:41:04,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5074#(< ~counter~0 8)} {4789#true} #98#return; {5074#(< ~counter~0 8)} is VALID [2022-04-15 08:41:04,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {5074#(< ~counter~0 8)} assume true; {5074#(< ~counter~0 8)} is VALID [2022-04-15 08:41:04,807 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-15 08:41:04,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {4789#true} call ULTIMATE.init(); {4789#true} is VALID [2022-04-15 08:41:04,807 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-15 08:41:04,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:41:04,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236948615] [2022-04-15 08:41:04,807 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:41:04,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712108043] [2022-04-15 08:41:04,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712108043] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:41:04,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:41:04,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 08:41:04,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:41:04,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1287314476] [2022-04-15 08:41:04,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1287314476] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:41:04,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:41:04,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:41:04,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035504534] [2022-04-15 08:41:04,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:41:04,808 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-15 08:41:04,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:41:04,809 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-15 08:41:04,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:41:04,842 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:41:04,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:41:04,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:41:04,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 08:41:04,842 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-15 08:41:05,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:05,052 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2022-04-15 08:41:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 08:41:05,052 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-15 08:41:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:41:05,052 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-15 08:41:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-15 08:41:05,054 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-15 08:41:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-15 08:41:05,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-15 08:41:05,111 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-15 08:41:05,112 INFO L225 Difference]: With dead ends: 111 [2022-04-15 08:41:05,113 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 08:41:05,113 INFO L912 BasicCegarLoop]: 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-15 08:41:05,113 INFO L913 BasicCegarLoop]: 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-15 08:41:05,113 INFO L914 BasicCegarLoop]: 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-15 08:41:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 08:41:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-15 08:41:05,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:41:05,222 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-15 08:41:05,224 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-15 08:41:05,225 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-15 08:41:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:05,227 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-15 08:41:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-15 08:41:05,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:41:05,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:41:05,227 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-15 08:41:05,228 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-15 08:41:05,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:05,229 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-15 08:41:05,230 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-15 08:41:05,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:41:05,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:41:05,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:41:05,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:41:05,230 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-15 08:41:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2022-04-15 08:41:05,232 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 60 [2022-04-15 08:41:05,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:41:05,232 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2022-04-15 08:41:05,232 INFO L479 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-15 08:41:05,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 126 transitions. [2022-04-15 08:41:05,384 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-15 08:41:05,384 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-15 08:41:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 08:41:05,385 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:41:05,385 INFO L499 BasicCegarLoop]: 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-15 08:41:05,404 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-15 08:41:05,585 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 08:41:05,586 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:41:05,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:41:05,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 1 times [2022-04-15 08:41:05,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:41:05,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [276646587] [2022-04-15 08:41:05,586 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:41:05,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 2 times [2022-04-15 08:41:05,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:41:05,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158205029] [2022-04-15 08:41:05,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:41:05,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:41:05,601 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:41:05,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1335488995] [2022-04-15 08:41:05,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:41:05,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:41:05,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:41:05,603 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-15 08:41:05,604 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-15 08:41:05,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:41:05,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:41:05,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 08:41:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:41:05,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:41:05,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {5794#true} call ULTIMATE.init(); {5794#true} is VALID [2022-04-15 08:41:05,857 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-15 08:41:05,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-15 08:41:05,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5794#true} {5794#true} #98#return; {5794#true} is VALID [2022-04-15 08:41:05,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {5794#true} call #t~ret8 := main(); {5794#true} is VALID [2022-04-15 08:41:05,857 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-15 08:41:05,857 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-15 08:41:05,858 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-15 08:41:05,859 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-15 08:41:05,859 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-15 08:41:05,859 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-15 08:41:05,859 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-15 08:41:05,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-15 08:41:05,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-15 08:41:05,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-15 08:41:05,860 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5794#true} {5831#(<= 1 main_~x~0)} #80#return; {5831#(<= 1 main_~x~0)} is VALID [2022-04-15 08:41:05,860 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-15 08:41:05,861 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-15 08:41:05,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-15 08:41:05,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-15 08:41:05,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-15 08:41:05,871 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5794#true} {5850#(<= 1 main_~a~0)} #82#return; {5850#(<= 1 main_~a~0)} is VALID [2022-04-15 08:41:05,871 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-15 08:41:05,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-15 08:41:05,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-15 08:41:05,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-15 08:41:05,871 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5794#true} {5850#(<= 1 main_~a~0)} #84#return; {5850#(<= 1 main_~a~0)} is VALID [2022-04-15 08:41:05,872 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-15 08:41:05,872 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-15 08:41:05,872 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-15 08:41:05,872 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-15 08:41:05,873 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-15 08:41:05,873 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-15 08:41:05,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-15 08:41:05,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-15 08:41:05,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-15 08:41:05,873 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #86#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-15 08:41:05,874 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-15 08:41:05,874 INFO L290 TraceCheckUtils]: 38: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-15 08:41:05,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-15 08:41:05,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-15 08:41:05,874 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #88#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-15 08:41:05,874 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-15 08:41:05,874 INFO L290 TraceCheckUtils]: 43: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-15 08:41:05,874 INFO L290 TraceCheckUtils]: 44: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-15 08:41:05,875 INFO L290 TraceCheckUtils]: 45: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-15 08:41:05,875 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #90#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-15 08:41:05,875 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-15 08:41:05,875 INFO L290 TraceCheckUtils]: 48: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-15 08:41:05,875 INFO L290 TraceCheckUtils]: 49: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-15 08:41:05,875 INFO L290 TraceCheckUtils]: 50: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-15 08:41:05,876 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #92#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-15 08:41:05,876 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-15 08:41:05,877 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-15 08:41:05,877 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-15 08:41:05,877 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-15 08:41:05,877 INFO L290 TraceCheckUtils]: 56: Hoare triple {5963#(<= 1 main_~b~0)} assume !(0 != ~b~0); {5795#false} is VALID [2022-04-15 08:41:05,877 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-15 08:41:05,877 INFO L290 TraceCheckUtils]: 58: Hoare triple {5795#false} ~cond := #in~cond; {5795#false} is VALID [2022-04-15 08:41:05,878 INFO L290 TraceCheckUtils]: 59: Hoare triple {5795#false} assume 0 == ~cond; {5795#false} is VALID [2022-04-15 08:41:05,878 INFO L290 TraceCheckUtils]: 60: Hoare triple {5795#false} assume !false; {5795#false} is VALID [2022-04-15 08:41:05,878 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-15 08:41:05,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:41:06,132 INFO L290 TraceCheckUtils]: 60: Hoare triple {5795#false} assume !false; {5795#false} is VALID [2022-04-15 08:41:06,132 INFO L290 TraceCheckUtils]: 59: Hoare triple {5795#false} assume 0 == ~cond; {5795#false} is VALID [2022-04-15 08:41:06,132 INFO L290 TraceCheckUtils]: 58: Hoare triple {5795#false} ~cond := #in~cond; {5795#false} is VALID [2022-04-15 08:41:06,132 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-15 08:41:06,133 INFO L290 TraceCheckUtils]: 56: Hoare triple {5963#(<= 1 main_~b~0)} assume !(0 != ~b~0); {5795#false} is VALID [2022-04-15 08:41:06,133 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-15 08:41:06,133 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-15 08:41:06,134 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-15 08:41:06,134 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-15 08:41:06,135 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #92#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-15 08:41:06,135 INFO L290 TraceCheckUtils]: 50: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-15 08:41:06,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-15 08:41:06,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-15 08:41:06,135 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-15 08:41:06,135 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #90#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-15 08:41:06,136 INFO L290 TraceCheckUtils]: 45: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-15 08:41:06,136 INFO L290 TraceCheckUtils]: 44: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-15 08:41:06,136 INFO L290 TraceCheckUtils]: 43: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-15 08:41:06,136 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-15 08:41:06,136 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #88#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-15 08:41:06,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-15 08:41:06,136 INFO L290 TraceCheckUtils]: 39: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-15 08:41:06,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-15 08:41:06,137 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-15 08:41:06,137 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #86#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-15 08:41:06,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-15 08:41:06,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-15 08:41:06,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-15 08:41:06,137 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-15 08:41:06,138 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-15 08:41:06,138 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-15 08:41:06,138 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-15 08:41:06,138 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-15 08:41:06,139 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-15 08:41:06,139 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5794#true} {5850#(<= 1 main_~a~0)} #84#return; {5850#(<= 1 main_~a~0)} is VALID [2022-04-15 08:41:06,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-15 08:41:06,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-15 08:41:06,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-15 08:41:06,139 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-15 08:41:06,140 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5794#true} {5850#(<= 1 main_~a~0)} #82#return; {5850#(<= 1 main_~a~0)} is VALID [2022-04-15 08:41:06,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-15 08:41:06,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-15 08:41:06,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-15 08:41:06,140 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-15 08:41:06,140 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-15 08:41:06,141 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5794#true} {5831#(<= 1 main_~x~0)} #80#return; {5831#(<= 1 main_~x~0)} is VALID [2022-04-15 08:41:06,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-15 08:41:06,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-15 08:41:06,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-15 08:41:06,141 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-15 08:41:06,142 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-15 08:41:06,142 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-15 08:41:06,142 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-15 08:41:06,142 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-15 08:41:06,143 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-15 08:41:06,143 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-15 08:41:06,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {5794#true} call #t~ret8 := main(); {5794#true} is VALID [2022-04-15 08:41:06,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5794#true} {5794#true} #98#return; {5794#true} is VALID [2022-04-15 08:41:06,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-15 08:41:06,143 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-15 08:41:06,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {5794#true} call ULTIMATE.init(); {5794#true} is VALID [2022-04-15 08:41:06,143 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-15 08:41:06,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:41:06,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158205029] [2022-04-15 08:41:06,143 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:41:06,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335488995] [2022-04-15 08:41:06,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335488995] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:41:06,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:41:06,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-15 08:41:06,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:41:06,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [276646587] [2022-04-15 08:41:06,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [276646587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:41:06,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:41:06,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 08:41:06,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348586602] [2022-04-15 08:41:06,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:41:06,145 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-15 08:41:06,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:41:06,145 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-15 08:41:06,176 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-15 08:41:06,177 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 08:41:06,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:41:06,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 08:41:06,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 08:41:06,177 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-15 08:41:07,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:07,095 INFO L93 Difference]: Finished difference Result 182 states and 256 transitions. [2022-04-15 08:41:07,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 08:41:07,096 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-15 08:41:07,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:41:07,096 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-15 08:41:07,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-15 08:41:07,098 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-15 08:41:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-15 08:41:07,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 147 transitions. [2022-04-15 08:41:07,209 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-15 08:41:07,212 INFO L225 Difference]: With dead ends: 182 [2022-04-15 08:41:07,212 INFO L226 Difference]: Without dead ends: 174 [2022-04-15 08:41:07,212 INFO L912 BasicCegarLoop]: 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-15 08:41:07,213 INFO L913 BasicCegarLoop]: 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-15 08:41:07,213 INFO L914 BasicCegarLoop]: 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-15 08:41:07,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-15 08:41:07,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 146. [2022-04-15 08:41:07,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:41:07,448 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-15 08:41:07,448 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-15 08:41:07,449 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-15 08:41:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:07,453 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2022-04-15 08:41:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2022-04-15 08:41:07,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:41:07,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:41:07,454 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-15 08:41:07,454 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-15 08:41:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:07,458 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2022-04-15 08:41:07,458 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2022-04-15 08:41:07,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:41:07,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:41:07,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:41:07,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:41:07,459 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-15 08:41:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2022-04-15 08:41:07,462 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 61 [2022-04-15 08:41:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:41:07,462 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2022-04-15 08:41:07,462 INFO L479 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-15 08:41:07,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 199 transitions. [2022-04-15 08:41:07,665 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-15 08:41:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2022-04-15 08:41:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 08:41:07,668 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:41:07,668 INFO L499 BasicCegarLoop]: 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-15 08:41:07,684 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-15 08:41:07,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 08:41:07,879 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:41:07,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:41:07,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1537891564, now seen corresponding path program 1 times [2022-04-15 08:41:07,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:41:07,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2078667435] [2022-04-15 08:41:07,880 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:41:07,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1537891564, now seen corresponding path program 2 times [2022-04-15 08:41:07,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:41:07,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764503904] [2022-04-15 08:41:07,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:41:07,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:41:07,891 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:41:07,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339563610] [2022-04-15 08:41:07,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:41:07,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:41:07,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:41:07,895 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-15 08:41:07,895 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-15 08:41:07,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:41:07,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:41:07,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 08:41:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:41:07,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:41:08,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {7186#true} call ULTIMATE.init(); {7186#true} is VALID [2022-04-15 08:41:08,167 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-15 08:41:08,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7194#(<= ~counter~0 0)} {7186#true} #98#return; {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {7194#(<= ~counter~0 0)} call #t~ret8 := main(); {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,170 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-15 08:41:08,170 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-15 08:41:08,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {7194#(<= ~counter~0 0)} ~cond := #in~cond; {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {7194#(<= ~counter~0 0)} assume !(0 == ~cond); {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,171 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7194#(<= ~counter~0 0)} {7194#(<= ~counter~0 0)} #78#return; {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,172 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-15 08:41:08,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {7194#(<= ~counter~0 0)} ~cond := #in~cond; {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {7194#(<= ~counter~0 0)} assume !(0 == ~cond); {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,173 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7194#(<= ~counter~0 0)} {7194#(<= ~counter~0 0)} #80#return; {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,173 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-15 08:41:08,174 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-15 08:41:08,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {7194#(<= ~counter~0 0)} ~cond := #in~cond; {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {7194#(<= ~counter~0 0)} assume !(0 == ~cond); {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,175 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7194#(<= ~counter~0 0)} {7194#(<= ~counter~0 0)} #82#return; {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,175 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-15 08:41:08,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {7194#(<= ~counter~0 0)} ~cond := #in~cond; {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {7194#(<= ~counter~0 0)} assume !(0 == ~cond); {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,176 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7194#(<= ~counter~0 0)} {7194#(<= ~counter~0 0)} #84#return; {7194#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:08,177 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-15 08:41:08,177 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-15 08:41:08,177 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-15 08:41:08,178 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-15 08:41:08,178 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-15 08:41:08,178 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-15 08:41:08,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {7283#(<= ~counter~0 2)} ~cond := #in~cond; {7283#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:08,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {7283#(<= ~counter~0 2)} assume !(0 == ~cond); {7283#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:08,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {7283#(<= ~counter~0 2)} assume true; {7283#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:08,180 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7283#(<= ~counter~0 2)} {7283#(<= ~counter~0 2)} #86#return; {7283#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:08,180 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-15 08:41:08,181 INFO L290 TraceCheckUtils]: 38: Hoare triple {7283#(<= ~counter~0 2)} ~cond := #in~cond; {7283#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:08,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {7283#(<= ~counter~0 2)} assume !(0 == ~cond); {7283#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:08,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {7283#(<= ~counter~0 2)} assume true; {7283#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:08,182 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7283#(<= ~counter~0 2)} {7283#(<= ~counter~0 2)} #88#return; {7283#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:08,182 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-15 08:41:08,182 INFO L290 TraceCheckUtils]: 43: Hoare triple {7283#(<= ~counter~0 2)} ~cond := #in~cond; {7283#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:08,183 INFO L290 TraceCheckUtils]: 44: Hoare triple {7283#(<= ~counter~0 2)} assume !(0 == ~cond); {7283#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:08,183 INFO L290 TraceCheckUtils]: 45: Hoare triple {7283#(<= ~counter~0 2)} assume true; {7283#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:08,183 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7283#(<= ~counter~0 2)} {7283#(<= ~counter~0 2)} #90#return; {7283#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:08,184 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-15 08:41:08,184 INFO L290 TraceCheckUtils]: 48: Hoare triple {7283#(<= ~counter~0 2)} ~cond := #in~cond; {7283#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:08,184 INFO L290 TraceCheckUtils]: 49: Hoare triple {7283#(<= ~counter~0 2)} assume !(0 == ~cond); {7283#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:08,185 INFO L290 TraceCheckUtils]: 50: Hoare triple {7283#(<= ~counter~0 2)} assume true; {7283#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:08,185 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7283#(<= ~counter~0 2)} {7283#(<= ~counter~0 2)} #92#return; {7283#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:08,186 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-15 08:41:08,186 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-15 08:41:08,186 INFO L290 TraceCheckUtils]: 54: Hoare triple {7353#(<= |main_#t~post7| 2)} assume !(#t~post7 < 10);havoc #t~post7; {7187#false} is VALID [2022-04-15 08:41:08,186 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-15 08:41:08,186 INFO L290 TraceCheckUtils]: 56: Hoare triple {7187#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7187#false} is VALID [2022-04-15 08:41:08,186 INFO L290 TraceCheckUtils]: 57: Hoare triple {7187#false} assume !(#t~post6 < 10);havoc #t~post6; {7187#false} is VALID [2022-04-15 08:41:08,187 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-15 08:41:08,187 INFO L290 TraceCheckUtils]: 59: Hoare triple {7187#false} ~cond := #in~cond; {7187#false} is VALID [2022-04-15 08:41:08,187 INFO L290 TraceCheckUtils]: 60: Hoare triple {7187#false} assume 0 == ~cond; {7187#false} is VALID [2022-04-15 08:41:08,187 INFO L290 TraceCheckUtils]: 61: Hoare triple {7187#false} assume !false; {7187#false} is VALID [2022-04-15 08:41:08,187 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-15 08:41:08,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:41:08,411 INFO L290 TraceCheckUtils]: 61: Hoare triple {7187#false} assume !false; {7187#false} is VALID [2022-04-15 08:41:08,412 INFO L290 TraceCheckUtils]: 60: Hoare triple {7187#false} assume 0 == ~cond; {7187#false} is VALID [2022-04-15 08:41:08,412 INFO L290 TraceCheckUtils]: 59: Hoare triple {7187#false} ~cond := #in~cond; {7187#false} is VALID [2022-04-15 08:41:08,412 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-15 08:41:08,412 INFO L290 TraceCheckUtils]: 57: Hoare triple {7187#false} assume !(#t~post6 < 10);havoc #t~post6; {7187#false} is VALID [2022-04-15 08:41:08,412 INFO L290 TraceCheckUtils]: 56: Hoare triple {7187#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7187#false} is VALID [2022-04-15 08:41:08,412 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-15 08:41:08,412 INFO L290 TraceCheckUtils]: 54: Hoare triple {7399#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {7187#false} is VALID [2022-04-15 08:41:08,413 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-15 08:41:08,413 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-15 08:41:08,414 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7186#true} {7403#(< ~counter~0 10)} #92#return; {7403#(< ~counter~0 10)} is VALID [2022-04-15 08:41:08,414 INFO L290 TraceCheckUtils]: 50: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-15 08:41:08,414 INFO L290 TraceCheckUtils]: 49: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-15 08:41:08,414 INFO L290 TraceCheckUtils]: 48: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-15 08:41:08,414 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-15 08:41:08,414 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7186#true} {7403#(< ~counter~0 10)} #90#return; {7403#(< ~counter~0 10)} is VALID [2022-04-15 08:41:08,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-15 08:41:08,415 INFO L290 TraceCheckUtils]: 44: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-15 08:41:08,415 INFO L290 TraceCheckUtils]: 43: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-15 08:41:08,415 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-15 08:41:08,415 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7186#true} {7403#(< ~counter~0 10)} #88#return; {7403#(< ~counter~0 10)} is VALID [2022-04-15 08:41:08,415 INFO L290 TraceCheckUtils]: 40: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-15 08:41:08,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-15 08:41:08,415 INFO L290 TraceCheckUtils]: 38: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-15 08:41:08,416 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-15 08:41:08,416 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7186#true} {7403#(< ~counter~0 10)} #86#return; {7403#(< ~counter~0 10)} is VALID [2022-04-15 08:41:08,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-15 08:41:08,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-15 08:41:08,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-15 08:41:08,416 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-15 08:41:08,417 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-15 08:41:08,417 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-15 08:41:08,417 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-15 08:41:08,418 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-15 08:41:08,418 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-15 08:41:08,418 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7186#true} {7483#(< ~counter~0 8)} #84#return; {7483#(< ~counter~0 8)} is VALID [2022-04-15 08:41:08,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-15 08:41:08,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-15 08:41:08,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-15 08:41:08,419 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-15 08:41:08,419 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7186#true} {7483#(< ~counter~0 8)} #82#return; {7483#(< ~counter~0 8)} is VALID [2022-04-15 08:41:08,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-15 08:41:08,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-15 08:41:08,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-15 08:41:08,419 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-15 08:41:08,420 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-15 08:41:08,420 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7186#true} {7483#(< ~counter~0 8)} #80#return; {7483#(< ~counter~0 8)} is VALID [2022-04-15 08:41:08,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-15 08:41:08,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-15 08:41:08,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-15 08:41:08,420 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-15 08:41:08,421 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7186#true} {7483#(< ~counter~0 8)} #78#return; {7483#(< ~counter~0 8)} is VALID [2022-04-15 08:41:08,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-15 08:41:08,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-15 08:41:08,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-15 08:41:08,421 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-15 08:41:08,421 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-15 08:41:08,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {7483#(< ~counter~0 8)} call #t~ret8 := main(); {7483#(< ~counter~0 8)} is VALID [2022-04-15 08:41:08,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7483#(< ~counter~0 8)} {7186#true} #98#return; {7483#(< ~counter~0 8)} is VALID [2022-04-15 08:41:08,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {7483#(< ~counter~0 8)} assume true; {7483#(< ~counter~0 8)} is VALID [2022-04-15 08:41:08,423 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-15 08:41:08,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {7186#true} call ULTIMATE.init(); {7186#true} is VALID [2022-04-15 08:41:08,423 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-15 08:41:08,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:41:08,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764503904] [2022-04-15 08:41:08,424 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:41:08,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339563610] [2022-04-15 08:41:08,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339563610] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:41:08,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:41:08,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 08:41:08,424 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:41:08,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2078667435] [2022-04-15 08:41:08,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2078667435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:41:08,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:41:08,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:41:08,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183398427] [2022-04-15 08:41:08,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:41:08,425 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-15 08:41:08,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:41:08,425 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-15 08:41:08,454 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-15 08:41:08,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:41:08,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:41:08,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:41:08,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 08:41:08,454 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-15 08:41:08,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:08,865 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2022-04-15 08:41:08,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 08:41:08,865 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-15 08:41:08,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:41:08,865 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-15 08:41:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-15 08:41:08,866 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-15 08:41:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-15 08:41:08,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2022-04-15 08:41:08,936 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-15 08:41:08,939 INFO L225 Difference]: With dead ends: 183 [2022-04-15 08:41:08,939 INFO L226 Difference]: Without dead ends: 146 [2022-04-15 08:41:08,942 INFO L912 BasicCegarLoop]: 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-15 08:41:08,942 INFO L913 BasicCegarLoop]: 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-15 08:41:08,943 INFO L914 BasicCegarLoop]: 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-15 08:41:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-15 08:41:09,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-15 08:41:09,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:41:09,129 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-15 08:41:09,130 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-15 08:41:09,130 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-15 08:41:09,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:09,133 INFO L93 Difference]: Finished difference Result 146 states and 198 transitions. [2022-04-15 08:41:09,133 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-15 08:41:09,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:41:09,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:41:09,134 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-15 08:41:09,134 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-15 08:41:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:09,138 INFO L93 Difference]: Finished difference Result 146 states and 198 transitions. [2022-04-15 08:41:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-15 08:41:09,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:41:09,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:41:09,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:41:09,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:41:09,139 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-15 08:41:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 198 transitions. [2022-04-15 08:41:09,143 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 198 transitions. Word has length 62 [2022-04-15 08:41:09,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:41:09,143 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 198 transitions. [2022-04-15 08:41:09,143 INFO L479 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-15 08:41:09,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 198 transitions. [2022-04-15 08:41:09,381 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-15 08:41:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-15 08:41:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 08:41:09,383 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:41:09,383 INFO L499 BasicCegarLoop]: 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-15 08:41:09,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 08:41:09,584 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 08:41:09,584 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:41:09,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:41:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash -385934262, now seen corresponding path program 1 times [2022-04-15 08:41:09,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:41:09,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1339465605] [2022-04-15 08:41:09,585 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:41:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash -385934262, now seen corresponding path program 2 times [2022-04-15 08:41:09,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:41:09,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65438243] [2022-04-15 08:41:09,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:41:09,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:41:09,595 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:41:09,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1907050578] [2022-04-15 08:41:09,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:41:09,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:41:09,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:41:09,596 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-15 08:41:09,597 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-15 08:41:09,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:41:09,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:41:09,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 08:41:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:41:09,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:41:09,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-15 08:41:09,905 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-15 08:41:09,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8527#(<= ~counter~0 0)} {8519#true} #98#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {8527#(<= ~counter~0 0)} call #t~ret8 := main(); {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,907 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-15 08:41:09,908 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-15 08:41:09,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,909 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #78#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,910 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-15 08:41:09,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,911 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #80#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,911 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-15 08:41:09,912 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-15 08:41:09,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,913 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #82#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,913 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-15 08:41:09,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,915 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #84#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:41:09,915 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-15 08:41:09,915 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-15 08:41:09,916 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-15 08:41:09,916 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-15 08:41:09,916 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-15 08:41:09,917 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-15 08:41:09,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {8616#(<= ~counter~0 2)} ~cond := #in~cond; {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {8616#(<= ~counter~0 2)} assume !(0 == ~cond); {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,918 INFO L290 TraceCheckUtils]: 35: Hoare triple {8616#(<= ~counter~0 2)} assume true; {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,918 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8616#(<= ~counter~0 2)} {8616#(<= ~counter~0 2)} #86#return; {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,919 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-15 08:41:09,919 INFO L290 TraceCheckUtils]: 38: Hoare triple {8616#(<= ~counter~0 2)} ~cond := #in~cond; {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,919 INFO L290 TraceCheckUtils]: 39: Hoare triple {8616#(<= ~counter~0 2)} assume !(0 == ~cond); {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {8616#(<= ~counter~0 2)} assume true; {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,920 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8616#(<= ~counter~0 2)} {8616#(<= ~counter~0 2)} #88#return; {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,921 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-15 08:41:09,921 INFO L290 TraceCheckUtils]: 43: Hoare triple {8616#(<= ~counter~0 2)} ~cond := #in~cond; {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {8616#(<= ~counter~0 2)} assume !(0 == ~cond); {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {8616#(<= ~counter~0 2)} assume true; {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,922 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8616#(<= ~counter~0 2)} {8616#(<= ~counter~0 2)} #90#return; {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,923 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-15 08:41:09,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {8616#(<= ~counter~0 2)} ~cond := #in~cond; {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {8616#(<= ~counter~0 2)} assume !(0 == ~cond); {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {8616#(<= ~counter~0 2)} assume true; {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,924 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8616#(<= ~counter~0 2)} {8616#(<= ~counter~0 2)} #92#return; {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,924 INFO L290 TraceCheckUtils]: 52: Hoare triple {8616#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {8616#(<= ~counter~0 2)} is VALID [2022-04-15 08:41:09,925 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-15 08:41:09,925 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-15 08:41:09,925 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-15 08:41:09,926 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-15 08:41:09,926 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-15 08:41:09,926 INFO L290 TraceCheckUtils]: 58: Hoare triple {8699#(<= |main_#t~post7| 3)} assume !(#t~post7 < 10);havoc #t~post7; {8520#false} is VALID [2022-04-15 08:41:09,927 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-15 08:41:09,927 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8520#false} is VALID [2022-04-15 08:41:09,927 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume !(#t~post6 < 10);havoc #t~post6; {8520#false} is VALID [2022-04-15 08:41:09,927 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-15 08:41:09,927 INFO L290 TraceCheckUtils]: 63: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-15 08:41:09,927 INFO L290 TraceCheckUtils]: 64: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-15 08:41:09,927 INFO L290 TraceCheckUtils]: 65: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-15 08:41:09,927 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-15 08:41:09,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:41:10,215 INFO L290 TraceCheckUtils]: 65: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-15 08:41:10,215 INFO L290 TraceCheckUtils]: 64: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-15 08:41:10,215 INFO L290 TraceCheckUtils]: 63: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-15 08:41:10,215 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-15 08:41:10,215 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume !(#t~post6 < 10);havoc #t~post6; {8520#false} is VALID [2022-04-15 08:41:10,216 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8520#false} is VALID [2022-04-15 08:41:10,216 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-15 08:41:10,216 INFO L290 TraceCheckUtils]: 58: Hoare triple {8745#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {8520#false} is VALID [2022-04-15 08:41:10,216 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-15 08:41:10,217 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-15 08:41:10,217 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-15 08:41:10,217 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-15 08:41:10,218 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-15 08:41:10,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {8759#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {8759#(< ~counter~0 9)} is VALID [2022-04-15 08:41:10,218 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8519#true} {8759#(< ~counter~0 9)} #92#return; {8759#(< ~counter~0 9)} is VALID [2022-04-15 08:41:10,219 INFO L290 TraceCheckUtils]: 50: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-15 08:41:10,219 INFO L290 TraceCheckUtils]: 49: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-15 08:41:10,219 INFO L290 TraceCheckUtils]: 48: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-15 08:41:10,219 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-15 08:41:10,219 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8519#true} {8759#(< ~counter~0 9)} #90#return; {8759#(< ~counter~0 9)} is VALID [2022-04-15 08:41:10,219 INFO L290 TraceCheckUtils]: 45: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-15 08:41:10,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-15 08:41:10,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-15 08:41:10,220 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-15 08:41:10,220 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8519#true} {8759#(< ~counter~0 9)} #88#return; {8759#(< ~counter~0 9)} is VALID [2022-04-15 08:41:10,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-15 08:41:10,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-15 08:41:10,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-15 08:41:10,220 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-15 08:41:10,221 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8519#true} {8759#(< ~counter~0 9)} #86#return; {8759#(< ~counter~0 9)} is VALID [2022-04-15 08:41:10,221 INFO L290 TraceCheckUtils]: 35: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-15 08:41:10,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-15 08:41:10,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-15 08:41:10,221 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-15 08:41:10,221 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-15 08:41:10,222 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-15 08:41:10,222 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-15 08:41:10,222 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-15 08:41:10,223 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-15 08:41:10,223 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8519#true} {8842#(< ~counter~0 7)} #84#return; {8842#(< ~counter~0 7)} is VALID [2022-04-15 08:41:10,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-15 08:41:10,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-15 08:41:10,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-15 08:41:10,223 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-15 08:41:10,224 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8519#true} {8842#(< ~counter~0 7)} #82#return; {8842#(< ~counter~0 7)} is VALID [2022-04-15 08:41:10,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-15 08:41:10,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-15 08:41:10,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-15 08:41:10,224 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-15 08:41:10,224 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-15 08:41:10,225 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8519#true} {8842#(< ~counter~0 7)} #80#return; {8842#(< ~counter~0 7)} is VALID [2022-04-15 08:41:10,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-15 08:41:10,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-15 08:41:10,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-15 08:41:10,225 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-15 08:41:10,225 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8519#true} {8842#(< ~counter~0 7)} #78#return; {8842#(< ~counter~0 7)} is VALID [2022-04-15 08:41:10,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-15 08:41:10,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-15 08:41:10,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-15 08:41:10,226 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-15 08:41:10,226 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-15 08:41:10,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {8842#(< ~counter~0 7)} call #t~ret8 := main(); {8842#(< ~counter~0 7)} is VALID [2022-04-15 08:41:10,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8842#(< ~counter~0 7)} {8519#true} #98#return; {8842#(< ~counter~0 7)} is VALID [2022-04-15 08:41:10,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {8842#(< ~counter~0 7)} assume true; {8842#(< ~counter~0 7)} is VALID [2022-04-15 08:41:10,227 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-15 08:41:10,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-15 08:41:10,227 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-15 08:41:10,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:41:10,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65438243] [2022-04-15 08:41:10,228 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:41:10,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907050578] [2022-04-15 08:41:10,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907050578] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:41:10,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:41:10,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 08:41:10,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:41:10,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1339465605] [2022-04-15 08:41:10,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1339465605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:41:10,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:41:10,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 08:41:10,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726360939] [2022-04-15 08:41:10,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:41:10,229 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-15 08:41:10,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:41:10,229 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-15 08:41:10,260 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-15 08:41:10,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 08:41:10,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:41:10,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 08:41:10,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 08:41:10,261 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-15 08:41:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:10,681 INFO L93 Difference]: Finished difference Result 253 states and 351 transitions. [2022-04-15 08:41:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 08:41:10,682 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-15 08:41:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:41:10,682 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-15 08:41:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-15 08:41:10,685 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-15 08:41:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-15 08:41:10,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 114 transitions. [2022-04-15 08:41:10,771 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-15 08:41:10,774 INFO L225 Difference]: With dead ends: 253 [2022-04-15 08:41:10,774 INFO L226 Difference]: Without dead ends: 173 [2022-04-15 08:41:10,775 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:41:10,776 INFO L913 BasicCegarLoop]: 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-15 08:41:10,776 INFO L914 BasicCegarLoop]: 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-15 08:41:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-15 08:41:11,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-04-15 08:41:11,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:41:11,044 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-15 08:41:11,044 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-15 08:41:11,044 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-15 08:41:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:11,047 INFO L93 Difference]: Finished difference Result 173 states and 225 transitions. [2022-04-15 08:41:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2022-04-15 08:41:11,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:41:11,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:41:11,048 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-15 08:41:11,049 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-15 08:41:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:11,052 INFO L93 Difference]: Finished difference Result 173 states and 225 transitions. [2022-04-15 08:41:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2022-04-15 08:41:11,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:41:11,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:41:11,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:41:11,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:41:11,053 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-15 08:41:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2022-04-15 08:41:11,056 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 66 [2022-04-15 08:41:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:41:11,057 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2022-04-15 08:41:11,057 INFO L479 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-15 08:41:11,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 223 transitions. [2022-04-15 08:41:11,290 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-15 08:41:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2022-04-15 08:41:11,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 08:41:11,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:41:11,295 INFO L499 BasicCegarLoop]: 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-15 08:41:11,311 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-15 08:41:11,512 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 08:41:11,512 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:41:11,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:41:11,512 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 1 times [2022-04-15 08:41:11,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:41:11,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [779146854] [2022-04-15 08:41:11,513 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:41:11,513 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 2 times [2022-04-15 08:41:11,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:41:11,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075356412] [2022-04-15 08:41:11,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:41:11,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:41:11,531 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:41:11,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376358596] [2022-04-15 08:41:11,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:41:11,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:41:11,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:41:11,533 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-15 08:41:11,533 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-15 08:41:11,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:41:11,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:41:11,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 08:41:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:41:11,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:41:11,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {10124#true} call ULTIMATE.init(); {10124#true} is VALID [2022-04-15 08:41:11,871 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-15 08:41:11,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:11,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10124#true} {10124#true} #98#return; {10124#true} is VALID [2022-04-15 08:41:11,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {10124#true} call #t~ret8 := main(); {10124#true} is VALID [2022-04-15 08:41:11,871 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-15 08:41:11,872 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-15 08:41:11,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-15 08:41:11,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-15 08:41:11,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:11,872 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10124#true} {10124#true} #78#return; {10124#true} is VALID [2022-04-15 08:41:11,872 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-15 08:41:11,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-15 08:41:11,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-15 08:41:11,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:11,872 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10124#true} {10124#true} #80#return; {10124#true} is VALID [2022-04-15 08:41:11,873 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-15 08:41:11,873 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-15 08:41:11,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-15 08:41:11,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-15 08:41:11,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:11,873 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-15 08:41:11,873 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-15 08:41:11,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-15 08:41:11,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-15 08:41:11,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:11,874 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-15 08:41:11,874 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-15 08:41:11,875 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-15 08:41:11,875 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-15 08:41:11,875 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-15 08:41:11,876 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-15 08:41:11,876 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-15 08:41:11,876 INFO L290 TraceCheckUtils]: 33: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-15 08:41:11,876 INFO L290 TraceCheckUtils]: 34: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-15 08:41:11,876 INFO L290 TraceCheckUtils]: 35: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:11,876 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-15 08:41:11,877 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-15 08:41:11,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-15 08:41:11,877 INFO L290 TraceCheckUtils]: 39: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-15 08:41:11,877 INFO L290 TraceCheckUtils]: 40: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:11,877 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-15 08:41:11,877 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-15 08:41:11,878 INFO L290 TraceCheckUtils]: 43: Hoare triple {10124#true} ~cond := #in~cond; {10260#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:41:11,878 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-15 08:41:11,878 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-15 08:41:11,879 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-15 08:41:11,879 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-15 08:41:11,879 INFO L290 TraceCheckUtils]: 48: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-15 08:41:11,879 INFO L290 TraceCheckUtils]: 49: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-15 08:41:11,879 INFO L290 TraceCheckUtils]: 50: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:11,880 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-15 08:41:11,880 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-15 08:41:11,880 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-15 08:41:11,881 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-15 08:41:11,881 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-15 08:41:11,882 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-15 08:41:11,882 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-15 08:41:11,882 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-15 08:41:11,882 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-15 08:41:11,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-15 08:41:11,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-15 08:41:11,883 INFO L290 TraceCheckUtils]: 62: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:11,883 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-15 08:41:11,884 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-15 08:41:11,884 INFO L290 TraceCheckUtils]: 65: Hoare triple {10327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:41:11,884 INFO L290 TraceCheckUtils]: 66: Hoare triple {10331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10125#false} is VALID [2022-04-15 08:41:11,884 INFO L290 TraceCheckUtils]: 67: Hoare triple {10125#false} assume !false; {10125#false} is VALID [2022-04-15 08:41:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-15 08:41:11,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:41:35,578 INFO L290 TraceCheckUtils]: 67: Hoare triple {10125#false} assume !false; {10125#false} is VALID [2022-04-15 08:41:35,579 INFO L290 TraceCheckUtils]: 66: Hoare triple {10331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10125#false} is VALID [2022-04-15 08:41:35,579 INFO L290 TraceCheckUtils]: 65: Hoare triple {10327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:41:35,580 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-15 08:41:35,580 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-15 08:41:35,580 INFO L290 TraceCheckUtils]: 62: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:35,581 INFO L290 TraceCheckUtils]: 61: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-15 08:41:35,581 INFO L290 TraceCheckUtils]: 60: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-15 08:41:35,581 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-15 08:41:35,581 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-15 08:41:35,581 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-15 08:41:35,582 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-15 08:41:35,582 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-15 08:41:35,582 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-15 08:41:35,583 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-15 08:41:35,583 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-15 08:41:35,584 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-15 08:41:35,584 INFO L290 TraceCheckUtils]: 50: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:35,584 INFO L290 TraceCheckUtils]: 49: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-15 08:41:35,584 INFO L290 TraceCheckUtils]: 48: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-15 08:41:35,584 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-15 08:41:35,585 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-15 08:41:35,585 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-15 08:41:35,585 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-15 08:41:35,585 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-15 08:41:35,585 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-15 08:41:35,586 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10124#true} {10124#true} #88#return; {10124#true} is VALID [2022-04-15 08:41:35,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:35,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-15 08:41:35,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-15 08:41:35,586 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-15 08:41:35,586 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10124#true} {10124#true} #86#return; {10124#true} is VALID [2022-04-15 08:41:35,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:35,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-15 08:41:35,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-15 08:41:35,586 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-15 08:41:35,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {10124#true} assume !!(#t~post7 < 10);havoc #t~post7; {10124#true} is VALID [2022-04-15 08:41:35,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {10124#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10124#true} is VALID [2022-04-15 08:41:35,586 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-15 08:41:35,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {10124#true} assume !!(#t~post6 < 10);havoc #t~post6; {10124#true} is VALID [2022-04-15 08:41:35,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {10124#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10124#true} is VALID [2022-04-15 08:41:35,587 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10124#true} {10124#true} #84#return; {10124#true} is VALID [2022-04-15 08:41:35,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:35,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-15 08:41:35,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-15 08:41:35,587 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-15 08:41:35,587 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10124#true} {10124#true} #82#return; {10124#true} is VALID [2022-04-15 08:41:35,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:35,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-15 08:41:35,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-15 08:41:35,587 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-15 08:41:35,587 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-15 08:41:35,587 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10124#true} {10124#true} #80#return; {10124#true} is VALID [2022-04-15 08:41:35,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:35,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-15 08:41:35,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-15 08:41:35,588 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-15 08:41:35,588 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10124#true} {10124#true} #78#return; {10124#true} is VALID [2022-04-15 08:41:35,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:35,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-15 08:41:35,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-15 08:41:35,588 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-15 08:41:35,588 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-15 08:41:35,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {10124#true} call #t~ret8 := main(); {10124#true} is VALID [2022-04-15 08:41:35,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10124#true} {10124#true} #98#return; {10124#true} is VALID [2022-04-15 08:41:35,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 08:41:35,588 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-15 08:41:35,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {10124#true} call ULTIMATE.init(); {10124#true} is VALID [2022-04-15 08:41:35,589 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-15 08:41:35,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:41:35,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075356412] [2022-04-15 08:41:35,589 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:41:35,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376358596] [2022-04-15 08:41:35,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376358596] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:41:35,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:41:35,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-15 08:41:35,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:41:35,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [779146854] [2022-04-15 08:41:35,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [779146854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:41:35,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:41:35,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 08:41:35,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886377401] [2022-04-15 08:41:35,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:41:35,590 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-15 08:41:35,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:41:35,590 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-15 08:41:35,625 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-15 08:41:35,625 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 08:41:35,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:41:35,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 08:41:35,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-15 08:41:35,626 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-15 08:41:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:36,742 INFO L93 Difference]: Finished difference Result 195 states and 259 transitions. [2022-04-15 08:41:36,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 08:41:36,742 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-15 08:41:36,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:41:36,744 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-15 08:41:36,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-15 08:41:36,745 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-15 08:41:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-15 08:41:36,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2022-04-15 08:41:36,827 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-15 08:41:36,830 INFO L225 Difference]: With dead ends: 195 [2022-04-15 08:41:36,830 INFO L226 Difference]: Without dead ends: 193 [2022-04-15 08:41:36,830 INFO L912 BasicCegarLoop]: 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-15 08:41:36,831 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 22 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 08:41:36,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 295 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 08:41:36,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-15 08:41:37,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2022-04-15 08:41:37,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:41:37,095 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-15 08:41:37,096 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-15 08:41:37,096 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-15 08:41:37,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:37,100 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2022-04-15 08:41:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2022-04-15 08:41:37,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:41:37,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:41:37,101 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-15 08:41:37,104 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-15 08:41:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:37,108 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2022-04-15 08:41:37,108 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2022-04-15 08:41:37,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:41:37,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:41:37,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:41:37,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:41:37,109 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-15 08:41:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 254 transitions. [2022-04-15 08:41:37,113 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 254 transitions. Word has length 68 [2022-04-15 08:41:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:41:37,113 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 254 transitions. [2022-04-15 08:41:37,113 INFO L479 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-15 08:41:37,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 254 transitions. [2022-04-15 08:41:37,406 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-15 08:41:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 254 transitions. [2022-04-15 08:41:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 08:41:37,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:41:37,407 INFO L499 BasicCegarLoop]: 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-15 08:41:37,423 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-15 08:41:37,622 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 08:41:37,623 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:41:37,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:41:37,623 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 3 times [2022-04-15 08:41:37,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:41:37,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [891189672] [2022-04-15 08:41:37,624 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:41:37,624 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 4 times [2022-04-15 08:41:37,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:41:37,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044889121] [2022-04-15 08:41:37,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:41:37,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:41:37,647 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:41:37,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1722276313] [2022-04-15 08:41:37,647 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 08:41:37,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:41:37,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:41:37,649 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-15 08:41:37,650 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-15 08:41:37,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 08:41:37,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:41:37,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 08:41:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:41:37,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:41:38,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {11708#true} call ULTIMATE.init(); {11708#true} is VALID [2022-04-15 08:41:38,149 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-15 08:41:38,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:38,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11708#true} {11708#true} #98#return; {11708#true} is VALID [2022-04-15 08:41:38,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {11708#true} call #t~ret8 := main(); {11708#true} is VALID [2022-04-15 08:41:38,150 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-15 08:41:38,150 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-15 08:41:38,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:38,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:38,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:38,150 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11708#true} {11708#true} #78#return; {11708#true} is VALID [2022-04-15 08:41:38,150 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-15 08:41:38,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:38,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:38,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:38,150 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11708#true} {11708#true} #80#return; {11708#true} is VALID [2022-04-15 08:41:38,151 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-15 08:41:38,151 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-15 08:41:38,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:38,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:38,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:38,152 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-15 08:41:38,152 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-15 08:41:38,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:38,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:38,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:38,153 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-15 08:41:38,153 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-15 08:41:38,153 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-15 08:41:38,154 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-15 08:41:38,154 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-15 08:41:38,155 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-15 08:41:38,155 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-15 08:41:38,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:38,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:38,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:38,156 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-15 08:41:38,156 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-15 08:41:38,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:38,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:38,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:38,157 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-15 08:41:38,157 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-15 08:41:38,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:38,157 INFO L290 TraceCheckUtils]: 44: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:38,157 INFO L290 TraceCheckUtils]: 45: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:38,157 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-15 08:41:38,158 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-15 08:41:38,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:38,158 INFO L290 TraceCheckUtils]: 49: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:38,158 INFO L290 TraceCheckUtils]: 50: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:38,158 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-15 08:41:38,159 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-15 08:41:38,159 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-15 08:41:38,160 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-15 08:41:38,160 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-15 08:41:38,160 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-15 08:41:38,161 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-15 08:41:38,161 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-15 08:41:38,161 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-15 08:41:38,161 INFO L290 TraceCheckUtils]: 60: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:38,161 INFO L290 TraceCheckUtils]: 61: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:38,161 INFO L290 TraceCheckUtils]: 62: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:38,162 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-15 08:41:38,162 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-15 08:41:38,162 INFO L290 TraceCheckUtils]: 65: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:38,162 INFO L290 TraceCheckUtils]: 66: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:38,162 INFO L290 TraceCheckUtils]: 67: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:38,163 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-15 08:41:38,163 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-15 08:41:38,164 INFO L290 TraceCheckUtils]: 70: Hoare triple {11923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:41:38,164 INFO L290 TraceCheckUtils]: 71: Hoare triple {11927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11709#false} is VALID [2022-04-15 08:41:38,164 INFO L290 TraceCheckUtils]: 72: Hoare triple {11709#false} assume !false; {11709#false} is VALID [2022-04-15 08:41:38,164 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-15 08:41:38,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:41:38,420 INFO L290 TraceCheckUtils]: 72: Hoare triple {11709#false} assume !false; {11709#false} is VALID [2022-04-15 08:41:38,421 INFO L290 TraceCheckUtils]: 71: Hoare triple {11927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11709#false} is VALID [2022-04-15 08:41:38,421 INFO L290 TraceCheckUtils]: 70: Hoare triple {11923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:41:38,422 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-15 08:41:38,422 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-15 08:41:38,422 INFO L290 TraceCheckUtils]: 67: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:38,422 INFO L290 TraceCheckUtils]: 66: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:38,422 INFO L290 TraceCheckUtils]: 65: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:38,422 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-15 08:41:38,423 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-15 08:41:38,423 INFO L290 TraceCheckUtils]: 62: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:38,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:38,423 INFO L290 TraceCheckUtils]: 60: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:38,423 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-15 08:41:38,424 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-15 08:41:38,424 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-15 08:41:38,424 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-15 08:41:38,425 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-15 08:41:38,425 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-15 08:41:40,426 WARN L290 TraceCheckUtils]: 53: Hoare triple {11992#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-15 08:41:40,427 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-15 08:41:40,428 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-15 08:41:40,428 INFO L290 TraceCheckUtils]: 50: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:40,428 INFO L290 TraceCheckUtils]: 49: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:40,428 INFO L290 TraceCheckUtils]: 48: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:40,428 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-15 08:41:40,429 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-15 08:41:40,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:40,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:40,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:40,429 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-15 08:41:40,430 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-15 08:41:40,430 INFO L290 TraceCheckUtils]: 40: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:40,430 INFO L290 TraceCheckUtils]: 39: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:40,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:40,430 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-15 08:41:40,432 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-15 08:41:40,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:40,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:40,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:40,432 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-15 08:41:40,435 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-15 08:41:40,436 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-15 08:41:40,436 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-15 08:41:40,436 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-15 08:41:40,437 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-15 08:41:40,437 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-15 08:41:40,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:40,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:40,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:40,438 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-15 08:41:40,438 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-15 08:41:40,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:40,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:40,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:40,439 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-15 08:41:40,439 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-15 08:41:40,439 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11708#true} {11708#true} #80#return; {11708#true} is VALID [2022-04-15 08:41:40,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:40,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:40,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:40,439 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-15 08:41:40,439 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11708#true} {11708#true} #78#return; {11708#true} is VALID [2022-04-15 08:41:40,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:40,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-15 08:41:40,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-15 08:41:40,440 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-15 08:41:40,440 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-15 08:41:40,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {11708#true} call #t~ret8 := main(); {11708#true} is VALID [2022-04-15 08:41:40,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11708#true} {11708#true} #98#return; {11708#true} is VALID [2022-04-15 08:41:40,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-15 08:41:40,440 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-15 08:41:40,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {11708#true} call ULTIMATE.init(); {11708#true} is VALID [2022-04-15 08:41:40,440 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-15 08:41:40,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:41:40,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044889121] [2022-04-15 08:41:40,441 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:41:40,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722276313] [2022-04-15 08:41:40,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722276313] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:41:40,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:41:40,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-15 08:41:40,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:41:40,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [891189672] [2022-04-15 08:41:40,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [891189672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:41:40,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:41:40,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 08:41:40,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665277688] [2022-04-15 08:41:40,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:41:40,442 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-15 08:41:40,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:41:40,442 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-15 08:41:40,479 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-15 08:41:40,479 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 08:41:40,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:41:40,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 08:41:40,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 08:41:40,480 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-15 08:41:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:41,215 INFO L93 Difference]: Finished difference Result 199 states and 262 transitions. [2022-04-15 08:41:41,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 08:41:41,215 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-15 08:41:41,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:41:41,216 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-15 08:41:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-15 08:41:41,217 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-15 08:41:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-15 08:41:41,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 97 transitions. [2022-04-15 08:41:41,313 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-15 08:41:41,316 INFO L225 Difference]: With dead ends: 199 [2022-04-15 08:41:41,316 INFO L226 Difference]: Without dead ends: 197 [2022-04-15 08:41:41,317 INFO L912 BasicCegarLoop]: 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-15 08:41:41,317 INFO L913 BasicCegarLoop]: 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-15 08:41:41,317 INFO L914 BasicCegarLoop]: 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-15 08:41:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-15 08:41:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2022-04-15 08:41:41,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:41:41,586 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-15 08:41:41,586 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-15 08:41:41,586 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-15 08:41:41,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:41,590 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2022-04-15 08:41:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2022-04-15 08:41:41,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:41:41,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:41:41,591 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-15 08:41:41,591 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-15 08:41:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:41:41,594 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2022-04-15 08:41:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2022-04-15 08:41:41,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:41:41,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:41:41,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:41:41,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:41:41,595 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-15 08:41:41,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 257 transitions. [2022-04-15 08:41:41,599 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 257 transitions. Word has length 73 [2022-04-15 08:41:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:41:41,599 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 257 transitions. [2022-04-15 08:41:41,599 INFO L479 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-15 08:41:41,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 257 transitions. [2022-04-15 08:41:41,879 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-15 08:41:41,879 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 257 transitions. [2022-04-15 08:41:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 08:41:41,880 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:41:41,880 INFO L499 BasicCegarLoop]: 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-15 08:41:41,896 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-15 08:41:42,085 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:41:42,085 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:41:42,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:41:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 5 times [2022-04-15 08:41:42,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:41:42,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [731573151] [2022-04-15 08:41:42,086 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:41:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 6 times [2022-04-15 08:41:42,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:41:42,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527992955] [2022-04-15 08:41:42,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:41:42,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:41:42,095 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:41:42,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1818044887] [2022-04-15 08:41:42,096 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 08:41:42,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:41:42,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:41:42,097 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-15 08:41:42,098 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-15 08:41:42,151 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 08:41:42,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:41:42,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 08:41:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:41:42,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:41:44,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {13339#true} call ULTIMATE.init(); {13339#true} is VALID [2022-04-15 08:41:44,290 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-15 08:41:44,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-15 08:41:44,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13339#true} {13339#true} #98#return; {13339#true} is VALID [2022-04-15 08:41:44,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {13339#true} call #t~ret8 := main(); {13339#true} is VALID [2022-04-15 08:41:44,290 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-15 08:41:44,290 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-15 08:41:44,291 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-15 08:41:44,291 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-15 08:41:44,291 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-15 08:41:44,292 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-15 08:41:44,292 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-15 08:41:44,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-15 08:41:44,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-15 08:41:44,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-15 08:41:44,292 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13339#true} {13376#(<= 1 main_~x~0)} #80#return; {13376#(<= 1 main_~x~0)} is VALID [2022-04-15 08:41:44,293 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-15 08:41:44,293 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-15 08:41:44,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-15 08:41:44,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-15 08:41:44,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-15 08:41:44,294 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-15 08:41:44,294 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-15 08:41:44,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-15 08:41:44,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-15 08:41:44,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-15 08:41:44,295 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-15 08:41:44,295 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-15 08:41:44,296 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-15 08:41:44,296 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-15 08:41:44,296 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-15 08:41:44,297 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-15 08:41:44,297 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-15 08:41:44,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-15 08:41:44,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-15 08:41:44,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-15 08:41:44,298 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-15 08:41:44,298 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-15 08:41:44,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-15 08:41:44,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-15 08:41:44,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-15 08:41:44,299 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-15 08:41:44,299 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-15 08:41:44,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-15 08:41:44,299 INFO L290 TraceCheckUtils]: 44: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-15 08:41:44,299 INFO L290 TraceCheckUtils]: 45: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-15 08:41:44,300 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-15 08:41:44,300 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-15 08:41:44,300 INFO L290 TraceCheckUtils]: 48: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-15 08:41:44,300 INFO L290 TraceCheckUtils]: 49: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-15 08:41:44,300 INFO L290 TraceCheckUtils]: 50: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-15 08:41:44,301 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-15 08:41:44,302 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-15 08:41:44,303 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-15 08:41:44,303 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-15 08:41:44,304 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-15 08:41:44,304 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-15 08:41:44,304 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-15 08:41:44,305 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-15 08:41:44,305 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-15 08:41:44,305 INFO L290 TraceCheckUtils]: 60: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-15 08:41:44,305 INFO L290 TraceCheckUtils]: 61: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-15 08:41:44,305 INFO L290 TraceCheckUtils]: 62: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-15 08:41:44,306 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-15 08:41:44,306 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-15 08:41:44,306 INFO L290 TraceCheckUtils]: 65: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-15 08:41:44,306 INFO L290 TraceCheckUtils]: 66: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-15 08:41:44,306 INFO L290 TraceCheckUtils]: 67: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-15 08:41:44,307 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-15 08:41:44,307 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-15 08:41:44,311 INFO L290 TraceCheckUtils]: 70: Hoare triple {13339#true} ~cond := #in~cond; {13561#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:41:44,311 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-15 08:41:44,312 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-15 08:41:44,312 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-15 08:41:44,313 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-15 08:41:44,314 INFO L290 TraceCheckUtils]: 75: Hoare triple {13575#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13579#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:41:44,314 INFO L290 TraceCheckUtils]: 76: Hoare triple {13579#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13340#false} is VALID [2022-04-15 08:41:44,314 INFO L290 TraceCheckUtils]: 77: Hoare triple {13340#false} assume !false; {13340#false} is VALID [2022-04-15 08:41:44,314 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-15 08:41:44,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:42:30,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:42:30,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527992955] [2022-04-15 08:42:30,818 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:42:30,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818044887] [2022-04-15 08:42:30,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818044887] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 08:42:30,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 08:42:30,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-15 08:42:30,818 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:42:30,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [731573151] [2022-04-15 08:42:30,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [731573151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:42:30,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:42:30,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 08:42:30,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600074917] [2022-04-15 08:42:30,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:42:30,819 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-15 08:42:30,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:42:30,819 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-15 08:42:30,866 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-15 08:42:30,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 08:42:30,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:42:30,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 08:42:30,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-04-15 08:42:30,867 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-15 08:42:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:42:36,451 INFO L93 Difference]: Finished difference Result 203 states and 265 transitions. [2022-04-15 08:42:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 08:42:36,452 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-15 08:42:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:42:36,452 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-15 08:42:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-15 08:42:36,453 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-15 08:42:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-15 08:42:36,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 97 transitions. [2022-04-15 08:42:36,548 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-15 08:42:36,551 INFO L225 Difference]: With dead ends: 203 [2022-04-15 08:42:36,552 INFO L226 Difference]: Without dead ends: 201 [2022-04-15 08:42:36,552 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-04-15 08:42:36,552 INFO L913 BasicCegarLoop]: 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-15 08:42:36,552 INFO L914 BasicCegarLoop]: 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-15 08:42:36,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-15 08:42:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2022-04-15 08:42:36,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:42:36,858 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-15 08:42:36,858 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-15 08:42:36,858 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-15 08:42:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:42:36,862 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2022-04-15 08:42:36,862 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2022-04-15 08:42:36,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:42:36,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:42:36,863 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-15 08:42:36,863 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-15 08:42:36,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:42:36,866 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2022-04-15 08:42:36,866 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2022-04-15 08:42:36,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:42:36,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:42:36,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:42:36,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:42:36,867 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-15 08:42:36,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 260 transitions. [2022-04-15 08:42:36,871 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 260 transitions. Word has length 78 [2022-04-15 08:42:36,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:42:36,871 INFO L478 AbstractCegarLoop]: Abstraction has 198 states and 260 transitions. [2022-04-15 08:42:36,871 INFO L479 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-15 08:42:36,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 198 states and 260 transitions. [2022-04-15 08:42:37,172 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-15 08:42:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 260 transitions. [2022-04-15 08:42:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 08:42:37,179 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:42:37,179 INFO L499 BasicCegarLoop]: 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-15 08:42:37,197 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-15 08:42:37,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 08:42:37,395 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:42:37,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:42:37,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1849570232, now seen corresponding path program 3 times [2022-04-15 08:42:37,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:42:37,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [555453221] [2022-04-15 08:42:37,396 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:42:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1849570232, now seen corresponding path program 4 times [2022-04-15 08:42:37,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:42:37,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351374079] [2022-04-15 08:42:37,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:42:37,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:42:37,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:42:37,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [613200627] [2022-04-15 08:42:37,405 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 08:42:37,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:42:37,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:42:37,406 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-15 08:42:37,406 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-15 08:42:37,448 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 08:42:37,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:42:37,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 08:42:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:42:37,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:42:38,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {14816#true} call ULTIMATE.init(); {14816#true} is VALID [2022-04-15 08:42:38,642 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-15 08:42:38,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:38,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14816#true} {14816#true} #98#return; {14816#true} is VALID [2022-04-15 08:42:38,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {14816#true} call #t~ret8 := main(); {14816#true} is VALID [2022-04-15 08:42:38,642 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-15 08:42:38,642 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-15 08:42:38,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:38,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:38,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:38,643 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14816#true} {14816#true} #78#return; {14816#true} is VALID [2022-04-15 08:42:38,643 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-15 08:42:38,643 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-15 08:42:38,643 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-15 08:42:38,644 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-15 08:42:38,644 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-15 08:42:38,644 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-15 08:42:38,644 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-15 08:42:38,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:38,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:38,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:38,659 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14816#true} {14872#(<= 1 main_~b~0)} #82#return; {14872#(<= 1 main_~b~0)} is VALID [2022-04-15 08:42:38,659 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-15 08:42:38,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:38,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:38,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:38,660 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14816#true} {14872#(<= 1 main_~b~0)} #84#return; {14872#(<= 1 main_~b~0)} is VALID [2022-04-15 08:42:38,660 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-15 08:42:38,660 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-15 08:42:38,661 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-15 08:42:38,661 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-15 08:42:38,661 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-15 08:42:38,662 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-15 08:42:38,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:38,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:38,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:38,662 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-15 08:42:38,662 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-15 08:42:38,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:38,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:38,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:38,663 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-15 08:42:38,663 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-15 08:42:38,663 INFO L290 TraceCheckUtils]: 43: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:38,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:38,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:38,664 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-15 08:42:38,664 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-15 08:42:38,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:38,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:38,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:38,665 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-15 08:42:38,665 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-15 08:42:38,666 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-15 08:42:38,666 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-15 08:42:38,666 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-15 08:42:38,667 INFO L290 TraceCheckUtils]: 56: Hoare triple {14816#true} ~cond := #in~cond; {14995#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:42:38,667 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-15 08:42:38,667 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-15 08:42:38,668 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-15 08:42:38,668 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-15 08:42:38,668 INFO L290 TraceCheckUtils]: 61: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:38,668 INFO L290 TraceCheckUtils]: 62: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:38,668 INFO L290 TraceCheckUtils]: 63: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:38,669 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-15 08:42:38,669 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-15 08:42:38,669 INFO L290 TraceCheckUtils]: 66: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:38,669 INFO L290 TraceCheckUtils]: 67: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:38,669 INFO L290 TraceCheckUtils]: 68: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:38,669 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-15 08:42:38,669 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-15 08:42:38,670 INFO L290 TraceCheckUtils]: 71: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:38,670 INFO L290 TraceCheckUtils]: 72: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:38,670 INFO L290 TraceCheckUtils]: 73: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:38,670 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-15 08:42:38,672 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-15 08:42:38,672 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-15 08:42:38,673 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-15 08:42:38,674 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#(exists ((v_main_~k~0_BEFORE_CALL_31 Int) (v_main_~b~0_BEFORE_CALL_59 Int)) (and (<= 2 v_main_~k~0_BEFORE_CALL_31) (<= (* v_main_~k~0_BEFORE_CALL_31 v_main_~b~0_BEFORE_CALL_59) (* 2 v_main_~b~0_BEFORE_CALL_59)) (<= 1 v_main_~b~0_BEFORE_CALL_59) (<= 1 |__VERIFIER_assert_#in~cond|)))} is VALID [2022-04-15 08:42:38,675 INFO L290 TraceCheckUtils]: 79: Hoare triple {15065#(exists ((v_main_~k~0_BEFORE_CALL_31 Int) (v_main_~b~0_BEFORE_CALL_59 Int)) (and (<= 2 v_main_~k~0_BEFORE_CALL_31) (<= (* v_main_~k~0_BEFORE_CALL_31 v_main_~b~0_BEFORE_CALL_59) (* 2 v_main_~b~0_BEFORE_CALL_59)) (<= 1 v_main_~b~0_BEFORE_CALL_59) (<= 1 |__VERIFIER_assert_#in~cond|)))} ~cond := #in~cond; {15069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:42:38,675 INFO L290 TraceCheckUtils]: 80: Hoare triple {15069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14817#false} is VALID [2022-04-15 08:42:38,675 INFO L290 TraceCheckUtils]: 81: Hoare triple {14817#false} assume !false; {14817#false} is VALID [2022-04-15 08:42:38,675 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-15 08:42:38,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:42:46,630 INFO L290 TraceCheckUtils]: 81: Hoare triple {14817#false} assume !false; {14817#false} is VALID [2022-04-15 08:42:46,631 INFO L290 TraceCheckUtils]: 80: Hoare triple {15069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14817#false} is VALID [2022-04-15 08:42:46,631 INFO L290 TraceCheckUtils]: 79: Hoare triple {15082#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:42:46,632 INFO L272 TraceCheckUtils]: 78: Hoare triple {15086#(= 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)); {15082#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:42:46,632 INFO L290 TraceCheckUtils]: 77: Hoare triple {15086#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {15086#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:42:46,632 INFO L290 TraceCheckUtils]: 76: Hoare triple {15086#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15086#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:42:46,661 INFO L290 TraceCheckUtils]: 75: Hoare triple {15086#(= 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; {15086#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:42:46,662 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14816#true} {15086#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {15086#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:42:46,662 INFO L290 TraceCheckUtils]: 73: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:46,662 INFO L290 TraceCheckUtils]: 72: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:46,662 INFO L290 TraceCheckUtils]: 71: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:46,662 INFO L272 TraceCheckUtils]: 70: Hoare triple {15086#(= 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-15 08:42:46,662 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14816#true} {15086#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {15086#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:42:46,663 INFO L290 TraceCheckUtils]: 68: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:46,663 INFO L290 TraceCheckUtils]: 67: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:46,663 INFO L290 TraceCheckUtils]: 66: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:46,663 INFO L272 TraceCheckUtils]: 65: Hoare triple {15086#(= 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-15 08:42:46,663 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14816#true} {15086#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {15086#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:42:46,663 INFO L290 TraceCheckUtils]: 63: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:46,663 INFO L290 TraceCheckUtils]: 62: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:46,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:46,664 INFO L272 TraceCheckUtils]: 60: Hoare triple {15086#(= 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-15 08:42:46,664 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} {14816#true} #86#return; {15086#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:42:46,664 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-15 08:42:46,665 INFO L290 TraceCheckUtils]: 57: Hoare triple {15153#(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-15 08:42:46,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {14816#true} ~cond := #in~cond; {15153#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 08:42:46,665 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-15 08:42:46,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {14816#true} assume !!(#t~post7 < 10);havoc #t~post7; {14816#true} is VALID [2022-04-15 08:42:46,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {14816#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14816#true} is VALID [2022-04-15 08:42:46,665 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-15 08:42:46,665 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14816#true} {14816#true} #92#return; {14816#true} is VALID [2022-04-15 08:42:46,666 INFO L290 TraceCheckUtils]: 50: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:46,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:46,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:46,666 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-15 08:42:46,666 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14816#true} {14816#true} #90#return; {14816#true} is VALID [2022-04-15 08:42:46,666 INFO L290 TraceCheckUtils]: 45: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:46,666 INFO L290 TraceCheckUtils]: 44: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:46,666 INFO L290 TraceCheckUtils]: 43: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:46,666 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-15 08:42:46,666 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14816#true} {14816#true} #88#return; {14816#true} is VALID [2022-04-15 08:42:46,666 INFO L290 TraceCheckUtils]: 40: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:46,666 INFO L290 TraceCheckUtils]: 39: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:46,666 INFO L290 TraceCheckUtils]: 38: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:46,666 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-15 08:42:46,667 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14816#true} {14816#true} #86#return; {14816#true} is VALID [2022-04-15 08:42:46,667 INFO L290 TraceCheckUtils]: 35: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:46,667 INFO L290 TraceCheckUtils]: 34: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:46,667 INFO L290 TraceCheckUtils]: 33: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:46,667 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-15 08:42:46,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {14816#true} assume !!(#t~post7 < 10);havoc #t~post7; {14816#true} is VALID [2022-04-15 08:42:46,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {14816#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14816#true} is VALID [2022-04-15 08:42:46,667 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-15 08:42:46,667 INFO L290 TraceCheckUtils]: 28: Hoare triple {14816#true} assume !!(#t~post6 < 10);havoc #t~post6; {14816#true} is VALID [2022-04-15 08:42:46,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {14816#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14816#true} is VALID [2022-04-15 08:42:46,667 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14816#true} {14816#true} #84#return; {14816#true} is VALID [2022-04-15 08:42:46,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:46,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:46,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:46,668 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-15 08:42:46,668 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14816#true} {14816#true} #82#return; {14816#true} is VALID [2022-04-15 08:42:46,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:46,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:46,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:46,668 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-15 08:42:46,668 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-15 08:42:46,668 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14816#true} {14816#true} #80#return; {14816#true} is VALID [2022-04-15 08:42:46,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:46,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:46,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:46,668 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-15 08:42:46,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14816#true} {14816#true} #78#return; {14816#true} is VALID [2022-04-15 08:42:46,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:46,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-15 08:42:46,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-15 08:42:46,669 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-15 08:42:46,669 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-15 08:42:46,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {14816#true} call #t~ret8 := main(); {14816#true} is VALID [2022-04-15 08:42:46,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14816#true} {14816#true} #98#return; {14816#true} is VALID [2022-04-15 08:42:46,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-15 08:42:46,669 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-15 08:42:46,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {14816#true} call ULTIMATE.init(); {14816#true} is VALID [2022-04-15 08:42:46,669 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-15 08:42:46,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:42:46,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351374079] [2022-04-15 08:42:46,670 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:42:46,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613200627] [2022-04-15 08:42:46,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613200627] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:42:46,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:42:46,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 17 [2022-04-15 08:42:46,670 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:42:46,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [555453221] [2022-04-15 08:42:46,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [555453221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:42:46,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:42:46,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 08:42:46,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313929515] [2022-04-15 08:42:46,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:42:46,671 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-15 08:42:46,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:42:46,671 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-15 08:42:46,724 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-15 08:42:46,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 08:42:46,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:42:46,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 08:42:46,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-15 08:42:46,725 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-15 08:42:50,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:42:50,261 INFO L93 Difference]: Finished difference Result 212 states and 278 transitions. [2022-04-15 08:42:50,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 08:42:50,261 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-15 08:42:50,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:42:50,261 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-15 08:42:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-04-15 08:42:50,262 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-15 08:42:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-04-15 08:42:50,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 106 transitions. [2022-04-15 08:42:50,364 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-15 08:42:50,368 INFO L225 Difference]: With dead ends: 212 [2022-04-15 08:42:50,368 INFO L226 Difference]: Without dead ends: 210 [2022-04-15 08:42:50,368 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 146 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2022-04-15 08:42:50,368 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 50 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 08:42:50,369 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 277 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 435 Invalid, 0 Unknown, 60 Unchecked, 1.2s Time] [2022-04-15 08:42:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-15 08:42:50,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 203. [2022-04-15 08:42:50,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:42:50,699 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-15 08:42:50,700 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-15 08:42:50,700 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-15 08:42:50,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:42:50,704 INFO L93 Difference]: Finished difference Result 210 states and 276 transitions. [2022-04-15 08:42:50,704 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2022-04-15 08:42:50,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:42:50,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:42:50,704 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-15 08:42:50,705 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-15 08:42:50,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:42:50,708 INFO L93 Difference]: Finished difference Result 210 states and 276 transitions. [2022-04-15 08:42:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2022-04-15 08:42:50,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:42:50,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:42:50,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:42:50,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:42:50,709 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-15 08:42:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 265 transitions. [2022-04-15 08:42:50,712 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 265 transitions. Word has length 82 [2022-04-15 08:42:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:42:50,713 INFO L478 AbstractCegarLoop]: Abstraction has 203 states and 265 transitions. [2022-04-15 08:42:50,713 INFO L479 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-15 08:42:50,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 203 states and 265 transitions. [2022-04-15 08:42:51,030 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-15 08:42:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 265 transitions. [2022-04-15 08:42:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 08:42:51,030 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:42:51,031 INFO L499 BasicCegarLoop]: 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-15 08:42:51,061 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-15 08:42:51,231 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 08:42:51,231 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:42:51,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:42:51,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1768368813, now seen corresponding path program 1 times [2022-04-15 08:42:51,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:42:51,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1138603296] [2022-04-15 08:42:51,232 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:42:51,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1768368813, now seen corresponding path program 2 times [2022-04-15 08:42:51,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:42:51,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441478709] [2022-04-15 08:42:51,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:42:51,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:42:51,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:42:51,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [707547617] [2022-04-15 08:42:51,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:42:51,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:42:51,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:42:51,246 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-15 08:42:51,246 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-15 08:42:51,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:42:51,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:42:51,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 08:42:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:42:51,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:42:51,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {16589#true} call ULTIMATE.init(); {16589#true} is VALID [2022-04-15 08:42:51,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {16589#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; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {16597#(<= ~counter~0 0)} assume true; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16597#(<= ~counter~0 0)} {16589#true} #98#return; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {16597#(<= ~counter~0 0)} call #t~ret8 := main(); {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {16597#(<= ~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; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,571 INFO L272 TraceCheckUtils]: 6: Hoare triple {16597#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {16597#(<= ~counter~0 0)} ~cond := #in~cond; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {16597#(<= ~counter~0 0)} assume !(0 == ~cond); {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {16597#(<= ~counter~0 0)} assume true; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,573 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16597#(<= ~counter~0 0)} {16597#(<= ~counter~0 0)} #78#return; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,573 INFO L272 TraceCheckUtils]: 11: Hoare triple {16597#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {16597#(<= ~counter~0 0)} ~cond := #in~cond; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {16597#(<= ~counter~0 0)} assume !(0 == ~cond); {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {16597#(<= ~counter~0 0)} assume true; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,574 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16597#(<= ~counter~0 0)} {16597#(<= ~counter~0 0)} #80#return; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {16597#(<= ~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; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,575 INFO L272 TraceCheckUtils]: 17: Hoare triple {16597#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {16597#(<= ~counter~0 0)} ~cond := #in~cond; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {16597#(<= ~counter~0 0)} assume !(0 == ~cond); {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {16597#(<= ~counter~0 0)} assume true; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,576 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16597#(<= ~counter~0 0)} {16597#(<= ~counter~0 0)} #82#return; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,576 INFO L272 TraceCheckUtils]: 22: Hoare triple {16597#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {16597#(<= ~counter~0 0)} ~cond := #in~cond; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {16597#(<= ~counter~0 0)} assume !(0 == ~cond); {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {16597#(<= ~counter~0 0)} assume true; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,578 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16597#(<= ~counter~0 0)} {16597#(<= ~counter~0 0)} #84#return; {16597#(<= ~counter~0 0)} is VALID [2022-04-15 08:42:51,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {16597#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16676#(<= ~counter~0 1)} is VALID [2022-04-15 08:42:51,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {16676#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {16676#(<= ~counter~0 1)} is VALID [2022-04-15 08:42:51,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {16676#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16676#(<= ~counter~0 1)} is VALID [2022-04-15 08:42:51,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {16676#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {16686#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,580 INFO L272 TraceCheckUtils]: 32: Hoare triple {16686#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {16686#(<= ~counter~0 2)} ~cond := #in~cond; {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,580 INFO L290 TraceCheckUtils]: 34: Hoare triple {16686#(<= ~counter~0 2)} assume !(0 == ~cond); {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {16686#(<= ~counter~0 2)} assume true; {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,581 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16686#(<= ~counter~0 2)} {16686#(<= ~counter~0 2)} #86#return; {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,582 INFO L272 TraceCheckUtils]: 37: Hoare triple {16686#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {16686#(<= ~counter~0 2)} ~cond := #in~cond; {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {16686#(<= ~counter~0 2)} assume !(0 == ~cond); {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {16686#(<= ~counter~0 2)} assume true; {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,583 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16686#(<= ~counter~0 2)} {16686#(<= ~counter~0 2)} #88#return; {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,584 INFO L272 TraceCheckUtils]: 42: Hoare triple {16686#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,584 INFO L290 TraceCheckUtils]: 43: Hoare triple {16686#(<= ~counter~0 2)} ~cond := #in~cond; {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,584 INFO L290 TraceCheckUtils]: 44: Hoare triple {16686#(<= ~counter~0 2)} assume !(0 == ~cond); {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,584 INFO L290 TraceCheckUtils]: 45: Hoare triple {16686#(<= ~counter~0 2)} assume true; {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,585 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16686#(<= ~counter~0 2)} {16686#(<= ~counter~0 2)} #90#return; {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,585 INFO L272 TraceCheckUtils]: 47: Hoare triple {16686#(<= ~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)); {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {16686#(<= ~counter~0 2)} ~cond := #in~cond; {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {16686#(<= ~counter~0 2)} assume !(0 == ~cond); {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,586 INFO L290 TraceCheckUtils]: 50: Hoare triple {16686#(<= ~counter~0 2)} assume true; {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,587 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16686#(<= ~counter~0 2)} {16686#(<= ~counter~0 2)} #92#return; {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {16686#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16686#(<= ~counter~0 2)} is VALID [2022-04-15 08:42:51,588 INFO L290 TraceCheckUtils]: 53: Hoare triple {16686#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,588 INFO L290 TraceCheckUtils]: 54: Hoare triple {16756#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,588 INFO L272 TraceCheckUtils]: 55: Hoare triple {16756#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,589 INFO L290 TraceCheckUtils]: 56: Hoare triple {16756#(<= ~counter~0 3)} ~cond := #in~cond; {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {16756#(<= ~counter~0 3)} assume !(0 == ~cond); {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,589 INFO L290 TraceCheckUtils]: 58: Hoare triple {16756#(<= ~counter~0 3)} assume true; {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,590 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16756#(<= ~counter~0 3)} {16756#(<= ~counter~0 3)} #86#return; {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,590 INFO L272 TraceCheckUtils]: 60: Hoare triple {16756#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,591 INFO L290 TraceCheckUtils]: 61: Hoare triple {16756#(<= ~counter~0 3)} ~cond := #in~cond; {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,591 INFO L290 TraceCheckUtils]: 62: Hoare triple {16756#(<= ~counter~0 3)} assume !(0 == ~cond); {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,591 INFO L290 TraceCheckUtils]: 63: Hoare triple {16756#(<= ~counter~0 3)} assume true; {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,592 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16756#(<= ~counter~0 3)} {16756#(<= ~counter~0 3)} #88#return; {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,592 INFO L272 TraceCheckUtils]: 65: Hoare triple {16756#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,592 INFO L290 TraceCheckUtils]: 66: Hoare triple {16756#(<= ~counter~0 3)} ~cond := #in~cond; {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,593 INFO L290 TraceCheckUtils]: 67: Hoare triple {16756#(<= ~counter~0 3)} assume !(0 == ~cond); {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,593 INFO L290 TraceCheckUtils]: 68: Hoare triple {16756#(<= ~counter~0 3)} assume true; {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,593 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16756#(<= ~counter~0 3)} {16756#(<= ~counter~0 3)} #90#return; {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,594 INFO L272 TraceCheckUtils]: 70: Hoare triple {16756#(<= ~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)); {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,594 INFO L290 TraceCheckUtils]: 71: Hoare triple {16756#(<= ~counter~0 3)} ~cond := #in~cond; {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,595 INFO L290 TraceCheckUtils]: 72: Hoare triple {16756#(<= ~counter~0 3)} assume !(0 == ~cond); {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,595 INFO L290 TraceCheckUtils]: 73: Hoare triple {16756#(<= ~counter~0 3)} assume true; {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,595 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16756#(<= ~counter~0 3)} {16756#(<= ~counter~0 3)} #92#return; {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,596 INFO L290 TraceCheckUtils]: 75: Hoare triple {16756#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,596 INFO L290 TraceCheckUtils]: 76: Hoare triple {16756#(<= ~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; {16756#(<= ~counter~0 3)} is VALID [2022-04-15 08:42:51,596 INFO L290 TraceCheckUtils]: 77: Hoare triple {16756#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16829#(<= |main_#t~post6| 3)} is VALID [2022-04-15 08:42:51,597 INFO L290 TraceCheckUtils]: 78: Hoare triple {16829#(<= |main_#t~post6| 3)} assume !(#t~post6 < 10);havoc #t~post6; {16590#false} is VALID [2022-04-15 08:42:51,597 INFO L272 TraceCheckUtils]: 79: Hoare triple {16590#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {16590#false} is VALID [2022-04-15 08:42:51,597 INFO L290 TraceCheckUtils]: 80: Hoare triple {16590#false} ~cond := #in~cond; {16590#false} is VALID [2022-04-15 08:42:51,597 INFO L290 TraceCheckUtils]: 81: Hoare triple {16590#false} assume 0 == ~cond; {16590#false} is VALID [2022-04-15 08:42:51,597 INFO L290 TraceCheckUtils]: 82: Hoare triple {16590#false} assume !false; {16590#false} is VALID [2022-04-15 08:42:51,597 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-15 08:42:51,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:42:51,899 INFO L290 TraceCheckUtils]: 82: Hoare triple {16590#false} assume !false; {16590#false} is VALID [2022-04-15 08:42:51,899 INFO L290 TraceCheckUtils]: 81: Hoare triple {16590#false} assume 0 == ~cond; {16590#false} is VALID [2022-04-15 08:42:51,899 INFO L290 TraceCheckUtils]: 80: Hoare triple {16590#false} ~cond := #in~cond; {16590#false} is VALID [2022-04-15 08:42:51,899 INFO L272 TraceCheckUtils]: 79: Hoare triple {16590#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {16590#false} is VALID [2022-04-15 08:42:51,900 INFO L290 TraceCheckUtils]: 78: Hoare triple {16857#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {16590#false} is VALID [2022-04-15 08:42:51,900 INFO L290 TraceCheckUtils]: 77: Hoare triple {16861#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16857#(< |main_#t~post6| 10)} is VALID [2022-04-15 08:42:51,900 INFO L290 TraceCheckUtils]: 76: Hoare triple {16861#(< ~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; {16861#(< ~counter~0 10)} is VALID [2022-04-15 08:42:51,901 INFO L290 TraceCheckUtils]: 75: Hoare triple {16861#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {16861#(< ~counter~0 10)} is VALID [2022-04-15 08:42:51,901 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16589#true} {16861#(< ~counter~0 10)} #92#return; {16861#(< ~counter~0 10)} is VALID [2022-04-15 08:42:51,901 INFO L290 TraceCheckUtils]: 73: Hoare triple {16589#true} assume true; {16589#true} is VALID [2022-04-15 08:42:51,901 INFO L290 TraceCheckUtils]: 72: Hoare triple {16589#true} assume !(0 == ~cond); {16589#true} is VALID [2022-04-15 08:42:51,902 INFO L290 TraceCheckUtils]: 71: Hoare triple {16589#true} ~cond := #in~cond; {16589#true} is VALID [2022-04-15 08:42:51,902 INFO L272 TraceCheckUtils]: 70: Hoare triple {16861#(< ~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)); {16589#true} is VALID [2022-04-15 08:42:51,902 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16589#true} {16861#(< ~counter~0 10)} #90#return; {16861#(< ~counter~0 10)} is VALID [2022-04-15 08:42:51,902 INFO L290 TraceCheckUtils]: 68: Hoare triple {16589#true} assume true; {16589#true} is VALID [2022-04-15 08:42:51,902 INFO L290 TraceCheckUtils]: 67: Hoare triple {16589#true} assume !(0 == ~cond); {16589#true} is VALID [2022-04-15 08:42:51,902 INFO L290 TraceCheckUtils]: 66: Hoare triple {16589#true} ~cond := #in~cond; {16589#true} is VALID [2022-04-15 08:42:51,902 INFO L272 TraceCheckUtils]: 65: Hoare triple {16861#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16589#true} is VALID [2022-04-15 08:42:51,903 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16589#true} {16861#(< ~counter~0 10)} #88#return; {16861#(< ~counter~0 10)} is VALID [2022-04-15 08:42:51,903 INFO L290 TraceCheckUtils]: 63: Hoare triple {16589#true} assume true; {16589#true} is VALID [2022-04-15 08:42:51,903 INFO L290 TraceCheckUtils]: 62: Hoare triple {16589#true} assume !(0 == ~cond); {16589#true} is VALID [2022-04-15 08:42:51,903 INFO L290 TraceCheckUtils]: 61: Hoare triple {16589#true} ~cond := #in~cond; {16589#true} is VALID [2022-04-15 08:42:51,903 INFO L272 TraceCheckUtils]: 60: Hoare triple {16861#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16589#true} is VALID [2022-04-15 08:42:51,904 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16589#true} {16861#(< ~counter~0 10)} #86#return; {16861#(< ~counter~0 10)} is VALID [2022-04-15 08:42:51,904 INFO L290 TraceCheckUtils]: 58: Hoare triple {16589#true} assume true; {16589#true} is VALID [2022-04-15 08:42:51,904 INFO L290 TraceCheckUtils]: 57: Hoare triple {16589#true} assume !(0 == ~cond); {16589#true} is VALID [2022-04-15 08:42:51,904 INFO L290 TraceCheckUtils]: 56: Hoare triple {16589#true} ~cond := #in~cond; {16589#true} is VALID [2022-04-15 08:42:51,904 INFO L272 TraceCheckUtils]: 55: Hoare triple {16861#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16589#true} is VALID [2022-04-15 08:42:51,905 INFO L290 TraceCheckUtils]: 54: Hoare triple {16861#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {16861#(< ~counter~0 10)} is VALID [2022-04-15 08:42:51,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {16934#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16861#(< ~counter~0 10)} is VALID [2022-04-15 08:42:51,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {16934#(< ~counter~0 9)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16934#(< ~counter~0 9)} is VALID [2022-04-15 08:42:51,907 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16589#true} {16934#(< ~counter~0 9)} #92#return; {16934#(< ~counter~0 9)} is VALID [2022-04-15 08:42:51,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {16589#true} assume true; {16589#true} is VALID [2022-04-15 08:42:51,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {16589#true} assume !(0 == ~cond); {16589#true} is VALID [2022-04-15 08:42:51,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {16589#true} ~cond := #in~cond; {16589#true} is VALID [2022-04-15 08:42:51,907 INFO L272 TraceCheckUtils]: 47: Hoare triple {16934#(< ~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)); {16589#true} is VALID [2022-04-15 08:42:51,907 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16589#true} {16934#(< ~counter~0 9)} #90#return; {16934#(< ~counter~0 9)} is VALID [2022-04-15 08:42:51,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {16589#true} assume true; {16589#true} is VALID [2022-04-15 08:42:51,908 INFO L290 TraceCheckUtils]: 44: Hoare triple {16589#true} assume !(0 == ~cond); {16589#true} is VALID [2022-04-15 08:42:51,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {16589#true} ~cond := #in~cond; {16589#true} is VALID [2022-04-15 08:42:51,908 INFO L272 TraceCheckUtils]: 42: Hoare triple {16934#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16589#true} is VALID [2022-04-15 08:42:51,908 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16589#true} {16934#(< ~counter~0 9)} #88#return; {16934#(< ~counter~0 9)} is VALID [2022-04-15 08:42:51,909 INFO L290 TraceCheckUtils]: 40: Hoare triple {16589#true} assume true; {16589#true} is VALID [2022-04-15 08:42:51,909 INFO L290 TraceCheckUtils]: 39: Hoare triple {16589#true} assume !(0 == ~cond); {16589#true} is VALID [2022-04-15 08:42:51,909 INFO L290 TraceCheckUtils]: 38: Hoare triple {16589#true} ~cond := #in~cond; {16589#true} is VALID [2022-04-15 08:42:51,909 INFO L272 TraceCheckUtils]: 37: Hoare triple {16934#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16589#true} is VALID [2022-04-15 08:42:51,909 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16589#true} {16934#(< ~counter~0 9)} #86#return; {16934#(< ~counter~0 9)} is VALID [2022-04-15 08:42:51,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {16589#true} assume true; {16589#true} is VALID [2022-04-15 08:42:51,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {16589#true} assume !(0 == ~cond); {16589#true} is VALID [2022-04-15 08:42:51,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {16589#true} ~cond := #in~cond; {16589#true} is VALID [2022-04-15 08:42:51,910 INFO L272 TraceCheckUtils]: 32: Hoare triple {16934#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16589#true} is VALID [2022-04-15 08:42:51,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {16934#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {16934#(< ~counter~0 9)} is VALID [2022-04-15 08:42:51,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {17004#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16934#(< ~counter~0 9)} is VALID [2022-04-15 08:42:51,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {17004#(< ~counter~0 8)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {17004#(< ~counter~0 8)} is VALID [2022-04-15 08:42:51,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {17004#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {17004#(< ~counter~0 8)} is VALID [2022-04-15 08:42:51,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {17014#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17004#(< ~counter~0 8)} is VALID [2022-04-15 08:42:51,912 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16589#true} {17014#(< ~counter~0 7)} #84#return; {17014#(< ~counter~0 7)} is VALID [2022-04-15 08:42:51,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {16589#true} assume true; {16589#true} is VALID [2022-04-15 08:42:51,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {16589#true} assume !(0 == ~cond); {16589#true} is VALID [2022-04-15 08:42:51,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {16589#true} ~cond := #in~cond; {16589#true} is VALID [2022-04-15 08:42:51,912 INFO L272 TraceCheckUtils]: 22: Hoare triple {17014#(< ~counter~0 7)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16589#true} is VALID [2022-04-15 08:42:51,913 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16589#true} {17014#(< ~counter~0 7)} #82#return; {17014#(< ~counter~0 7)} is VALID [2022-04-15 08:42:51,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {16589#true} assume true; {16589#true} is VALID [2022-04-15 08:42:51,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {16589#true} assume !(0 == ~cond); {16589#true} is VALID [2022-04-15 08:42:51,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {16589#true} ~cond := #in~cond; {16589#true} is VALID [2022-04-15 08:42:51,913 INFO L272 TraceCheckUtils]: 17: Hoare triple {17014#(< ~counter~0 7)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16589#true} is VALID [2022-04-15 08:42:51,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {17014#(< ~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; {17014#(< ~counter~0 7)} is VALID [2022-04-15 08:42:51,913 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16589#true} {17014#(< ~counter~0 7)} #80#return; {17014#(< ~counter~0 7)} is VALID [2022-04-15 08:42:51,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {16589#true} assume true; {16589#true} is VALID [2022-04-15 08:42:51,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {16589#true} assume !(0 == ~cond); {16589#true} is VALID [2022-04-15 08:42:51,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {16589#true} ~cond := #in~cond; {16589#true} is VALID [2022-04-15 08:42:51,914 INFO L272 TraceCheckUtils]: 11: Hoare triple {17014#(< ~counter~0 7)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16589#true} is VALID [2022-04-15 08:42:51,914 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16589#true} {17014#(< ~counter~0 7)} #78#return; {17014#(< ~counter~0 7)} is VALID [2022-04-15 08:42:51,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {16589#true} assume true; {16589#true} is VALID [2022-04-15 08:42:51,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {16589#true} assume !(0 == ~cond); {16589#true} is VALID [2022-04-15 08:42:51,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {16589#true} ~cond := #in~cond; {16589#true} is VALID [2022-04-15 08:42:51,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {17014#(< ~counter~0 7)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16589#true} is VALID [2022-04-15 08:42:51,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {17014#(< ~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; {17014#(< ~counter~0 7)} is VALID [2022-04-15 08:42:51,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {17014#(< ~counter~0 7)} call #t~ret8 := main(); {17014#(< ~counter~0 7)} is VALID [2022-04-15 08:42:51,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17014#(< ~counter~0 7)} {16589#true} #98#return; {17014#(< ~counter~0 7)} is VALID [2022-04-15 08:42:51,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {17014#(< ~counter~0 7)} assume true; {17014#(< ~counter~0 7)} is VALID [2022-04-15 08:42:51,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {16589#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; {17014#(< ~counter~0 7)} is VALID [2022-04-15 08:42:51,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {16589#true} call ULTIMATE.init(); {16589#true} is VALID [2022-04-15 08:42:51,916 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-15 08:42:51,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:42:51,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441478709] [2022-04-15 08:42:51,917 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:42:51,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707547617] [2022-04-15 08:42:51,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707547617] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:42:51,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:42:51,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 08:42:51,917 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:42:51,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1138603296] [2022-04-15 08:42:51,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1138603296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:42:51,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:42:51,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 08:42:51,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133819489] [2022-04-15 08:42:51,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:42:51,918 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-15 08:42:51,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:42:51,918 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-15 08:42:51,956 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-15 08:42:51,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 08:42:51,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:42:51,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 08:42:51,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 08:42:51,957 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-15 08:42:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:42:52,456 INFO L93 Difference]: Finished difference Result 214 states and 277 transitions. [2022-04-15 08:42:52,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 08:42:52,456 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-15 08:42:52,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:42:52,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-15 08:42:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 08:42:52,457 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-15 08:42:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 08:42:52,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-15 08:42:52,527 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-15 08:42:52,530 INFO L225 Difference]: With dead ends: 214 [2022-04-15 08:42:52,530 INFO L226 Difference]: Without dead ends: 206 [2022-04-15 08:42:52,531 INFO L912 BasicCegarLoop]: 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-15 08:42:52,532 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 12 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:42:52,532 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 167 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:42:52,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-15 08:42:52,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-04-15 08:42:52,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:42:52,830 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-15 08:42:52,830 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-15 08:42:52,830 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-15 08:42:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:42:52,833 INFO L93 Difference]: Finished difference Result 206 states and 268 transitions. [2022-04-15 08:42:52,833 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-15 08:42:52,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:42:52,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:42:52,834 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-15 08:42:52,834 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-15 08:42:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:42:52,837 INFO L93 Difference]: Finished difference Result 206 states and 268 transitions. [2022-04-15 08:42:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-15 08:42:52,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:42:52,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:42:52,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:42:52,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:42:52,839 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-15 08:42:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 268 transitions. [2022-04-15 08:42:52,843 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 268 transitions. Word has length 83 [2022-04-15 08:42:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:42:52,843 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 268 transitions. [2022-04-15 08:42:52,843 INFO L479 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-15 08:42:52,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 206 states and 268 transitions. [2022-04-15 08:42:53,174 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-15 08:42:53,174 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-15 08:42:53,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 08:42:53,175 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:42:53,175 INFO L499 BasicCegarLoop]: 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-15 08:42:53,190 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-15 08:42:53,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 08:42:53,375 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:42:53,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:42:53,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 1 times [2022-04-15 08:42:53,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:42:53,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1734239555] [2022-04-15 08:42:53,376 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:42:53,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 2 times [2022-04-15 08:42:53,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:42:53,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685663898] [2022-04-15 08:42:53,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:42:53,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:42:53,386 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:42:53,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1646104858] [2022-04-15 08:42:53,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:42:53,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:42:53,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:42:53,387 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-15 08:42:53,388 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-15 08:42:53,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:42:53,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:42:53,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 08:42:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:42:53,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:42:54,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {18354#true} call ULTIMATE.init(); {18354#true} is VALID [2022-04-15 08:42:54,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {18354#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; {18354#true} is VALID [2022-04-15 08:42:54,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:54,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18354#true} {18354#true} #98#return; {18354#true} is VALID [2022-04-15 08:42:54,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {18354#true} call #t~ret8 := main(); {18354#true} is VALID [2022-04-15 08:42:54,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {18354#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; {18354#true} is VALID [2022-04-15 08:42:54,083 INFO L272 TraceCheckUtils]: 6: Hoare triple {18354#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18354#true} is VALID [2022-04-15 08:42:54,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:54,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:54,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:54,083 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18354#true} {18354#true} #78#return; {18354#true} is VALID [2022-04-15 08:42:54,083 INFO L272 TraceCheckUtils]: 11: Hoare triple {18354#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18354#true} is VALID [2022-04-15 08:42:54,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:54,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:54,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:54,084 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18354#true} {18354#true} #80#return; {18354#true} is VALID [2022-04-15 08:42:54,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {18354#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; {18407#(and (= 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-15 08:42:54,084 INFO L272 TraceCheckUtils]: 17: Hoare triple {18407#(and (= 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)); {18354#true} is VALID [2022-04-15 08:42:54,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:54,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:54,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:54,085 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18354#true} {18407#(and (= 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; {18407#(and (= 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-15 08:42:54,085 INFO L272 TraceCheckUtils]: 22: Hoare triple {18407#(and (= 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)); {18354#true} is VALID [2022-04-15 08:42:54,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:54,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:54,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:54,086 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18354#true} {18407#(and (= 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; {18407#(and (= 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-15 08:42:54,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {18407#(and (= 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; {18407#(and (= 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-15 08:42:54,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {18407#(and (= 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; {18407#(and (= 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-15 08:42:54,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {18407#(and (= 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; {18447#(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-15 08:42:54,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {18447#(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; {18447#(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-15 08:42:54,089 INFO L290 TraceCheckUtils]: 31: Hoare triple {18447#(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; {18447#(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-15 08:42:54,089 INFO L272 TraceCheckUtils]: 32: Hoare triple {18447#(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)); {18354#true} is VALID [2022-04-15 08:42:54,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:54,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:54,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:54,090 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18354#true} {18447#(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; {18447#(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-15 08:42:54,090 INFO L272 TraceCheckUtils]: 37: Hoare triple {18447#(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)); {18354#true} is VALID [2022-04-15 08:42:54,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:54,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:54,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:54,091 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18354#true} {18447#(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; {18447#(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-15 08:42:54,091 INFO L272 TraceCheckUtils]: 42: Hoare triple {18447#(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)); {18354#true} is VALID [2022-04-15 08:42:54,091 INFO L290 TraceCheckUtils]: 43: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:54,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:54,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:54,092 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18354#true} {18447#(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; {18447#(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-15 08:42:54,092 INFO L272 TraceCheckUtils]: 47: Hoare triple {18447#(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)); {18354#true} is VALID [2022-04-15 08:42:54,093 INFO L290 TraceCheckUtils]: 48: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:54,093 INFO L290 TraceCheckUtils]: 49: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:54,093 INFO L290 TraceCheckUtils]: 50: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:54,094 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {18354#true} {18447#(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; {18447#(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-15 08:42:54,094 INFO L290 TraceCheckUtils]: 52: Hoare triple {18447#(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; {18517#(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-15 08:42:54,095 INFO L290 TraceCheckUtils]: 53: Hoare triple {18517#(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; {18517#(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-15 08:42:54,095 INFO L290 TraceCheckUtils]: 54: Hoare triple {18517#(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; {18517#(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-15 08:42:54,095 INFO L272 TraceCheckUtils]: 55: Hoare triple {18517#(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)); {18354#true} is VALID [2022-04-15 08:42:54,095 INFO L290 TraceCheckUtils]: 56: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:54,096 INFO L290 TraceCheckUtils]: 57: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:54,096 INFO L290 TraceCheckUtils]: 58: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:54,096 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18354#true} {18517#(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; {18517#(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-15 08:42:54,097 INFO L272 TraceCheckUtils]: 60: Hoare triple {18517#(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)); {18354#true} is VALID [2022-04-15 08:42:54,097 INFO L290 TraceCheckUtils]: 61: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:54,097 INFO L290 TraceCheckUtils]: 62: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:54,097 INFO L290 TraceCheckUtils]: 63: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:54,098 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18354#true} {18517#(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; {18517#(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-15 08:42:54,098 INFO L272 TraceCheckUtils]: 65: Hoare triple {18517#(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)); {18354#true} is VALID [2022-04-15 08:42:54,098 INFO L290 TraceCheckUtils]: 66: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:54,098 INFO L290 TraceCheckUtils]: 67: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:54,098 INFO L290 TraceCheckUtils]: 68: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:54,099 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18354#true} {18517#(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; {18517#(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-15 08:42:54,099 INFO L272 TraceCheckUtils]: 70: Hoare triple {18517#(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)); {18354#true} is VALID [2022-04-15 08:42:54,099 INFO L290 TraceCheckUtils]: 71: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:54,099 INFO L290 TraceCheckUtils]: 72: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:54,099 INFO L290 TraceCheckUtils]: 73: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:54,100 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18354#true} {18517#(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; {18517#(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-15 08:42:54,100 INFO L290 TraceCheckUtils]: 75: Hoare triple {18517#(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); {18517#(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-15 08:42:54,101 INFO L290 TraceCheckUtils]: 76: Hoare triple {18517#(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; {18590#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-15 08:42:54,102 INFO L290 TraceCheckUtils]: 77: Hoare triple {18590#(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; {18590#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-15 08:42:54,102 INFO L290 TraceCheckUtils]: 78: Hoare triple {18590#(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; {18590#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-15 08:42:54,102 INFO L290 TraceCheckUtils]: 79: Hoare triple {18590#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {18600#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-15 08:42:54,103 INFO L272 TraceCheckUtils]: 80: Hoare triple {18600#(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)); {18604#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:42:54,103 INFO L290 TraceCheckUtils]: 81: Hoare triple {18604#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18608#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:42:54,104 INFO L290 TraceCheckUtils]: 82: Hoare triple {18608#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18355#false} is VALID [2022-04-15 08:42:54,104 INFO L290 TraceCheckUtils]: 83: Hoare triple {18355#false} assume !false; {18355#false} is VALID [2022-04-15 08:42:54,105 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-15 08:42:54,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:42:54,629 INFO L290 TraceCheckUtils]: 83: Hoare triple {18355#false} assume !false; {18355#false} is VALID [2022-04-15 08:42:54,630 INFO L290 TraceCheckUtils]: 82: Hoare triple {18608#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18355#false} is VALID [2022-04-15 08:42:54,630 INFO L290 TraceCheckUtils]: 81: Hoare triple {18604#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18608#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:42:54,631 INFO L272 TraceCheckUtils]: 80: Hoare triple {18624#(= (+ (* 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)); {18604#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:42:54,631 INFO L290 TraceCheckUtils]: 79: Hoare triple {18628#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {18624#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-15 08:42:54,632 INFO L290 TraceCheckUtils]: 78: Hoare triple {18628#(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; {18628#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-15 08:42:54,632 INFO L290 TraceCheckUtils]: 77: Hoare triple {18628#(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; {18628#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-15 08:42:56,633 WARN L290 TraceCheckUtils]: 76: Hoare triple {18638#(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; {18628#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is UNKNOWN [2022-04-15 08:42:56,634 INFO L290 TraceCheckUtils]: 75: Hoare triple {18638#(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); {18638#(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-15 08:42:56,635 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18354#true} {18638#(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; {18638#(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-15 08:42:56,635 INFO L290 TraceCheckUtils]: 73: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:56,635 INFO L290 TraceCheckUtils]: 72: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:56,635 INFO L290 TraceCheckUtils]: 71: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:56,635 INFO L272 TraceCheckUtils]: 70: Hoare triple {18638#(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)); {18354#true} is VALID [2022-04-15 08:42:56,635 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18354#true} {18638#(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; {18638#(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-15 08:42:56,636 INFO L290 TraceCheckUtils]: 68: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:56,636 INFO L290 TraceCheckUtils]: 67: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:56,636 INFO L290 TraceCheckUtils]: 66: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:56,636 INFO L272 TraceCheckUtils]: 65: Hoare triple {18638#(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)); {18354#true} is VALID [2022-04-15 08:42:56,636 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18354#true} {18638#(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; {18638#(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-15 08:42:56,636 INFO L290 TraceCheckUtils]: 63: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:56,636 INFO L290 TraceCheckUtils]: 62: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:56,637 INFO L290 TraceCheckUtils]: 61: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:56,637 INFO L272 TraceCheckUtils]: 60: Hoare triple {18638#(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)); {18354#true} is VALID [2022-04-15 08:42:56,637 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18354#true} {18638#(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; {18638#(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-15 08:42:56,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:56,637 INFO L290 TraceCheckUtils]: 57: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:56,637 INFO L290 TraceCheckUtils]: 56: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:56,638 INFO L272 TraceCheckUtils]: 55: Hoare triple {18638#(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)); {18354#true} is VALID [2022-04-15 08:42:56,638 INFO L290 TraceCheckUtils]: 54: Hoare triple {18638#(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; {18638#(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-15 08:42:56,638 INFO L290 TraceCheckUtils]: 53: Hoare triple {18638#(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; {18638#(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-15 08:42:57,232 INFO L290 TraceCheckUtils]: 52: Hoare triple {18711#(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; {18638#(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-15 08:42:57,233 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {18354#true} {18711#(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; {18711#(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-15 08:42:57,234 INFO L290 TraceCheckUtils]: 50: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:57,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:57,234 INFO L290 TraceCheckUtils]: 48: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:57,234 INFO L272 TraceCheckUtils]: 47: Hoare triple {18711#(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)); {18354#true} is VALID [2022-04-15 08:42:57,235 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18354#true} {18711#(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; {18711#(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-15 08:42:57,235 INFO L290 TraceCheckUtils]: 45: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:57,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:57,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:57,235 INFO L272 TraceCheckUtils]: 42: Hoare triple {18711#(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)); {18354#true} is VALID [2022-04-15 08:42:57,235 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18354#true} {18711#(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; {18711#(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-15 08:42:57,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:57,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:57,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:57,236 INFO L272 TraceCheckUtils]: 37: Hoare triple {18711#(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)); {18354#true} is VALID [2022-04-15 08:42:57,236 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18354#true} {18711#(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; {18711#(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-15 08:42:57,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:57,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:57,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:57,237 INFO L272 TraceCheckUtils]: 32: Hoare triple {18711#(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)); {18354#true} is VALID [2022-04-15 08:42:57,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {18711#(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; {18711#(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-15 08:42:57,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {18711#(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; {18711#(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-15 08:42:57,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {18781#(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; {18711#(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-15 08:42:57,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {18781#(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; {18781#(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-15 08:42:57,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {18781#(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; {18781#(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-15 08:42:57,240 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18354#true} {18781#(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; {18781#(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-15 08:42:57,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:57,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:57,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:57,240 INFO L272 TraceCheckUtils]: 22: Hoare triple {18781#(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)); {18354#true} is VALID [2022-04-15 08:42:57,241 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18354#true} {18781#(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; {18781#(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-15 08:42:57,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:57,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:57,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:57,241 INFO L272 TraceCheckUtils]: 17: Hoare triple {18781#(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)); {18354#true} is VALID [2022-04-15 08:42:57,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {18354#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; {18781#(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-15 08:42:57,241 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18354#true} {18354#true} #80#return; {18354#true} is VALID [2022-04-15 08:42:57,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:57,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:57,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:57,242 INFO L272 TraceCheckUtils]: 11: Hoare triple {18354#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18354#true} is VALID [2022-04-15 08:42:57,242 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18354#true} {18354#true} #78#return; {18354#true} is VALID [2022-04-15 08:42:57,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:57,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {18354#true} assume !(0 == ~cond); {18354#true} is VALID [2022-04-15 08:42:57,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {18354#true} ~cond := #in~cond; {18354#true} is VALID [2022-04-15 08:42:57,242 INFO L272 TraceCheckUtils]: 6: Hoare triple {18354#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18354#true} is VALID [2022-04-15 08:42:57,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {18354#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; {18354#true} is VALID [2022-04-15 08:42:57,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {18354#true} call #t~ret8 := main(); {18354#true} is VALID [2022-04-15 08:42:57,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18354#true} {18354#true} #98#return; {18354#true} is VALID [2022-04-15 08:42:57,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {18354#true} assume true; {18354#true} is VALID [2022-04-15 08:42:57,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {18354#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; {18354#true} is VALID [2022-04-15 08:42:57,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {18354#true} call ULTIMATE.init(); {18354#true} is VALID [2022-04-15 08:42:57,243 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-15 08:42:57,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:42:57,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685663898] [2022-04-15 08:42:57,243 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:42:57,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646104858] [2022-04-15 08:42:57,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646104858] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:42:57,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:42:57,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-15 08:42:57,244 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:42:57,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1734239555] [2022-04-15 08:42:57,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1734239555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:42:57,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:42:57,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 08:42:57,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268820461] [2022-04-15 08:42:57,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:42:57,244 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-15 08:42:57,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:42:57,245 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-15 08:42:57,294 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-15 08:42:57,294 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 08:42:57,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:42:57,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 08:42:57,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:42:57,295 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-15 08:42:58,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:42:58,698 INFO L93 Difference]: Finished difference Result 234 states and 311 transitions. [2022-04-15 08:42:58,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 08:42:58,698 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-15 08:42:58,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:42:58,698 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-15 08:42:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-15 08:42:58,702 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-15 08:42:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-15 08:42:58,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 114 transitions. [2022-04-15 08:42:58,845 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-15 08:42:58,849 INFO L225 Difference]: With dead ends: 234 [2022-04-15 08:42:58,849 INFO L226 Difference]: Without dead ends: 232 [2022-04-15 08:42:58,850 INFO L912 BasicCegarLoop]: 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-15 08:42:58,850 INFO L913 BasicCegarLoop]: 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-15 08:42:58,850 INFO L914 BasicCegarLoop]: 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-15 08:42:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-04-15 08:42:59,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2022-04-15 08:42:59,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:42:59,205 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-15 08:42:59,205 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-15 08:42:59,206 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-15 08:42:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:42:59,211 INFO L93 Difference]: Finished difference Result 232 states and 309 transitions. [2022-04-15 08:42:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-15 08:42:59,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:42:59,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:42:59,212 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-15 08:42:59,213 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-15 08:42:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:42:59,218 INFO L93 Difference]: Finished difference Result 232 states and 309 transitions. [2022-04-15 08:42:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-15 08:42:59,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:42:59,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:42:59,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:42:59,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:42:59,219 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-15 08:42:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 306 transitions. [2022-04-15 08:42:59,225 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 306 transitions. Word has length 84 [2022-04-15 08:42:59,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:42:59,225 INFO L478 AbstractCegarLoop]: Abstraction has 229 states and 306 transitions. [2022-04-15 08:42:59,225 INFO L479 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-15 08:42:59,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 306 transitions. [2022-04-15 08:42:59,605 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-15 08:42:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 306 transitions. [2022-04-15 08:42:59,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 08:42:59,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:42:59,606 INFO L499 BasicCegarLoop]: 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-15 08:42:59,622 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-15 08:42:59,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:42:59,815 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:42:59,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:42:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1676300815, now seen corresponding path program 3 times [2022-04-15 08:42:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:42:59,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [713794492] [2022-04-15 08:42:59,816 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:42:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1676300815, now seen corresponding path program 4 times [2022-04-15 08:42:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:42:59,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966980666] [2022-04-15 08:42:59,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:42:59,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:42:59,826 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:42:59,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409460084] [2022-04-15 08:42:59,826 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 08:42:59,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:42:59,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:42:59,827 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-15 08:42:59,828 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-15 08:42:59,869 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 08:42:59,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:42:59,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 08:42:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:42:59,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:43:00,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {20269#true} call ULTIMATE.init(); {20269#true} is VALID [2022-04-15 08:43:00,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {20269#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; {20269#true} is VALID [2022-04-15 08:43:00,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {20269#true} assume true; {20269#true} is VALID [2022-04-15 08:43:00,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20269#true} {20269#true} #98#return; {20269#true} is VALID [2022-04-15 08:43:00,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {20269#true} call #t~ret8 := main(); {20269#true} is VALID [2022-04-15 08:43:00,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {20269#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; {20269#true} is VALID [2022-04-15 08:43:00,067 INFO L272 TraceCheckUtils]: 6: Hoare triple {20269#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20269#true} is VALID [2022-04-15 08:43:00,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {20269#true} ~cond := #in~cond; {20269#true} is VALID [2022-04-15 08:43:00,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {20269#true} assume !(0 == ~cond); {20269#true} is VALID [2022-04-15 08:43:00,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {20269#true} assume true; {20269#true} is VALID [2022-04-15 08:43:00,068 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20269#true} {20269#true} #78#return; {20269#true} is VALID [2022-04-15 08:43:00,068 INFO L272 TraceCheckUtils]: 11: Hoare triple {20269#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20269#true} is VALID [2022-04-15 08:43:00,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {20269#true} ~cond := #in~cond; {20269#true} is VALID [2022-04-15 08:43:00,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {20269#true} assume !(0 == ~cond); {20269#true} is VALID [2022-04-15 08:43:00,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {20269#true} assume true; {20269#true} is VALID [2022-04-15 08:43:00,068 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20269#true} {20269#true} #80#return; {20269#true} is VALID [2022-04-15 08:43:00,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {20269#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; {20269#true} is VALID [2022-04-15 08:43:00,068 INFO L272 TraceCheckUtils]: 17: Hoare triple {20269#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {20269#true} is VALID [2022-04-15 08:43:00,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {20269#true} ~cond := #in~cond; {20269#true} is VALID [2022-04-15 08:43:00,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {20269#true} assume !(0 == ~cond); {20269#true} is VALID [2022-04-15 08:43:00,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {20269#true} assume true; {20269#true} is VALID [2022-04-15 08:43:00,068 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20269#true} {20269#true} #82#return; {20269#true} is VALID [2022-04-15 08:43:00,068 INFO L272 TraceCheckUtils]: 22: Hoare triple {20269#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {20269#true} is VALID [2022-04-15 08:43:00,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {20269#true} ~cond := #in~cond; {20269#true} is VALID [2022-04-15 08:43:00,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {20269#true} assume !(0 == ~cond); {20269#true} is VALID [2022-04-15 08:43:00,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {20269#true} assume true; {20269#true} is VALID [2022-04-15 08:43:00,069 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20269#true} {20269#true} #84#return; {20269#true} is VALID [2022-04-15 08:43:00,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {20269#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20269#true} is VALID [2022-04-15 08:43:00,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {20269#true} assume !!(#t~post6 < 10);havoc #t~post6; {20269#true} is VALID [2022-04-15 08:43:00,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {20269#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20269#true} is VALID [2022-04-15 08:43:00,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {20269#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20269#true} is VALID [2022-04-15 08:43:00,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {20269#true} assume !!(#t~post7 < 10);havoc #t~post7; {20269#true} is VALID [2022-04-15 08:43:00,069 INFO L272 TraceCheckUtils]: 32: Hoare triple {20269#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20269#true} is VALID [2022-04-15 08:43:00,069 INFO L290 TraceCheckUtils]: 33: Hoare triple {20269#true} ~cond := #in~cond; {20269#true} is VALID [2022-04-15 08:43:00,069 INFO L290 TraceCheckUtils]: 34: Hoare triple {20269#true} assume !(0 == ~cond); {20269#true} is VALID [2022-04-15 08:43:00,069 INFO L290 TraceCheckUtils]: 35: Hoare triple {20269#true} assume true; {20269#true} is VALID [2022-04-15 08:43:00,069 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20269#true} {20269#true} #86#return; {20269#true} is VALID [2022-04-15 08:43:00,070 INFO L272 TraceCheckUtils]: 37: Hoare triple {20269#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20269#true} is VALID [2022-04-15 08:43:00,070 INFO L290 TraceCheckUtils]: 38: Hoare triple {20269#true} ~cond := #in~cond; {20269#true} is VALID [2022-04-15 08:43:00,070 INFO L290 TraceCheckUtils]: 39: Hoare triple {20269#true} assume !(0 == ~cond); {20269#true} is VALID [2022-04-15 08:43:00,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {20269#true} assume true; {20269#true} is VALID [2022-04-15 08:43:00,070 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20269#true} {20269#true} #88#return; {20269#true} is VALID [2022-04-15 08:43:00,070 INFO L272 TraceCheckUtils]: 42: Hoare triple {20269#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20269#true} is VALID [2022-04-15 08:43:00,070 INFO L290 TraceCheckUtils]: 43: Hoare triple {20269#true} ~cond := #in~cond; {20269#true} is VALID [2022-04-15 08:43:00,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {20269#true} assume !(0 == ~cond); {20269#true} is VALID [2022-04-15 08:43:00,070 INFO L290 TraceCheckUtils]: 45: Hoare triple {20269#true} assume true; {20269#true} is VALID [2022-04-15 08:43:00,070 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {20269#true} {20269#true} #90#return; {20269#true} is VALID [2022-04-15 08:43:00,070 INFO L272 TraceCheckUtils]: 47: Hoare triple {20269#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)); {20269#true} is VALID [2022-04-15 08:43:00,070 INFO L290 TraceCheckUtils]: 48: Hoare triple {20269#true} ~cond := #in~cond; {20269#true} is VALID [2022-04-15 08:43:00,070 INFO L290 TraceCheckUtils]: 49: Hoare triple {20269#true} assume !(0 == ~cond); {20269#true} is VALID [2022-04-15 08:43:00,070 INFO L290 TraceCheckUtils]: 50: Hoare triple {20269#true} assume true; {20269#true} is VALID [2022-04-15 08:43:00,071 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {20269#true} {20269#true} #92#return; {20269#true} is VALID [2022-04-15 08:43:00,071 INFO L290 TraceCheckUtils]: 52: Hoare triple {20269#true} assume !(~c~0 >= ~b~0); {20430#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 08:43:00,071 INFO L290 TraceCheckUtils]: 53: Hoare triple {20430#(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; {20434#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 08:43:00,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {20434#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20434#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 08:43:00,072 INFO L290 TraceCheckUtils]: 55: Hoare triple {20434#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {20434#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 08:43:00,072 INFO L290 TraceCheckUtils]: 56: Hoare triple {20434#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20444#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:43:00,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {20444#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20444#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:43:00,073 INFO L290 TraceCheckUtils]: 58: Hoare triple {20444#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {20444#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:43:00,073 INFO L272 TraceCheckUtils]: 59: Hoare triple {20444#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20269#true} is VALID [2022-04-15 08:43:00,073 INFO L290 TraceCheckUtils]: 60: Hoare triple {20269#true} ~cond := #in~cond; {20269#true} is VALID [2022-04-15 08:43:00,073 INFO L290 TraceCheckUtils]: 61: Hoare triple {20269#true} assume !(0 == ~cond); {20269#true} is VALID [2022-04-15 08:43:00,073 INFO L290 TraceCheckUtils]: 62: Hoare triple {20269#true} assume true; {20269#true} is VALID [2022-04-15 08:43:00,073 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20269#true} {20444#(< main_~b~0 main_~c~0)} #86#return; {20444#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:43:00,073 INFO L272 TraceCheckUtils]: 64: Hoare triple {20444#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20269#true} is VALID [2022-04-15 08:43:00,073 INFO L290 TraceCheckUtils]: 65: Hoare triple {20269#true} ~cond := #in~cond; {20269#true} is VALID [2022-04-15 08:43:00,074 INFO L290 TraceCheckUtils]: 66: Hoare triple {20269#true} assume !(0 == ~cond); {20269#true} is VALID [2022-04-15 08:43:00,074 INFO L290 TraceCheckUtils]: 67: Hoare triple {20269#true} assume true; {20269#true} is VALID [2022-04-15 08:43:00,074 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {20269#true} {20444#(< main_~b~0 main_~c~0)} #88#return; {20444#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:43:00,074 INFO L272 TraceCheckUtils]: 69: Hoare triple {20444#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20269#true} is VALID [2022-04-15 08:43:00,074 INFO L290 TraceCheckUtils]: 70: Hoare triple {20269#true} ~cond := #in~cond; {20269#true} is VALID [2022-04-15 08:43:00,074 INFO L290 TraceCheckUtils]: 71: Hoare triple {20269#true} assume !(0 == ~cond); {20269#true} is VALID [2022-04-15 08:43:00,074 INFO L290 TraceCheckUtils]: 72: Hoare triple {20269#true} assume true; {20269#true} is VALID [2022-04-15 08:43:00,075 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20269#true} {20444#(< main_~b~0 main_~c~0)} #90#return; {20444#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:43:00,075 INFO L272 TraceCheckUtils]: 74: Hoare triple {20444#(< 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)); {20269#true} is VALID [2022-04-15 08:43:00,075 INFO L290 TraceCheckUtils]: 75: Hoare triple {20269#true} ~cond := #in~cond; {20269#true} is VALID [2022-04-15 08:43:00,075 INFO L290 TraceCheckUtils]: 76: Hoare triple {20269#true} assume !(0 == ~cond); {20269#true} is VALID [2022-04-15 08:43:00,075 INFO L290 TraceCheckUtils]: 77: Hoare triple {20269#true} assume true; {20269#true} is VALID [2022-04-15 08:43:00,076 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {20269#true} {20444#(< main_~b~0 main_~c~0)} #92#return; {20444#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:43:00,076 INFO L290 TraceCheckUtils]: 79: Hoare triple {20444#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {20270#false} is VALID [2022-04-15 08:43:00,076 INFO L290 TraceCheckUtils]: 80: Hoare triple {20270#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; {20270#false} is VALID [2022-04-15 08:43:00,076 INFO L290 TraceCheckUtils]: 81: Hoare triple {20270#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20270#false} is VALID [2022-04-15 08:43:00,076 INFO L290 TraceCheckUtils]: 82: Hoare triple {20270#false} assume !(#t~post6 < 10);havoc #t~post6; {20270#false} is VALID [2022-04-15 08:43:00,076 INFO L272 TraceCheckUtils]: 83: Hoare triple {20270#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {20270#false} is VALID [2022-04-15 08:43:00,076 INFO L290 TraceCheckUtils]: 84: Hoare triple {20270#false} ~cond := #in~cond; {20270#false} is VALID [2022-04-15 08:43:00,077 INFO L290 TraceCheckUtils]: 85: Hoare triple {20270#false} assume 0 == ~cond; {20270#false} is VALID [2022-04-15 08:43:00,077 INFO L290 TraceCheckUtils]: 86: Hoare triple {20270#false} assume !false; {20270#false} is VALID [2022-04-15 08:43:00,077 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-15 08:43:00,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:43:00,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:43:00,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966980666] [2022-04-15 08:43:00,077 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:43:00,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409460084] [2022-04-15 08:43:00,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409460084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:43:00,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:43:00,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:43:00,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:43:00,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [713794492] [2022-04-15 08:43:00,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [713794492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:43:00,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:43:00,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:43:00,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540866246] [2022-04-15 08:43:00,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:43:00,078 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-15 08:43:00,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:43:00,079 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-15 08:43:00,116 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-15 08:43:00,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:43:00,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:43:00,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:43:00,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:43:00,116 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-15 08:43:00,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:43:00,855 INFO L93 Difference]: Finished difference Result 371 states and 532 transitions. [2022-04-15 08:43:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:43:00,856 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-15 08:43:00,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:43:00,856 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-15 08:43:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-04-15 08:43:00,857 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-15 08:43:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-04-15 08:43:00,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 110 transitions. [2022-04-15 08:43:00,943 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-15 08:43:00,948 INFO L225 Difference]: With dead ends: 371 [2022-04-15 08:43:00,948 INFO L226 Difference]: Without dead ends: 291 [2022-04-15 08:43:00,949 INFO L912 BasicCegarLoop]: 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-15 08:43:00,950 INFO L913 BasicCegarLoop]: 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-15 08:43:00,950 INFO L914 BasicCegarLoop]: 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-15 08:43:00,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-04-15 08:43:01,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 257. [2022-04-15 08:43:01,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:43:01,370 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-15 08:43:01,370 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-15 08:43:01,371 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-15 08:43:01,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:43:01,377 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2022-04-15 08:43:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 403 transitions. [2022-04-15 08:43:01,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:43:01,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:43:01,378 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-15 08:43:01,378 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-15 08:43:01,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:43:01,384 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2022-04-15 08:43:01,384 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 403 transitions. [2022-04-15 08:43:01,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:43:01,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:43:01,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:43:01,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:43:01,385 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-15 08:43:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 348 transitions. [2022-04-15 08:43:01,390 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 348 transitions. Word has length 87 [2022-04-15 08:43:01,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:43:01,390 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 348 transitions. [2022-04-15 08:43:01,390 INFO L479 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-15 08:43:01,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 348 transitions. [2022-04-15 08:43:01,813 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-15 08:43:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 348 transitions. [2022-04-15 08:43:01,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 08:43:01,813 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:43:01,813 INFO L499 BasicCegarLoop]: 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-15 08:43:01,829 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-15 08:43:02,014 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:43:02,014 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:43:02,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:43:02,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1175887352, now seen corresponding path program 1 times [2022-04-15 08:43:02,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:43:02,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [901187268] [2022-04-15 08:43:02,015 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:43:02,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1175887352, now seen corresponding path program 2 times [2022-04-15 08:43:02,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:43:02,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882606304] [2022-04-15 08:43:02,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:43:02,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:43:02,028 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:43:02,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [839102663] [2022-04-15 08:43:02,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:43:02,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:43:02,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:43:02,029 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-15 08:43:02,030 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-15 08:43:02,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:43:02,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:43:02,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 08:43:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:43:02,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:43:02,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {22377#true} call ULTIMATE.init(); {22377#true} is VALID [2022-04-15 08:43:02,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {22377#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; {22377#true} is VALID [2022-04-15 08:43:02,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:02,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22377#true} {22377#true} #98#return; {22377#true} is VALID [2022-04-15 08:43:02,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {22377#true} call #t~ret8 := main(); {22377#true} is VALID [2022-04-15 08:43:02,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {22377#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; {22377#true} is VALID [2022-04-15 08:43:02,334 INFO L272 TraceCheckUtils]: 6: Hoare triple {22377#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:02,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:02,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:02,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:02,334 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22377#true} {22377#true} #78#return; {22377#true} is VALID [2022-04-15 08:43:02,334 INFO L272 TraceCheckUtils]: 11: Hoare triple {22377#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:02,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:02,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:02,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:02,335 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22377#true} {22377#true} #80#return; {22377#true} is VALID [2022-04-15 08:43:02,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {22377#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; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,335 INFO L272 TraceCheckUtils]: 17: Hoare triple {22430#(= main_~q~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:02,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:02,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:02,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:02,336 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {22377#true} {22430#(= main_~q~0 0)} #82#return; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,336 INFO L272 TraceCheckUtils]: 22: Hoare triple {22430#(= main_~q~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:02,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:02,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:02,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:02,336 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22377#true} {22430#(= main_~q~0 0)} #84#return; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {22430#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {22430#(= main_~q~0 0)} assume !!(#t~post6 < 10);havoc #t~post6; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {22430#(= main_~q~0 0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {22430#(= main_~q~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {22430#(= main_~q~0 0)} assume !!(#t~post7 < 10);havoc #t~post7; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,347 INFO L272 TraceCheckUtils]: 32: Hoare triple {22430#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:02,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:02,347 INFO L290 TraceCheckUtils]: 34: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:02,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:02,348 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22377#true} {22430#(= main_~q~0 0)} #86#return; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,348 INFO L272 TraceCheckUtils]: 37: Hoare triple {22430#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:02,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:02,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:02,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:02,348 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22377#true} {22430#(= main_~q~0 0)} #88#return; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,349 INFO L272 TraceCheckUtils]: 42: Hoare triple {22430#(= main_~q~0 0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:02,349 INFO L290 TraceCheckUtils]: 43: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:02,349 INFO L290 TraceCheckUtils]: 44: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:02,349 INFO L290 TraceCheckUtils]: 45: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:02,349 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22377#true} {22430#(= main_~q~0 0)} #90#return; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,349 INFO L272 TraceCheckUtils]: 47: Hoare triple {22430#(= 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)); {22377#true} is VALID [2022-04-15 08:43:02,349 INFO L290 TraceCheckUtils]: 48: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:02,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:02,349 INFO L290 TraceCheckUtils]: 50: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:02,350 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {22377#true} {22430#(= main_~q~0 0)} #92#return; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,350 INFO L290 TraceCheckUtils]: 52: Hoare triple {22430#(= main_~q~0 0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,350 INFO L290 TraceCheckUtils]: 53: Hoare triple {22430#(= main_~q~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,351 INFO L290 TraceCheckUtils]: 54: Hoare triple {22430#(= main_~q~0 0)} assume !!(#t~post7 < 10);havoc #t~post7; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,351 INFO L272 TraceCheckUtils]: 55: Hoare triple {22430#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:02,351 INFO L290 TraceCheckUtils]: 56: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:02,351 INFO L290 TraceCheckUtils]: 57: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:02,351 INFO L290 TraceCheckUtils]: 58: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:02,351 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22377#true} {22430#(= main_~q~0 0)} #86#return; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,351 INFO L272 TraceCheckUtils]: 60: Hoare triple {22430#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:02,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:02,352 INFO L290 TraceCheckUtils]: 62: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:02,352 INFO L290 TraceCheckUtils]: 63: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:02,352 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22377#true} {22430#(= main_~q~0 0)} #88#return; {22430#(= main_~q~0 0)} is VALID [2022-04-15 08:43:02,352 INFO L272 TraceCheckUtils]: 65: Hoare triple {22430#(= main_~q~0 0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:02,352 INFO L290 TraceCheckUtils]: 66: Hoare triple {22377#true} ~cond := #in~cond; {22581#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:43:02,353 INFO L290 TraceCheckUtils]: 67: Hoare triple {22581#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22585#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:43:02,353 INFO L290 TraceCheckUtils]: 68: Hoare triple {22585#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22585#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:43:02,353 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {22585#(not (= |__VERIFIER_assert_#in~cond| 0))} {22430#(= main_~q~0 0)} #90#return; {22592#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-15 08:43:02,353 INFO L272 TraceCheckUtils]: 70: Hoare triple {22592#(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)); {22377#true} is VALID [2022-04-15 08:43:02,354 INFO L290 TraceCheckUtils]: 71: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:02,354 INFO L290 TraceCheckUtils]: 72: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:02,354 INFO L290 TraceCheckUtils]: 73: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:02,354 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22377#true} {22592#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} #92#return; {22592#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-15 08:43:02,354 INFO L290 TraceCheckUtils]: 75: Hoare triple {22592#(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); {22592#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-15 08:43:02,355 INFO L290 TraceCheckUtils]: 76: Hoare triple {22592#(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; {22614#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-15 08:43:02,355 INFO L290 TraceCheckUtils]: 77: Hoare triple {22614#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22614#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-15 08:43:02,356 INFO L290 TraceCheckUtils]: 78: Hoare triple {22614#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} assume !!(#t~post6 < 10);havoc #t~post6; {22614#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-15 08:43:02,356 INFO L290 TraceCheckUtils]: 79: Hoare triple {22614#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} assume !(0 != ~b~0); {22614#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-15 08:43:02,356 INFO L272 TraceCheckUtils]: 80: Hoare triple {22614#(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)); {22377#true} is VALID [2022-04-15 08:43:02,356 INFO L290 TraceCheckUtils]: 81: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:02,356 INFO L290 TraceCheckUtils]: 82: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:02,356 INFO L290 TraceCheckUtils]: 83: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:02,357 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22377#true} {22614#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} #94#return; {22614#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-15 08:43:02,357 INFO L272 TraceCheckUtils]: 85: Hoare triple {22614#(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)); {22642#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:43:02,358 INFO L290 TraceCheckUtils]: 86: Hoare triple {22642#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22646#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:43:02,358 INFO L290 TraceCheckUtils]: 87: Hoare triple {22646#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22378#false} is VALID [2022-04-15 08:43:02,358 INFO L290 TraceCheckUtils]: 88: Hoare triple {22378#false} assume !false; {22378#false} is VALID [2022-04-15 08:43:02,358 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-15 08:43:02,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:43:23,566 INFO L290 TraceCheckUtils]: 88: Hoare triple {22378#false} assume !false; {22378#false} is VALID [2022-04-15 08:43:23,566 INFO L290 TraceCheckUtils]: 87: Hoare triple {22646#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22378#false} is VALID [2022-04-15 08:43:23,567 INFO L290 TraceCheckUtils]: 86: Hoare triple {22642#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22646#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:43:23,568 INFO L272 TraceCheckUtils]: 85: Hoare triple {22662#(= 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)); {22642#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:43:23,568 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22377#true} {22662#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #94#return; {22662#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:43:23,569 INFO L290 TraceCheckUtils]: 83: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:23,569 INFO L290 TraceCheckUtils]: 82: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:23,569 INFO L290 TraceCheckUtils]: 81: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:23,569 INFO L272 TraceCheckUtils]: 80: Hoare triple {22662#(= 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)); {22377#true} is VALID [2022-04-15 08:43:23,569 INFO L290 TraceCheckUtils]: 79: Hoare triple {22662#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(0 != ~b~0); {22662#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:43:23,570 INFO L290 TraceCheckUtils]: 78: Hoare triple {22662#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {22662#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:43:23,570 INFO L290 TraceCheckUtils]: 77: Hoare triple {22662#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22662#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:43:23,571 INFO L290 TraceCheckUtils]: 76: Hoare triple {22690#(= 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; {22662#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:43:23,572 INFO L290 TraceCheckUtils]: 75: Hoare triple {22690#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {22690#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 08:43:23,572 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22377#true} {22690#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {22690#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 08:43:23,573 INFO L290 TraceCheckUtils]: 73: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:23,573 INFO L290 TraceCheckUtils]: 72: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:23,573 INFO L290 TraceCheckUtils]: 71: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:23,573 INFO L272 TraceCheckUtils]: 70: Hoare triple {22690#(= 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)); {22377#true} is VALID [2022-04-15 08:43:23,574 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {22585#(not (= |__VERIFIER_assert_#in~cond| 0))} {22377#true} #90#return; {22690#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 08:43:23,574 INFO L290 TraceCheckUtils]: 68: Hoare triple {22585#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22585#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:43:23,574 INFO L290 TraceCheckUtils]: 67: Hoare triple {22721#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22585#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:43:23,575 INFO L290 TraceCheckUtils]: 66: Hoare triple {22377#true} ~cond := #in~cond; {22721#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 08:43:23,575 INFO L272 TraceCheckUtils]: 65: Hoare triple {22377#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:23,575 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22377#true} {22377#true} #88#return; {22377#true} is VALID [2022-04-15 08:43:23,575 INFO L290 TraceCheckUtils]: 63: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:23,575 INFO L290 TraceCheckUtils]: 62: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:23,575 INFO L290 TraceCheckUtils]: 61: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:23,575 INFO L272 TraceCheckUtils]: 60: Hoare triple {22377#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:23,575 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22377#true} {22377#true} #86#return; {22377#true} is VALID [2022-04-15 08:43:23,576 INFO L290 TraceCheckUtils]: 58: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:23,576 INFO L290 TraceCheckUtils]: 57: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:23,576 INFO L290 TraceCheckUtils]: 56: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:23,576 INFO L272 TraceCheckUtils]: 55: Hoare triple {22377#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:23,576 INFO L290 TraceCheckUtils]: 54: Hoare triple {22377#true} assume !!(#t~post7 < 10);havoc #t~post7; {22377#true} is VALID [2022-04-15 08:43:23,576 INFO L290 TraceCheckUtils]: 53: Hoare triple {22377#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22377#true} is VALID [2022-04-15 08:43:23,576 INFO L290 TraceCheckUtils]: 52: Hoare triple {22377#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {22377#true} is VALID [2022-04-15 08:43:23,576 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {22377#true} {22377#true} #92#return; {22377#true} is VALID [2022-04-15 08:43:23,576 INFO L290 TraceCheckUtils]: 50: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:23,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:23,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:23,576 INFO L272 TraceCheckUtils]: 47: Hoare triple {22377#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)); {22377#true} is VALID [2022-04-15 08:43:23,576 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22377#true} {22377#true} #90#return; {22377#true} is VALID [2022-04-15 08:43:23,576 INFO L290 TraceCheckUtils]: 45: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:23,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:23,577 INFO L290 TraceCheckUtils]: 43: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:23,577 INFO L272 TraceCheckUtils]: 42: Hoare triple {22377#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:23,577 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22377#true} {22377#true} #88#return; {22377#true} is VALID [2022-04-15 08:43:23,577 INFO L290 TraceCheckUtils]: 40: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:23,577 INFO L290 TraceCheckUtils]: 39: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:23,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:23,577 INFO L272 TraceCheckUtils]: 37: Hoare triple {22377#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:23,577 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22377#true} {22377#true} #86#return; {22377#true} is VALID [2022-04-15 08:43:23,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:23,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:23,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:23,577 INFO L272 TraceCheckUtils]: 32: Hoare triple {22377#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:23,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {22377#true} assume !!(#t~post7 < 10);havoc #t~post7; {22377#true} is VALID [2022-04-15 08:43:23,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {22377#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22377#true} is VALID [2022-04-15 08:43:23,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {22377#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22377#true} is VALID [2022-04-15 08:43:23,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {22377#true} assume !!(#t~post6 < 10);havoc #t~post6; {22377#true} is VALID [2022-04-15 08:43:23,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {22377#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22377#true} is VALID [2022-04-15 08:43:23,578 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22377#true} {22377#true} #84#return; {22377#true} is VALID [2022-04-15 08:43:23,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:23,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:23,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:23,578 INFO L272 TraceCheckUtils]: 22: Hoare triple {22377#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:23,578 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {22377#true} {22377#true} #82#return; {22377#true} is VALID [2022-04-15 08:43:23,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:23,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:23,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:23,579 INFO L272 TraceCheckUtils]: 17: Hoare triple {22377#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:23,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {22377#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; {22377#true} is VALID [2022-04-15 08:43:23,579 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22377#true} {22377#true} #80#return; {22377#true} is VALID [2022-04-15 08:43:23,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:23,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:23,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:23,579 INFO L272 TraceCheckUtils]: 11: Hoare triple {22377#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:23,579 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22377#true} {22377#true} #78#return; {22377#true} is VALID [2022-04-15 08:43:23,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:23,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {22377#true} assume !(0 == ~cond); {22377#true} is VALID [2022-04-15 08:43:23,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {22377#true} ~cond := #in~cond; {22377#true} is VALID [2022-04-15 08:43:23,580 INFO L272 TraceCheckUtils]: 6: Hoare triple {22377#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {22377#true} is VALID [2022-04-15 08:43:23,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {22377#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; {22377#true} is VALID [2022-04-15 08:43:23,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {22377#true} call #t~ret8 := main(); {22377#true} is VALID [2022-04-15 08:43:23,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22377#true} {22377#true} #98#return; {22377#true} is VALID [2022-04-15 08:43:23,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {22377#true} assume true; {22377#true} is VALID [2022-04-15 08:43:23,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {22377#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; {22377#true} is VALID [2022-04-15 08:43:23,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {22377#true} call ULTIMATE.init(); {22377#true} is VALID [2022-04-15 08:43:23,581 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-15 08:43:23,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:43:23,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882606304] [2022-04-15 08:43:23,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:43:23,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839102663] [2022-04-15 08:43:23,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839102663] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:43:23,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:43:23,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-15 08:43:23,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:43:23,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [901187268] [2022-04-15 08:43:23,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [901187268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:43:23,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:43:23,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 08:43:23,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139923653] [2022-04-15 08:43:23,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:43:23,583 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-15 08:43:23,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:43:23,583 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-15 08:43:23,629 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-15 08:43:23,630 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 08:43:23,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:43:23,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 08:43:23,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-15 08:43:23,631 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-15 08:43:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:43:24,644 INFO L93 Difference]: Finished difference Result 301 states and 415 transitions. [2022-04-15 08:43:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 08:43:24,644 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-15 08:43:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:43:24,645 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-15 08:43:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-15 08:43:24,645 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-15 08:43:24,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-15 08:43:24,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 89 transitions. [2022-04-15 08:43:24,739 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-15 08:43:24,747 INFO L225 Difference]: With dead ends: 301 [2022-04-15 08:43:24,748 INFO L226 Difference]: Without dead ends: 297 [2022-04-15 08:43:24,748 INFO L912 BasicCegarLoop]: 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-15 08:43:24,748 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 26 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 08:43:24,749 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 203 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 08:43:24,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-15 08:43:25,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2022-04-15 08:43:25,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:43:25,251 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-15 08:43:25,252 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-15 08:43:25,252 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-15 08:43:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:43:25,258 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2022-04-15 08:43:25,258 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2022-04-15 08:43:25,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:43:25,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:43:25,259 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-15 08:43:25,259 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-15 08:43:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:43:25,264 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2022-04-15 08:43:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2022-04-15 08:43:25,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:43:25,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:43:25,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:43:25,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:43:25,266 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-15 08:43:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 404 transitions. [2022-04-15 08:43:25,272 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 404 transitions. Word has length 89 [2022-04-15 08:43:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:43:25,272 INFO L478 AbstractCegarLoop]: Abstraction has 293 states and 404 transitions. [2022-04-15 08:43:25,272 INFO L479 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-15 08:43:25,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 293 states and 404 transitions. [2022-04-15 08:43:25,782 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-15 08:43:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 404 transitions. [2022-04-15 08:43:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 08:43:25,783 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:43:25,783 INFO L499 BasicCegarLoop]: 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-15 08:43:25,813 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-15 08:43:25,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-15 08:43:25,984 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:43:25,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:43:25,984 INFO L85 PathProgramCache]: Analyzing trace with hash -201422586, now seen corresponding path program 1 times [2022-04-15 08:43:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:43:25,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [355704242] [2022-04-15 08:43:25,984 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:43:25,984 INFO L85 PathProgramCache]: Analyzing trace with hash -201422586, now seen corresponding path program 2 times [2022-04-15 08:43:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:43:25,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008642793] [2022-04-15 08:43:25,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:43:25,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:43:25,993 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:43:25,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1623627910] [2022-04-15 08:43:25,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:43:25,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:43:25,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:43:25,994 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-15 08:43:25,995 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-15 08:43:26,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:43:26,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:43:26,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 08:43:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:43:26,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:43:26,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {24708#true} call ULTIMATE.init(); {24708#true} is VALID [2022-04-15 08:43:26,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {24708#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; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {24716#(<= ~counter~0 0)} assume true; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24716#(<= ~counter~0 0)} {24708#true} #98#return; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {24716#(<= ~counter~0 0)} call #t~ret8 := main(); {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {24716#(<= ~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; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,359 INFO L272 TraceCheckUtils]: 6: Hoare triple {24716#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {24716#(<= ~counter~0 0)} ~cond := #in~cond; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {24716#(<= ~counter~0 0)} assume !(0 == ~cond); {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {24716#(<= ~counter~0 0)} assume true; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,360 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24716#(<= ~counter~0 0)} {24716#(<= ~counter~0 0)} #78#return; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,360 INFO L272 TraceCheckUtils]: 11: Hoare triple {24716#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {24716#(<= ~counter~0 0)} ~cond := #in~cond; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {24716#(<= ~counter~0 0)} assume !(0 == ~cond); {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {24716#(<= ~counter~0 0)} assume true; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,361 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24716#(<= ~counter~0 0)} {24716#(<= ~counter~0 0)} #80#return; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {24716#(<= ~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; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,362 INFO L272 TraceCheckUtils]: 17: Hoare triple {24716#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {24716#(<= ~counter~0 0)} ~cond := #in~cond; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {24716#(<= ~counter~0 0)} assume !(0 == ~cond); {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {24716#(<= ~counter~0 0)} assume true; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,363 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {24716#(<= ~counter~0 0)} {24716#(<= ~counter~0 0)} #82#return; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,363 INFO L272 TraceCheckUtils]: 22: Hoare triple {24716#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {24716#(<= ~counter~0 0)} ~cond := #in~cond; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {24716#(<= ~counter~0 0)} assume !(0 == ~cond); {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {24716#(<= ~counter~0 0)} assume true; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,364 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24716#(<= ~counter~0 0)} {24716#(<= ~counter~0 0)} #84#return; {24716#(<= ~counter~0 0)} is VALID [2022-04-15 08:43:26,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {24716#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24795#(<= ~counter~0 1)} is VALID [2022-04-15 08:43:26,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {24795#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {24795#(<= ~counter~0 1)} is VALID [2022-04-15 08:43:26,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {24795#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24795#(<= ~counter~0 1)} is VALID [2022-04-15 08:43:26,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {24795#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {24805#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,367 INFO L272 TraceCheckUtils]: 32: Hoare triple {24805#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {24805#(<= ~counter~0 2)} ~cond := #in~cond; {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {24805#(<= ~counter~0 2)} assume !(0 == ~cond); {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {24805#(<= ~counter~0 2)} assume true; {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,368 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24805#(<= ~counter~0 2)} {24805#(<= ~counter~0 2)} #86#return; {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,369 INFO L272 TraceCheckUtils]: 37: Hoare triple {24805#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,369 INFO L290 TraceCheckUtils]: 38: Hoare triple {24805#(<= ~counter~0 2)} ~cond := #in~cond; {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,369 INFO L290 TraceCheckUtils]: 39: Hoare triple {24805#(<= ~counter~0 2)} assume !(0 == ~cond); {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {24805#(<= ~counter~0 2)} assume true; {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,370 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24805#(<= ~counter~0 2)} {24805#(<= ~counter~0 2)} #88#return; {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,370 INFO L272 TraceCheckUtils]: 42: Hoare triple {24805#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {24805#(<= ~counter~0 2)} ~cond := #in~cond; {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {24805#(<= ~counter~0 2)} assume !(0 == ~cond); {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {24805#(<= ~counter~0 2)} assume true; {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,372 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24805#(<= ~counter~0 2)} {24805#(<= ~counter~0 2)} #90#return; {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,372 INFO L272 TraceCheckUtils]: 47: Hoare triple {24805#(<= ~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)); {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,372 INFO L290 TraceCheckUtils]: 48: Hoare triple {24805#(<= ~counter~0 2)} ~cond := #in~cond; {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,373 INFO L290 TraceCheckUtils]: 49: Hoare triple {24805#(<= ~counter~0 2)} assume !(0 == ~cond); {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,373 INFO L290 TraceCheckUtils]: 50: Hoare triple {24805#(<= ~counter~0 2)} assume true; {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,373 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24805#(<= ~counter~0 2)} {24805#(<= ~counter~0 2)} #92#return; {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,374 INFO L290 TraceCheckUtils]: 52: Hoare triple {24805#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {24805#(<= ~counter~0 2)} is VALID [2022-04-15 08:43:26,374 INFO L290 TraceCheckUtils]: 53: Hoare triple {24805#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,374 INFO L290 TraceCheckUtils]: 54: Hoare triple {24875#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,375 INFO L272 TraceCheckUtils]: 55: Hoare triple {24875#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,375 INFO L290 TraceCheckUtils]: 56: Hoare triple {24875#(<= ~counter~0 3)} ~cond := #in~cond; {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,375 INFO L290 TraceCheckUtils]: 57: Hoare triple {24875#(<= ~counter~0 3)} assume !(0 == ~cond); {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,376 INFO L290 TraceCheckUtils]: 58: Hoare triple {24875#(<= ~counter~0 3)} assume true; {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,376 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24875#(<= ~counter~0 3)} {24875#(<= ~counter~0 3)} #86#return; {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,377 INFO L272 TraceCheckUtils]: 60: Hoare triple {24875#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,377 INFO L290 TraceCheckUtils]: 61: Hoare triple {24875#(<= ~counter~0 3)} ~cond := #in~cond; {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,377 INFO L290 TraceCheckUtils]: 62: Hoare triple {24875#(<= ~counter~0 3)} assume !(0 == ~cond); {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,377 INFO L290 TraceCheckUtils]: 63: Hoare triple {24875#(<= ~counter~0 3)} assume true; {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,378 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24875#(<= ~counter~0 3)} {24875#(<= ~counter~0 3)} #88#return; {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,378 INFO L272 TraceCheckUtils]: 65: Hoare triple {24875#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,379 INFO L290 TraceCheckUtils]: 66: Hoare triple {24875#(<= ~counter~0 3)} ~cond := #in~cond; {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,379 INFO L290 TraceCheckUtils]: 67: Hoare triple {24875#(<= ~counter~0 3)} assume !(0 == ~cond); {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,379 INFO L290 TraceCheckUtils]: 68: Hoare triple {24875#(<= ~counter~0 3)} assume true; {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,380 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {24875#(<= ~counter~0 3)} {24875#(<= ~counter~0 3)} #90#return; {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,380 INFO L272 TraceCheckUtils]: 70: Hoare triple {24875#(<= ~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)); {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,380 INFO L290 TraceCheckUtils]: 71: Hoare triple {24875#(<= ~counter~0 3)} ~cond := #in~cond; {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,381 INFO L290 TraceCheckUtils]: 72: Hoare triple {24875#(<= ~counter~0 3)} assume !(0 == ~cond); {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,381 INFO L290 TraceCheckUtils]: 73: Hoare triple {24875#(<= ~counter~0 3)} assume true; {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,381 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24875#(<= ~counter~0 3)} {24875#(<= ~counter~0 3)} #92#return; {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,382 INFO L290 TraceCheckUtils]: 75: Hoare triple {24875#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,382 INFO L290 TraceCheckUtils]: 76: Hoare triple {24875#(<= ~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; {24875#(<= ~counter~0 3)} is VALID [2022-04-15 08:43:26,382 INFO L290 TraceCheckUtils]: 77: Hoare triple {24875#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24948#(<= ~counter~0 4)} is VALID [2022-04-15 08:43:26,383 INFO L290 TraceCheckUtils]: 78: Hoare triple {24948#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {24948#(<= ~counter~0 4)} is VALID [2022-04-15 08:43:26,383 INFO L290 TraceCheckUtils]: 79: Hoare triple {24948#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24948#(<= ~counter~0 4)} is VALID [2022-04-15 08:43:26,383 INFO L290 TraceCheckUtils]: 80: Hoare triple {24948#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24958#(<= |main_#t~post7| 4)} is VALID [2022-04-15 08:43:26,384 INFO L290 TraceCheckUtils]: 81: Hoare triple {24958#(<= |main_#t~post7| 4)} assume !(#t~post7 < 10);havoc #t~post7; {24709#false} is VALID [2022-04-15 08:43:26,384 INFO L290 TraceCheckUtils]: 82: Hoare triple {24709#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; {24709#false} is VALID [2022-04-15 08:43:26,384 INFO L290 TraceCheckUtils]: 83: Hoare triple {24709#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24709#false} is VALID [2022-04-15 08:43:26,384 INFO L290 TraceCheckUtils]: 84: Hoare triple {24709#false} assume !(#t~post6 < 10);havoc #t~post6; {24709#false} is VALID [2022-04-15 08:43:26,384 INFO L272 TraceCheckUtils]: 85: Hoare triple {24709#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {24709#false} is VALID [2022-04-15 08:43:26,384 INFO L290 TraceCheckUtils]: 86: Hoare triple {24709#false} ~cond := #in~cond; {24709#false} is VALID [2022-04-15 08:43:26,384 INFO L290 TraceCheckUtils]: 87: Hoare triple {24709#false} assume 0 == ~cond; {24709#false} is VALID [2022-04-15 08:43:26,384 INFO L290 TraceCheckUtils]: 88: Hoare triple {24709#false} assume !false; {24709#false} is VALID [2022-04-15 08:43:26,384 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-15 08:43:26,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:43:26,698 INFO L290 TraceCheckUtils]: 88: Hoare triple {24709#false} assume !false; {24709#false} is VALID [2022-04-15 08:43:26,698 INFO L290 TraceCheckUtils]: 87: Hoare triple {24709#false} assume 0 == ~cond; {24709#false} is VALID [2022-04-15 08:43:26,698 INFO L290 TraceCheckUtils]: 86: Hoare triple {24709#false} ~cond := #in~cond; {24709#false} is VALID [2022-04-15 08:43:26,698 INFO L272 TraceCheckUtils]: 85: Hoare triple {24709#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {24709#false} is VALID [2022-04-15 08:43:26,698 INFO L290 TraceCheckUtils]: 84: Hoare triple {24709#false} assume !(#t~post6 < 10);havoc #t~post6; {24709#false} is VALID [2022-04-15 08:43:26,698 INFO L290 TraceCheckUtils]: 83: Hoare triple {24709#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24709#false} is VALID [2022-04-15 08:43:26,698 INFO L290 TraceCheckUtils]: 82: Hoare triple {24709#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; {24709#false} is VALID [2022-04-15 08:43:26,698 INFO L290 TraceCheckUtils]: 81: Hoare triple {25004#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {24709#false} is VALID [2022-04-15 08:43:26,699 INFO L290 TraceCheckUtils]: 80: Hoare triple {25008#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25004#(< |main_#t~post7| 10)} is VALID [2022-04-15 08:43:26,699 INFO L290 TraceCheckUtils]: 79: Hoare triple {25008#(< ~counter~0 10)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {25008#(< ~counter~0 10)} is VALID [2022-04-15 08:43:26,699 INFO L290 TraceCheckUtils]: 78: Hoare triple {25008#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {25008#(< ~counter~0 10)} is VALID [2022-04-15 08:43:26,700 INFO L290 TraceCheckUtils]: 77: Hoare triple {25018#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25008#(< ~counter~0 10)} is VALID [2022-04-15 08:43:26,700 INFO L290 TraceCheckUtils]: 76: Hoare triple {25018#(< ~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; {25018#(< ~counter~0 9)} is VALID [2022-04-15 08:43:26,701 INFO L290 TraceCheckUtils]: 75: Hoare triple {25018#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {25018#(< ~counter~0 9)} is VALID [2022-04-15 08:43:26,701 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24708#true} {25018#(< ~counter~0 9)} #92#return; {25018#(< ~counter~0 9)} is VALID [2022-04-15 08:43:26,701 INFO L290 TraceCheckUtils]: 73: Hoare triple {24708#true} assume true; {24708#true} is VALID [2022-04-15 08:43:26,701 INFO L290 TraceCheckUtils]: 72: Hoare triple {24708#true} assume !(0 == ~cond); {24708#true} is VALID [2022-04-15 08:43:26,701 INFO L290 TraceCheckUtils]: 71: Hoare triple {24708#true} ~cond := #in~cond; {24708#true} is VALID [2022-04-15 08:43:26,702 INFO L272 TraceCheckUtils]: 70: Hoare triple {25018#(< ~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)); {24708#true} is VALID [2022-04-15 08:43:26,702 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {24708#true} {25018#(< ~counter~0 9)} #90#return; {25018#(< ~counter~0 9)} is VALID [2022-04-15 08:43:26,702 INFO L290 TraceCheckUtils]: 68: Hoare triple {24708#true} assume true; {24708#true} is VALID [2022-04-15 08:43:26,702 INFO L290 TraceCheckUtils]: 67: Hoare triple {24708#true} assume !(0 == ~cond); {24708#true} is VALID [2022-04-15 08:43:26,702 INFO L290 TraceCheckUtils]: 66: Hoare triple {24708#true} ~cond := #in~cond; {24708#true} is VALID [2022-04-15 08:43:26,702 INFO L272 TraceCheckUtils]: 65: Hoare triple {25018#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24708#true} is VALID [2022-04-15 08:43:26,703 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24708#true} {25018#(< ~counter~0 9)} #88#return; {25018#(< ~counter~0 9)} is VALID [2022-04-15 08:43:26,703 INFO L290 TraceCheckUtils]: 63: Hoare triple {24708#true} assume true; {24708#true} is VALID [2022-04-15 08:43:26,703 INFO L290 TraceCheckUtils]: 62: Hoare triple {24708#true} assume !(0 == ~cond); {24708#true} is VALID [2022-04-15 08:43:26,703 INFO L290 TraceCheckUtils]: 61: Hoare triple {24708#true} ~cond := #in~cond; {24708#true} is VALID [2022-04-15 08:43:26,703 INFO L272 TraceCheckUtils]: 60: Hoare triple {25018#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24708#true} is VALID [2022-04-15 08:43:26,704 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24708#true} {25018#(< ~counter~0 9)} #86#return; {25018#(< ~counter~0 9)} is VALID [2022-04-15 08:43:26,704 INFO L290 TraceCheckUtils]: 58: Hoare triple {24708#true} assume true; {24708#true} is VALID [2022-04-15 08:43:26,704 INFO L290 TraceCheckUtils]: 57: Hoare triple {24708#true} assume !(0 == ~cond); {24708#true} is VALID [2022-04-15 08:43:26,704 INFO L290 TraceCheckUtils]: 56: Hoare triple {24708#true} ~cond := #in~cond; {24708#true} is VALID [2022-04-15 08:43:26,704 INFO L272 TraceCheckUtils]: 55: Hoare triple {25018#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24708#true} is VALID [2022-04-15 08:43:26,704 INFO L290 TraceCheckUtils]: 54: Hoare triple {25018#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {25018#(< ~counter~0 9)} is VALID [2022-04-15 08:43:26,705 INFO L290 TraceCheckUtils]: 53: Hoare triple {25091#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25018#(< ~counter~0 9)} is VALID [2022-04-15 08:43:26,705 INFO L290 TraceCheckUtils]: 52: Hoare triple {25091#(< ~counter~0 8)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {25091#(< ~counter~0 8)} is VALID [2022-04-15 08:43:26,705 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24708#true} {25091#(< ~counter~0 8)} #92#return; {25091#(< ~counter~0 8)} is VALID [2022-04-15 08:43:26,706 INFO L290 TraceCheckUtils]: 50: Hoare triple {24708#true} assume true; {24708#true} is VALID [2022-04-15 08:43:26,706 INFO L290 TraceCheckUtils]: 49: Hoare triple {24708#true} assume !(0 == ~cond); {24708#true} is VALID [2022-04-15 08:43:26,706 INFO L290 TraceCheckUtils]: 48: Hoare triple {24708#true} ~cond := #in~cond; {24708#true} is VALID [2022-04-15 08:43:26,706 INFO L272 TraceCheckUtils]: 47: Hoare triple {25091#(< ~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)); {24708#true} is VALID [2022-04-15 08:43:26,706 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24708#true} {25091#(< ~counter~0 8)} #90#return; {25091#(< ~counter~0 8)} is VALID [2022-04-15 08:43:26,706 INFO L290 TraceCheckUtils]: 45: Hoare triple {24708#true} assume true; {24708#true} is VALID [2022-04-15 08:43:26,706 INFO L290 TraceCheckUtils]: 44: Hoare triple {24708#true} assume !(0 == ~cond); {24708#true} is VALID [2022-04-15 08:43:26,707 INFO L290 TraceCheckUtils]: 43: Hoare triple {24708#true} ~cond := #in~cond; {24708#true} is VALID [2022-04-15 08:43:26,707 INFO L272 TraceCheckUtils]: 42: Hoare triple {25091#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24708#true} is VALID [2022-04-15 08:43:26,707 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24708#true} {25091#(< ~counter~0 8)} #88#return; {25091#(< ~counter~0 8)} is VALID [2022-04-15 08:43:26,707 INFO L290 TraceCheckUtils]: 40: Hoare triple {24708#true} assume true; {24708#true} is VALID [2022-04-15 08:43:26,707 INFO L290 TraceCheckUtils]: 39: Hoare triple {24708#true} assume !(0 == ~cond); {24708#true} is VALID [2022-04-15 08:43:26,707 INFO L290 TraceCheckUtils]: 38: Hoare triple {24708#true} ~cond := #in~cond; {24708#true} is VALID [2022-04-15 08:43:26,707 INFO L272 TraceCheckUtils]: 37: Hoare triple {25091#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24708#true} is VALID [2022-04-15 08:43:26,708 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24708#true} {25091#(< ~counter~0 8)} #86#return; {25091#(< ~counter~0 8)} is VALID [2022-04-15 08:43:26,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {24708#true} assume true; {24708#true} is VALID [2022-04-15 08:43:26,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {24708#true} assume !(0 == ~cond); {24708#true} is VALID [2022-04-15 08:43:26,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {24708#true} ~cond := #in~cond; {24708#true} is VALID [2022-04-15 08:43:26,708 INFO L272 TraceCheckUtils]: 32: Hoare triple {25091#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24708#true} is VALID [2022-04-15 08:43:26,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {25091#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {25091#(< ~counter~0 8)} is VALID [2022-04-15 08:43:26,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {25161#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25091#(< ~counter~0 8)} is VALID [2022-04-15 08:43:26,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {25161#(< ~counter~0 7)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {25161#(< ~counter~0 7)} is VALID [2022-04-15 08:43:26,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {25161#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {25161#(< ~counter~0 7)} is VALID [2022-04-15 08:43:26,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {25171#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25161#(< ~counter~0 7)} is VALID [2022-04-15 08:43:26,710 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24708#true} {25171#(< ~counter~0 6)} #84#return; {25171#(< ~counter~0 6)} is VALID [2022-04-15 08:43:26,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {24708#true} assume true; {24708#true} is VALID [2022-04-15 08:43:26,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {24708#true} assume !(0 == ~cond); {24708#true} is VALID [2022-04-15 08:43:26,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {24708#true} ~cond := #in~cond; {24708#true} is VALID [2022-04-15 08:43:26,711 INFO L272 TraceCheckUtils]: 22: Hoare triple {25171#(< ~counter~0 6)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {24708#true} is VALID [2022-04-15 08:43:26,711 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {24708#true} {25171#(< ~counter~0 6)} #82#return; {25171#(< ~counter~0 6)} is VALID [2022-04-15 08:43:26,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {24708#true} assume true; {24708#true} is VALID [2022-04-15 08:43:26,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {24708#true} assume !(0 == ~cond); {24708#true} is VALID [2022-04-15 08:43:26,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {24708#true} ~cond := #in~cond; {24708#true} is VALID [2022-04-15 08:43:26,711 INFO L272 TraceCheckUtils]: 17: Hoare triple {25171#(< ~counter~0 6)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {24708#true} is VALID [2022-04-15 08:43:26,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {25171#(< ~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; {25171#(< ~counter~0 6)} is VALID [2022-04-15 08:43:26,712 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24708#true} {25171#(< ~counter~0 6)} #80#return; {25171#(< ~counter~0 6)} is VALID [2022-04-15 08:43:26,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {24708#true} assume true; {24708#true} is VALID [2022-04-15 08:43:26,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {24708#true} assume !(0 == ~cond); {24708#true} is VALID [2022-04-15 08:43:26,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {24708#true} ~cond := #in~cond; {24708#true} is VALID [2022-04-15 08:43:26,712 INFO L272 TraceCheckUtils]: 11: Hoare triple {25171#(< ~counter~0 6)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24708#true} is VALID [2022-04-15 08:43:26,713 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24708#true} {25171#(< ~counter~0 6)} #78#return; {25171#(< ~counter~0 6)} is VALID [2022-04-15 08:43:26,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {24708#true} assume true; {24708#true} is VALID [2022-04-15 08:43:26,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {24708#true} assume !(0 == ~cond); {24708#true} is VALID [2022-04-15 08:43:26,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {24708#true} ~cond := #in~cond; {24708#true} is VALID [2022-04-15 08:43:26,713 INFO L272 TraceCheckUtils]: 6: Hoare triple {25171#(< ~counter~0 6)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24708#true} is VALID [2022-04-15 08:43:26,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {25171#(< ~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; {25171#(< ~counter~0 6)} is VALID [2022-04-15 08:43:26,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {25171#(< ~counter~0 6)} call #t~ret8 := main(); {25171#(< ~counter~0 6)} is VALID [2022-04-15 08:43:26,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25171#(< ~counter~0 6)} {24708#true} #98#return; {25171#(< ~counter~0 6)} is VALID [2022-04-15 08:43:26,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {25171#(< ~counter~0 6)} assume true; {25171#(< ~counter~0 6)} is VALID [2022-04-15 08:43:26,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {24708#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; {25171#(< ~counter~0 6)} is VALID [2022-04-15 08:43:26,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {24708#true} call ULTIMATE.init(); {24708#true} is VALID [2022-04-15 08:43:26,715 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-15 08:43:26,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:43:26,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008642793] [2022-04-15 08:43:26,715 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:43:26,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623627910] [2022-04-15 08:43:26,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623627910] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:43:26,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:43:26,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 08:43:26,715 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:43:26,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [355704242] [2022-04-15 08:43:26,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [355704242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:43:26,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:43:26,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 08:43:26,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122478677] [2022-04-15 08:43:26,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:43:26,716 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-15 08:43:26,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:43:26,716 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-15 08:43:26,765 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-15 08:43:26,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 08:43:26,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:43:26,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 08:43:26,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:43:26,766 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-15 08:43:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:43:27,616 INFO L93 Difference]: Finished difference Result 463 states and 647 transitions. [2022-04-15 08:43:27,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 08:43:27,617 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-15 08:43:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:43:27,617 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-15 08:43:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-04-15 08:43:27,618 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-15 08:43:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-04-15 08:43:27,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 133 transitions. [2022-04-15 08:43:27,717 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-15 08:43:27,724 INFO L225 Difference]: With dead ends: 463 [2022-04-15 08:43:27,724 INFO L226 Difference]: Without dead ends: 329 [2022-04-15 08:43:27,724 INFO L912 BasicCegarLoop]: 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-15 08:43:27,725 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 38 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:43:27,725 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 184 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:43:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-15 08:43:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2022-04-15 08:43:28,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:43:28,251 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-15 08:43:28,252 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-15 08:43:28,252 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-15 08:43:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:43:28,258 INFO L93 Difference]: Finished difference Result 329 states and 435 transitions. [2022-04-15 08:43:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 435 transitions. [2022-04-15 08:43:28,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:43:28,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:43:28,260 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-15 08:43:28,260 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-15 08:43:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:43:28,266 INFO L93 Difference]: Finished difference Result 329 states and 435 transitions. [2022-04-15 08:43:28,266 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 435 transitions. [2022-04-15 08:43:28,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:43:28,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:43:28,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:43:28,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:43:28,267 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-15 08:43:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 433 transitions. [2022-04-15 08:43:28,276 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 433 transitions. Word has length 89 [2022-04-15 08:43:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:43:28,276 INFO L478 AbstractCegarLoop]: Abstraction has 327 states and 433 transitions. [2022-04-15 08:43:28,276 INFO L479 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-15 08:43:28,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 433 transitions. [2022-04-15 08:43:28,825 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-15 08:43:28,825 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 433 transitions. [2022-04-15 08:43:28,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 08:43:28,826 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:43:28,826 INFO L499 BasicCegarLoop]: 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-15 08:43:28,842 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-15 08:43:29,027 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 08:43:29,027 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:43:29,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:43:29,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 1 times [2022-04-15 08:43:29,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:43:29,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1433277497] [2022-04-15 08:43:29,028 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:43:29,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 2 times [2022-04-15 08:43:29,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:43:29,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029181974] [2022-04-15 08:43:29,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:43:29,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:43:29,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:43:29,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1317588634] [2022-04-15 08:43:29,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:43:29,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:43:29,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:43:29,038 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-15 08:43:29,040 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-15 08:43:29,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:43:29,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:43:29,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-15 08:43:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:43:29,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:43:33,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {27499#true} call ULTIMATE.init(); {27499#true} is VALID [2022-04-15 08:43:33,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {27499#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; {27499#true} is VALID [2022-04-15 08:43:33,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 08:43:33,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27499#true} {27499#true} #98#return; {27499#true} is VALID [2022-04-15 08:43:33,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {27499#true} call #t~ret8 := main(); {27499#true} is VALID [2022-04-15 08:43:33,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {27499#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; {27499#true} is VALID [2022-04-15 08:43:33,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {27499#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {27499#true} is VALID [2022-04-15 08:43:33,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 08:43:33,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 08:43:33,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 08:43:33,101 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27499#true} {27499#true} #78#return; {27499#true} is VALID [2022-04-15 08:43:33,101 INFO L272 TraceCheckUtils]: 11: Hoare triple {27499#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {27499#true} is VALID [2022-04-15 08:43:33,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {27499#true} ~cond := #in~cond; {27540#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 08:43:33,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {27540#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {27544#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:43:33,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {27544#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {27544#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:43:33,102 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {27544#(not (= |assume_abort_if_not_#in~cond| 0))} {27499#true} #80#return; {27551#(<= 1 main_~y~0)} is VALID [2022-04-15 08:43:33,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {27551#(<= 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; {27555#(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-15 08:43:33,103 INFO L272 TraceCheckUtils]: 17: Hoare triple {27555#(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)); {27499#true} is VALID [2022-04-15 08:43:33,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 08:43:33,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 08:43:33,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 08:43:33,104 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {27499#true} {27555#(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; {27555#(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-15 08:43:33,104 INFO L272 TraceCheckUtils]: 22: Hoare triple {27555#(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)); {27499#true} is VALID [2022-04-15 08:43:33,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 08:43:33,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 08:43:33,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 08:43:33,105 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27499#true} {27555#(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; {27555#(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-15 08:43:33,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {27555#(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; {27555#(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-15 08:43:33,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {27555#(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; {27555#(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-15 08:43:33,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {27555#(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; {27595#(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-15 08:43:33,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {27595#(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; {27595#(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-15 08:43:33,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {27595#(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; {27595#(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-15 08:43:33,107 INFO L272 TraceCheckUtils]: 32: Hoare triple {27595#(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)); {27499#true} is VALID [2022-04-15 08:43:33,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 08:43:33,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 08:43:33,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 08:43:33,108 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {27499#true} {27595#(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; {27595#(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-15 08:43:33,108 INFO L272 TraceCheckUtils]: 37: Hoare triple {27595#(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)); {27499#true} is VALID [2022-04-15 08:43:33,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 08:43:33,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 08:43:33,109 INFO L290 TraceCheckUtils]: 40: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 08:43:33,109 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {27499#true} {27595#(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; {27595#(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-15 08:43:33,109 INFO L272 TraceCheckUtils]: 42: Hoare triple {27595#(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)); {27499#true} is VALID [2022-04-15 08:43:33,109 INFO L290 TraceCheckUtils]: 43: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 08:43:33,109 INFO L290 TraceCheckUtils]: 44: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 08:43:33,110 INFO L290 TraceCheckUtils]: 45: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 08:43:33,110 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {27499#true} {27595#(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; {27595#(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-15 08:43:33,110 INFO L272 TraceCheckUtils]: 47: Hoare triple {27595#(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)); {27499#true} is VALID [2022-04-15 08:43:33,110 INFO L290 TraceCheckUtils]: 48: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 08:43:33,110 INFO L290 TraceCheckUtils]: 49: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 08:43:33,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 08:43:33,111 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {27499#true} {27595#(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; {27595#(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-15 08:43:33,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {27595#(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; {27665#(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-15 08:43:33,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {27665#(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; {27665#(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-15 08:43:33,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {27665#(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; {27665#(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-15 08:43:33,113 INFO L272 TraceCheckUtils]: 55: Hoare triple {27665#(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)); {27499#true} is VALID [2022-04-15 08:43:33,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {27499#true} ~cond := #in~cond; {27678#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:43:33,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {27678#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27682#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:43:33,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {27682#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27682#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:43:33,116 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {27682#(not (= |__VERIFIER_assert_#in~cond| 0))} {27665#(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; {27689#(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-15 08:43:33,116 INFO L272 TraceCheckUtils]: 60: Hoare triple {27689#(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)); {27499#true} is VALID [2022-04-15 08:43:33,116 INFO L290 TraceCheckUtils]: 61: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 08:43:33,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 08:43:33,116 INFO L290 TraceCheckUtils]: 63: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 08:43:33,117 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {27499#true} {27689#(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; {27689#(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-15 08:43:33,117 INFO L272 TraceCheckUtils]: 65: Hoare triple {27689#(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)); {27499#true} is VALID [2022-04-15 08:43:33,117 INFO L290 TraceCheckUtils]: 66: Hoare triple {27499#true} ~cond := #in~cond; {27678#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:43:33,117 INFO L290 TraceCheckUtils]: 67: Hoare triple {27678#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27682#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:43:33,118 INFO L290 TraceCheckUtils]: 68: Hoare triple {27682#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27682#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:43:33,118 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {27682#(not (= |__VERIFIER_assert_#in~cond| 0))} {27689#(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; {27689#(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-15 08:43:33,118 INFO L272 TraceCheckUtils]: 70: Hoare triple {27689#(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)); {27499#true} is VALID [2022-04-15 08:43:33,119 INFO L290 TraceCheckUtils]: 71: Hoare triple {27499#true} ~cond := #in~cond; {27678#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:43:33,119 INFO L290 TraceCheckUtils]: 72: Hoare triple {27678#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27682#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:43:33,119 INFO L290 TraceCheckUtils]: 73: Hoare triple {27682#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27682#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:43:33,120 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27682#(not (= |__VERIFIER_assert_#in~cond| 0))} {27689#(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; {27689#(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-15 08:43:33,120 INFO L290 TraceCheckUtils]: 75: Hoare triple {27689#(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); {27738#(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-15 08:43:33,121 INFO L290 TraceCheckUtils]: 76: Hoare triple {27738#(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; {27742#(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-15 08:43:33,122 INFO L290 TraceCheckUtils]: 77: Hoare triple {27742#(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; {27742#(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-15 08:43:33,122 INFO L290 TraceCheckUtils]: 78: Hoare triple {27742#(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; {27742#(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-15 08:43:33,123 INFO L290 TraceCheckUtils]: 79: Hoare triple {27742#(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; {27742#(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-15 08:43:33,123 INFO L290 TraceCheckUtils]: 80: Hoare triple {27742#(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; {27742#(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-15 08:43:33,123 INFO L290 TraceCheckUtils]: 81: Hoare triple {27742#(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; {27742#(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-15 08:43:33,124 INFO L272 TraceCheckUtils]: 82: Hoare triple {27742#(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)); {27499#true} is VALID [2022-04-15 08:43:33,124 INFO L290 TraceCheckUtils]: 83: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 08:43:33,124 INFO L290 TraceCheckUtils]: 84: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 08:43:33,124 INFO L290 TraceCheckUtils]: 85: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 08:43:33,124 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {27499#true} {27742#(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; {27742#(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-15 08:43:33,124 INFO L272 TraceCheckUtils]: 87: Hoare triple {27742#(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)); {27499#true} is VALID [2022-04-15 08:43:33,125 INFO L290 TraceCheckUtils]: 88: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 08:43:33,125 INFO L290 TraceCheckUtils]: 89: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 08:43:33,125 INFO L290 TraceCheckUtils]: 90: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 08:43:33,125 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {27499#true} {27742#(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; {27742#(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-15 08:43:33,125 INFO L272 TraceCheckUtils]: 92: Hoare triple {27742#(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)); {27499#true} is VALID [2022-04-15 08:43:33,126 INFO L290 TraceCheckUtils]: 93: Hoare triple {27499#true} ~cond := #in~cond; {27678#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:43:33,126 INFO L290 TraceCheckUtils]: 94: Hoare triple {27678#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27682#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:43:33,126 INFO L290 TraceCheckUtils]: 95: Hoare triple {27682#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27682#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:43:33,127 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {27682#(not (= |__VERIFIER_assert_#in~cond| 0))} {27742#(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; {27803#(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-15 08:43:33,129 INFO L272 TraceCheckUtils]: 97: Hoare triple {27803#(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)); {27807#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:43:33,130 INFO L290 TraceCheckUtils]: 98: Hoare triple {27807#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27811#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:43:33,130 INFO L290 TraceCheckUtils]: 99: Hoare triple {27811#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27500#false} is VALID [2022-04-15 08:43:33,130 INFO L290 TraceCheckUtils]: 100: Hoare triple {27500#false} assume !false; {27500#false} is VALID [2022-04-15 08:43:33,130 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-15 08:43:33,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:44:07,399 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 08:44:44,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:44:44,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029181974] [2022-04-15 08:44:44,597 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:44:44,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317588634] [2022-04-15 08:44:44,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317588634] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 08:44:44,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 08:44:44,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-15 08:44:44,597 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:44:44,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1433277497] [2022-04-15 08:44:44,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1433277497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:44:44,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:44:44,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 08:44:44,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870797978] [2022-04-15 08:44:44,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:44:44,598 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-15 08:44:44,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:44:44,598 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-15 08:44:44,670 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-15 08:44:44,670 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 08:44:44,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:44:44,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 08:44:44,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2022-04-15 08:44:44,671 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-15 08:44:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:44:58,185 INFO L93 Difference]: Finished difference Result 339 states and 443 transitions. [2022-04-15 08:44:58,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 08:44:58,185 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-15 08:44:58,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:44:58,185 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-15 08:44:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-15 08:44:58,186 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-15 08:44:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-15 08:44:58,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 118 transitions. [2022-04-15 08:44:58,327 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-15 08:44:58,333 INFO L225 Difference]: With dead ends: 339 [2022-04-15 08:44:58,334 INFO L226 Difference]: Without dead ends: 337 [2022-04-15 08:44:58,334 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-04-15 08:44:58,334 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 59 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 08:44:58,334 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 273 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 08:44:58,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-15 08:44:58,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-04-15 08:44:58,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:44:58,956 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-15 08:44:58,957 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-15 08:44:58,957 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-15 08:44:58,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:44:58,963 INFO L93 Difference]: Finished difference Result 337 states and 441 transitions. [2022-04-15 08:44:58,963 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2022-04-15 08:44:58,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:44:58,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:44:58,964 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-15 08:44:58,964 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-15 08:44:58,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:44:58,970 INFO L93 Difference]: Finished difference Result 337 states and 441 transitions. [2022-04-15 08:44:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2022-04-15 08:44:58,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:44:58,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:44:58,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:44:58,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:44:58,972 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-15 08:44:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 439 transitions. [2022-04-15 08:44:58,979 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 439 transitions. Word has length 101 [2022-04-15 08:44:58,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:44:58,979 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 439 transitions. [2022-04-15 08:44:58,979 INFO L479 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-15 08:44:58,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 335 states and 439 transitions. [2022-04-15 08:44:59,685 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-15 08:44:59,685 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2022-04-15 08:44:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 08:44:59,686 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:44:59,686 INFO L499 BasicCegarLoop]: 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-15 08:44:59,705 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-15 08:44:59,886 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:44:59,886 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:44:59,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:44:59,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1524088572, now seen corresponding path program 5 times [2022-04-15 08:44:59,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:44:59,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [683973323] [2022-04-15 08:44:59,887 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:44:59,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1524088572, now seen corresponding path program 6 times [2022-04-15 08:44:59,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:44:59,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735855365] [2022-04-15 08:44:59,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:44:59,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:44:59,903 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:44:59,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109053003] [2022-04-15 08:44:59,904 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 08:44:59,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:44:59,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:44:59,916 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-15 08:44:59,919 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-15 08:44:59,984 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 08:44:59,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:44:59,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 08:44:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:44:59,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:45:00,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {29934#true} call ULTIMATE.init(); {29934#true} is VALID [2022-04-15 08:45:00,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {29934#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; {29934#true} is VALID [2022-04-15 08:45:00,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:00,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29934#true} {29934#true} #98#return; {29934#true} is VALID [2022-04-15 08:45:00,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {29934#true} call #t~ret8 := main(); {29934#true} is VALID [2022-04-15 08:45:00,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {29934#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; {29934#true} is VALID [2022-04-15 08:45:00,221 INFO L272 TraceCheckUtils]: 6: Hoare triple {29934#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:00,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:00,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:00,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:00,222 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29934#true} {29934#true} #78#return; {29934#true} is VALID [2022-04-15 08:45:00,222 INFO L272 TraceCheckUtils]: 11: Hoare triple {29934#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:00,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:00,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:00,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:00,222 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29934#true} {29934#true} #80#return; {29934#true} is VALID [2022-04-15 08:45:00,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {29934#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; {29934#true} is VALID [2022-04-15 08:45:00,222 INFO L272 TraceCheckUtils]: 17: Hoare triple {29934#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:00,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:00,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:00,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:00,222 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {29934#true} {29934#true} #82#return; {29934#true} is VALID [2022-04-15 08:45:00,223 INFO L272 TraceCheckUtils]: 22: Hoare triple {29934#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:00,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:00,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:00,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:00,223 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29934#true} {29934#true} #84#return; {29934#true} is VALID [2022-04-15 08:45:00,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {29934#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29934#true} is VALID [2022-04-15 08:45:00,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {29934#true} assume !!(#t~post6 < 10);havoc #t~post6; {29934#true} is VALID [2022-04-15 08:45:00,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {29934#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {29934#true} is VALID [2022-04-15 08:45:00,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {29934#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29934#true} is VALID [2022-04-15 08:45:00,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {29934#true} assume !!(#t~post7 < 10);havoc #t~post7; {29934#true} is VALID [2022-04-15 08:45:00,223 INFO L272 TraceCheckUtils]: 32: Hoare triple {29934#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:00,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:00,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:00,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:00,224 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29934#true} {29934#true} #86#return; {29934#true} is VALID [2022-04-15 08:45:00,224 INFO L272 TraceCheckUtils]: 37: Hoare triple {29934#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:00,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:00,224 INFO L290 TraceCheckUtils]: 39: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:00,224 INFO L290 TraceCheckUtils]: 40: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:00,224 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29934#true} {29934#true} #88#return; {29934#true} is VALID [2022-04-15 08:45:00,224 INFO L272 TraceCheckUtils]: 42: Hoare triple {29934#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:00,224 INFO L290 TraceCheckUtils]: 43: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:00,224 INFO L290 TraceCheckUtils]: 44: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:00,224 INFO L290 TraceCheckUtils]: 45: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:00,224 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29934#true} {29934#true} #90#return; {29934#true} is VALID [2022-04-15 08:45:00,224 INFO L272 TraceCheckUtils]: 47: Hoare triple {29934#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)); {29934#true} is VALID [2022-04-15 08:45:00,224 INFO L290 TraceCheckUtils]: 48: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:00,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:00,225 INFO L290 TraceCheckUtils]: 50: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:00,225 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {29934#true} {29934#true} #92#return; {29934#true} is VALID [2022-04-15 08:45:00,225 INFO L290 TraceCheckUtils]: 52: Hoare triple {29934#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29934#true} is VALID [2022-04-15 08:45:00,225 INFO L290 TraceCheckUtils]: 53: Hoare triple {29934#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29934#true} is VALID [2022-04-15 08:45:00,225 INFO L290 TraceCheckUtils]: 54: Hoare triple {29934#true} assume !!(#t~post7 < 10);havoc #t~post7; {29934#true} is VALID [2022-04-15 08:45:00,225 INFO L272 TraceCheckUtils]: 55: Hoare triple {29934#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:00,225 INFO L290 TraceCheckUtils]: 56: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:00,225 INFO L290 TraceCheckUtils]: 57: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:00,225 INFO L290 TraceCheckUtils]: 58: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:00,225 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29934#true} {29934#true} #86#return; {29934#true} is VALID [2022-04-15 08:45:00,225 INFO L272 TraceCheckUtils]: 60: Hoare triple {29934#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:00,225 INFO L290 TraceCheckUtils]: 61: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:00,225 INFO L290 TraceCheckUtils]: 62: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:00,225 INFO L290 TraceCheckUtils]: 63: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:00,226 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29934#true} {29934#true} #88#return; {29934#true} is VALID [2022-04-15 08:45:00,226 INFO L272 TraceCheckUtils]: 65: Hoare triple {29934#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:00,226 INFO L290 TraceCheckUtils]: 66: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:00,226 INFO L290 TraceCheckUtils]: 67: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:00,226 INFO L290 TraceCheckUtils]: 68: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:00,226 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {29934#true} {29934#true} #90#return; {29934#true} is VALID [2022-04-15 08:45:00,226 INFO L272 TraceCheckUtils]: 70: Hoare triple {29934#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)); {29934#true} is VALID [2022-04-15 08:45:00,226 INFO L290 TraceCheckUtils]: 71: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:00,226 INFO L290 TraceCheckUtils]: 72: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:00,226 INFO L290 TraceCheckUtils]: 73: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:00,226 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29934#true} {29934#true} #92#return; {29934#true} is VALID [2022-04-15 08:45:00,226 INFO L290 TraceCheckUtils]: 75: Hoare triple {29934#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29934#true} is VALID [2022-04-15 08:45:00,226 INFO L290 TraceCheckUtils]: 76: Hoare triple {29934#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29934#true} is VALID [2022-04-15 08:45:00,226 INFO L290 TraceCheckUtils]: 77: Hoare triple {29934#true} assume !!(#t~post7 < 10);havoc #t~post7; {29934#true} is VALID [2022-04-15 08:45:00,226 INFO L272 TraceCheckUtils]: 78: Hoare triple {29934#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:00,227 INFO L290 TraceCheckUtils]: 79: Hoare triple {29934#true} ~cond := #in~cond; {30176#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:45:00,227 INFO L290 TraceCheckUtils]: 80: Hoare triple {30176#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:45:00,228 INFO L290 TraceCheckUtils]: 81: Hoare triple {30180#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:45:00,228 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30180#(not (= |__VERIFIER_assert_#in~cond| 0))} {29934#true} #86#return; {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:45:00,229 INFO L272 TraceCheckUtils]: 83: Hoare triple {30187#(= 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)); {29934#true} is VALID [2022-04-15 08:45:00,229 INFO L290 TraceCheckUtils]: 84: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:00,229 INFO L290 TraceCheckUtils]: 85: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:00,229 INFO L290 TraceCheckUtils]: 86: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:00,230 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {29934#true} {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:45:00,230 INFO L272 TraceCheckUtils]: 88: Hoare triple {30187#(= 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)); {29934#true} is VALID [2022-04-15 08:45:00,230 INFO L290 TraceCheckUtils]: 89: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:00,230 INFO L290 TraceCheckUtils]: 90: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:00,230 INFO L290 TraceCheckUtils]: 91: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:00,231 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {29934#true} {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:45:00,231 INFO L272 TraceCheckUtils]: 93: Hoare triple {30187#(= 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)); {29934#true} is VALID [2022-04-15 08:45:00,231 INFO L290 TraceCheckUtils]: 94: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:00,231 INFO L290 TraceCheckUtils]: 95: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:00,231 INFO L290 TraceCheckUtils]: 96: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:00,232 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {29934#true} {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:45:00,235 INFO L290 TraceCheckUtils]: 98: Hoare triple {30187#(= 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; {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:45:00,235 INFO L290 TraceCheckUtils]: 99: Hoare triple {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:45:00,236 INFO L290 TraceCheckUtils]: 100: Hoare triple {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:45:00,236 INFO L272 TraceCheckUtils]: 101: Hoare triple {30187#(= 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)); {30245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:45:00,237 INFO L290 TraceCheckUtils]: 102: Hoare triple {30245#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:45:00,237 INFO L290 TraceCheckUtils]: 103: Hoare triple {30249#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29935#false} is VALID [2022-04-15 08:45:00,237 INFO L290 TraceCheckUtils]: 104: Hoare triple {29935#false} assume !false; {29935#false} is VALID [2022-04-15 08:45:00,237 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-15 08:45:00,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:45:10,025 INFO L290 TraceCheckUtils]: 104: Hoare triple {29935#false} assume !false; {29935#false} is VALID [2022-04-15 08:45:10,025 INFO L290 TraceCheckUtils]: 103: Hoare triple {30249#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29935#false} is VALID [2022-04-15 08:45:10,026 INFO L290 TraceCheckUtils]: 102: Hoare triple {30245#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:45:10,026 INFO L272 TraceCheckUtils]: 101: Hoare triple {30187#(= 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)); {30245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:45:10,027 INFO L290 TraceCheckUtils]: 100: Hoare triple {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:45:10,027 INFO L290 TraceCheckUtils]: 99: Hoare triple {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:45:10,033 INFO L290 TraceCheckUtils]: 98: Hoare triple {30187#(= 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; {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:45:10,034 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {29934#true} {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:45:10,034 INFO L290 TraceCheckUtils]: 96: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:10,034 INFO L290 TraceCheckUtils]: 95: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:10,034 INFO L290 TraceCheckUtils]: 94: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:10,034 INFO L272 TraceCheckUtils]: 93: Hoare triple {30187#(= 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)); {29934#true} is VALID [2022-04-15 08:45:10,035 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {29934#true} {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:45:10,035 INFO L290 TraceCheckUtils]: 91: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:10,035 INFO L290 TraceCheckUtils]: 90: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:10,035 INFO L290 TraceCheckUtils]: 89: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:10,035 INFO L272 TraceCheckUtils]: 88: Hoare triple {30187#(= 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)); {29934#true} is VALID [2022-04-15 08:45:10,035 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {29934#true} {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:45:10,036 INFO L290 TraceCheckUtils]: 86: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:10,036 INFO L290 TraceCheckUtils]: 85: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:10,036 INFO L290 TraceCheckUtils]: 84: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:10,036 INFO L272 TraceCheckUtils]: 83: Hoare triple {30187#(= 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)); {29934#true} is VALID [2022-04-15 08:45:10,036 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30180#(not (= |__VERIFIER_assert_#in~cond| 0))} {29934#true} #86#return; {30187#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-15 08:45:10,037 INFO L290 TraceCheckUtils]: 81: Hoare triple {30180#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:45:10,037 INFO L290 TraceCheckUtils]: 80: Hoare triple {30331#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {30180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:45:10,037 INFO L290 TraceCheckUtils]: 79: Hoare triple {29934#true} ~cond := #in~cond; {30331#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 08:45:10,037 INFO L272 TraceCheckUtils]: 78: Hoare triple {29934#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:10,037 INFO L290 TraceCheckUtils]: 77: Hoare triple {29934#true} assume !!(#t~post7 < 10);havoc #t~post7; {29934#true} is VALID [2022-04-15 08:45:10,037 INFO L290 TraceCheckUtils]: 76: Hoare triple {29934#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29934#true} is VALID [2022-04-15 08:45:10,038 INFO L290 TraceCheckUtils]: 75: Hoare triple {29934#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29934#true} is VALID [2022-04-15 08:45:10,038 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29934#true} {29934#true} #92#return; {29934#true} is VALID [2022-04-15 08:45:10,038 INFO L290 TraceCheckUtils]: 73: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:10,038 INFO L290 TraceCheckUtils]: 72: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:10,038 INFO L290 TraceCheckUtils]: 71: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:10,038 INFO L272 TraceCheckUtils]: 70: Hoare triple {29934#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)); {29934#true} is VALID [2022-04-15 08:45:10,038 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {29934#true} {29934#true} #90#return; {29934#true} is VALID [2022-04-15 08:45:10,038 INFO L290 TraceCheckUtils]: 68: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:10,038 INFO L290 TraceCheckUtils]: 67: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:10,038 INFO L290 TraceCheckUtils]: 66: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:10,038 INFO L272 TraceCheckUtils]: 65: Hoare triple {29934#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:10,038 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29934#true} {29934#true} #88#return; {29934#true} is VALID [2022-04-15 08:45:10,038 INFO L290 TraceCheckUtils]: 63: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:10,038 INFO L290 TraceCheckUtils]: 62: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:10,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:10,039 INFO L272 TraceCheckUtils]: 60: Hoare triple {29934#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:10,039 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29934#true} {29934#true} #86#return; {29934#true} is VALID [2022-04-15 08:45:10,039 INFO L290 TraceCheckUtils]: 58: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:10,039 INFO L290 TraceCheckUtils]: 57: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:10,039 INFO L290 TraceCheckUtils]: 56: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:10,039 INFO L272 TraceCheckUtils]: 55: Hoare triple {29934#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:10,039 INFO L290 TraceCheckUtils]: 54: Hoare triple {29934#true} assume !!(#t~post7 < 10);havoc #t~post7; {29934#true} is VALID [2022-04-15 08:45:10,039 INFO L290 TraceCheckUtils]: 53: Hoare triple {29934#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29934#true} is VALID [2022-04-15 08:45:10,039 INFO L290 TraceCheckUtils]: 52: Hoare triple {29934#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29934#true} is VALID [2022-04-15 08:45:10,039 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {29934#true} {29934#true} #92#return; {29934#true} is VALID [2022-04-15 08:45:10,039 INFO L290 TraceCheckUtils]: 50: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:10,039 INFO L290 TraceCheckUtils]: 49: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:10,039 INFO L290 TraceCheckUtils]: 48: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:10,040 INFO L272 TraceCheckUtils]: 47: Hoare triple {29934#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)); {29934#true} is VALID [2022-04-15 08:45:10,040 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29934#true} {29934#true} #90#return; {29934#true} is VALID [2022-04-15 08:45:10,040 INFO L290 TraceCheckUtils]: 45: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:10,040 INFO L290 TraceCheckUtils]: 44: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:10,040 INFO L290 TraceCheckUtils]: 43: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:10,040 INFO L272 TraceCheckUtils]: 42: Hoare triple {29934#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:10,040 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29934#true} {29934#true} #88#return; {29934#true} is VALID [2022-04-15 08:45:10,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:10,040 INFO L290 TraceCheckUtils]: 39: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:10,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:10,040 INFO L272 TraceCheckUtils]: 37: Hoare triple {29934#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:10,040 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29934#true} {29934#true} #86#return; {29934#true} is VALID [2022-04-15 08:45:10,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:10,041 INFO L290 TraceCheckUtils]: 34: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:10,041 INFO L290 TraceCheckUtils]: 33: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:10,041 INFO L272 TraceCheckUtils]: 32: Hoare triple {29934#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:10,041 INFO L290 TraceCheckUtils]: 31: Hoare triple {29934#true} assume !!(#t~post7 < 10);havoc #t~post7; {29934#true} is VALID [2022-04-15 08:45:10,041 INFO L290 TraceCheckUtils]: 30: Hoare triple {29934#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29934#true} is VALID [2022-04-15 08:45:10,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {29934#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {29934#true} is VALID [2022-04-15 08:45:10,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {29934#true} assume !!(#t~post6 < 10);havoc #t~post6; {29934#true} is VALID [2022-04-15 08:45:10,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {29934#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29934#true} is VALID [2022-04-15 08:45:10,041 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29934#true} {29934#true} #84#return; {29934#true} is VALID [2022-04-15 08:45:10,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:10,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:10,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:10,041 INFO L272 TraceCheckUtils]: 22: Hoare triple {29934#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:10,041 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {29934#true} {29934#true} #82#return; {29934#true} is VALID [2022-04-15 08:45:10,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:10,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:10,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:10,042 INFO L272 TraceCheckUtils]: 17: Hoare triple {29934#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:10,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {29934#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; {29934#true} is VALID [2022-04-15 08:45:10,042 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29934#true} {29934#true} #80#return; {29934#true} is VALID [2022-04-15 08:45:10,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:10,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:10,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:10,042 INFO L272 TraceCheckUtils]: 11: Hoare triple {29934#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:10,042 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29934#true} {29934#true} #78#return; {29934#true} is VALID [2022-04-15 08:45:10,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:10,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {29934#true} assume !(0 == ~cond); {29934#true} is VALID [2022-04-15 08:45:10,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {29934#true} ~cond := #in~cond; {29934#true} is VALID [2022-04-15 08:45:10,043 INFO L272 TraceCheckUtils]: 6: Hoare triple {29934#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {29934#true} is VALID [2022-04-15 08:45:10,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {29934#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; {29934#true} is VALID [2022-04-15 08:45:10,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {29934#true} call #t~ret8 := main(); {29934#true} is VALID [2022-04-15 08:45:10,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29934#true} {29934#true} #98#return; {29934#true} is VALID [2022-04-15 08:45:10,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {29934#true} assume true; {29934#true} is VALID [2022-04-15 08:45:10,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {29934#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; {29934#true} is VALID [2022-04-15 08:45:10,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {29934#true} call ULTIMATE.init(); {29934#true} is VALID [2022-04-15 08:45:10,043 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-15 08:45:10,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:45:10,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735855365] [2022-04-15 08:45:10,044 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:45:10,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109053003] [2022-04-15 08:45:10,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109053003] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:45:10,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:45:10,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-04-15 08:45:10,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:45:10,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [683973323] [2022-04-15 08:45:10,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [683973323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:45:10,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:45:10,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 08:45:10,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235384649] [2022-04-15 08:45:10,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:45:10,045 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-15 08:45:10,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:45:10,045 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-15 08:45:10,088 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-15 08:45:10,089 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 08:45:10,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:45:10,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 08:45:10,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 08:45:10,089 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-15 08:45:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:10,842 INFO L93 Difference]: Finished difference Result 341 states and 444 transitions. [2022-04-15 08:45:10,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 08:45:10,842 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-15 08:45:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:45:10,843 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-15 08:45:10,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-15 08:45:10,843 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-15 08:45:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-15 08:45:10,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-15 08:45:10,879 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-15 08:45:10,885 INFO L225 Difference]: With dead ends: 341 [2022-04-15 08:45:10,885 INFO L226 Difference]: Without dead ends: 339 [2022-04-15 08:45:10,886 INFO L912 BasicCegarLoop]: 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-15 08:45:10,886 INFO L913 BasicCegarLoop]: 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-15 08:45:10,886 INFO L914 BasicCegarLoop]: 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-15 08:45:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-15 08:45:11,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2022-04-15 08:45:11,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:45:11,449 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-15 08:45:11,449 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-15 08:45:11,449 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-15 08:45:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:11,455 INFO L93 Difference]: Finished difference Result 339 states and 442 transitions. [2022-04-15 08:45:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-15 08:45:11,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:45:11,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:45:11,456 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-15 08:45:11,456 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-15 08:45:11,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:11,461 INFO L93 Difference]: Finished difference Result 339 states and 442 transitions. [2022-04-15 08:45:11,461 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-15 08:45:11,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:45:11,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:45:11,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:45:11,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:45:11,462 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-15 08:45:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 442 transitions. [2022-04-15 08:45:11,471 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 442 transitions. Word has length 105 [2022-04-15 08:45:11,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:45:11,471 INFO L478 AbstractCegarLoop]: Abstraction has 339 states and 442 transitions. [2022-04-15 08:45:11,471 INFO L479 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-15 08:45:11,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 339 states and 442 transitions. [2022-04-15 08:45:12,096 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-15 08:45:12,097 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-15 08:45:12,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-15 08:45:12,097 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:45:12,097 INFO L499 BasicCegarLoop]: 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-15 08:45:12,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 08:45:12,298 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:45:12,298 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:45:12,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:45:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1026601615, now seen corresponding path program 3 times [2022-04-15 08:45:12,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:45:12,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1244525637] [2022-04-15 08:45:12,299 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:45:12,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1026601615, now seen corresponding path program 4 times [2022-04-15 08:45:12,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:45:12,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19311030] [2022-04-15 08:45:12,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:45:12,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:45:12,308 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:45:12,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1420858139] [2022-04-15 08:45:12,308 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 08:45:12,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:45:12,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:45:12,309 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-15 08:45:12,309 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-15 08:45:12,366 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 08:45:12,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:45:12,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 08:45:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:45:12,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:45:12,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {32613#true} call ULTIMATE.init(); {32613#true} is VALID [2022-04-15 08:45:12,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {32613#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; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {32621#(<= ~counter~0 0)} assume true; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32621#(<= ~counter~0 0)} {32613#true} #98#return; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {32621#(<= ~counter~0 0)} call #t~ret8 := main(); {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {32621#(<= ~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; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,748 INFO L272 TraceCheckUtils]: 6: Hoare triple {32621#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {32621#(<= ~counter~0 0)} ~cond := #in~cond; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {32621#(<= ~counter~0 0)} assume !(0 == ~cond); {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {32621#(<= ~counter~0 0)} assume true; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,749 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32621#(<= ~counter~0 0)} {32621#(<= ~counter~0 0)} #78#return; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,749 INFO L272 TraceCheckUtils]: 11: Hoare triple {32621#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {32621#(<= ~counter~0 0)} ~cond := #in~cond; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {32621#(<= ~counter~0 0)} assume !(0 == ~cond); {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {32621#(<= ~counter~0 0)} assume true; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,750 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32621#(<= ~counter~0 0)} {32621#(<= ~counter~0 0)} #80#return; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {32621#(<= ~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; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,751 INFO L272 TraceCheckUtils]: 17: Hoare triple {32621#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {32621#(<= ~counter~0 0)} ~cond := #in~cond; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {32621#(<= ~counter~0 0)} assume !(0 == ~cond); {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {32621#(<= ~counter~0 0)} assume true; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,752 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {32621#(<= ~counter~0 0)} {32621#(<= ~counter~0 0)} #82#return; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,752 INFO L272 TraceCheckUtils]: 22: Hoare triple {32621#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {32621#(<= ~counter~0 0)} ~cond := #in~cond; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {32621#(<= ~counter~0 0)} assume !(0 == ~cond); {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {32621#(<= ~counter~0 0)} assume true; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,754 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {32621#(<= ~counter~0 0)} {32621#(<= ~counter~0 0)} #84#return; {32621#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:12,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {32621#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32700#(<= ~counter~0 1)} is VALID [2022-04-15 08:45:12,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {32700#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {32700#(<= ~counter~0 1)} is VALID [2022-04-15 08:45:12,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {32700#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {32700#(<= ~counter~0 1)} is VALID [2022-04-15 08:45:12,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {32700#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {32710#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,756 INFO L272 TraceCheckUtils]: 32: Hoare triple {32710#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {32710#(<= ~counter~0 2)} ~cond := #in~cond; {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {32710#(<= ~counter~0 2)} assume !(0 == ~cond); {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {32710#(<= ~counter~0 2)} assume true; {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,758 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {32710#(<= ~counter~0 2)} {32710#(<= ~counter~0 2)} #86#return; {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,758 INFO L272 TraceCheckUtils]: 37: Hoare triple {32710#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {32710#(<= ~counter~0 2)} ~cond := #in~cond; {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {32710#(<= ~counter~0 2)} assume !(0 == ~cond); {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {32710#(<= ~counter~0 2)} assume true; {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,760 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {32710#(<= ~counter~0 2)} {32710#(<= ~counter~0 2)} #88#return; {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,760 INFO L272 TraceCheckUtils]: 42: Hoare triple {32710#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,760 INFO L290 TraceCheckUtils]: 43: Hoare triple {32710#(<= ~counter~0 2)} ~cond := #in~cond; {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {32710#(<= ~counter~0 2)} assume !(0 == ~cond); {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,761 INFO L290 TraceCheckUtils]: 45: Hoare triple {32710#(<= ~counter~0 2)} assume true; {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,761 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {32710#(<= ~counter~0 2)} {32710#(<= ~counter~0 2)} #90#return; {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,762 INFO L272 TraceCheckUtils]: 47: Hoare triple {32710#(<= ~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)); {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,762 INFO L290 TraceCheckUtils]: 48: Hoare triple {32710#(<= ~counter~0 2)} ~cond := #in~cond; {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,763 INFO L290 TraceCheckUtils]: 49: Hoare triple {32710#(<= ~counter~0 2)} assume !(0 == ~cond); {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,763 INFO L290 TraceCheckUtils]: 50: Hoare triple {32710#(<= ~counter~0 2)} assume true; {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,763 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {32710#(<= ~counter~0 2)} {32710#(<= ~counter~0 2)} #92#return; {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,764 INFO L290 TraceCheckUtils]: 52: Hoare triple {32710#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32710#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:12,765 INFO L290 TraceCheckUtils]: 53: Hoare triple {32710#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,765 INFO L290 TraceCheckUtils]: 54: Hoare triple {32780#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,765 INFO L272 TraceCheckUtils]: 55: Hoare triple {32780#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,766 INFO L290 TraceCheckUtils]: 56: Hoare triple {32780#(<= ~counter~0 3)} ~cond := #in~cond; {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {32780#(<= ~counter~0 3)} assume !(0 == ~cond); {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {32780#(<= ~counter~0 3)} assume true; {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,767 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32780#(<= ~counter~0 3)} {32780#(<= ~counter~0 3)} #86#return; {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,767 INFO L272 TraceCheckUtils]: 60: Hoare triple {32780#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,767 INFO L290 TraceCheckUtils]: 61: Hoare triple {32780#(<= ~counter~0 3)} ~cond := #in~cond; {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,768 INFO L290 TraceCheckUtils]: 62: Hoare triple {32780#(<= ~counter~0 3)} assume !(0 == ~cond); {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,768 INFO L290 TraceCheckUtils]: 63: Hoare triple {32780#(<= ~counter~0 3)} assume true; {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,768 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32780#(<= ~counter~0 3)} {32780#(<= ~counter~0 3)} #88#return; {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,770 INFO L272 TraceCheckUtils]: 65: Hoare triple {32780#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,771 INFO L290 TraceCheckUtils]: 66: Hoare triple {32780#(<= ~counter~0 3)} ~cond := #in~cond; {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,771 INFO L290 TraceCheckUtils]: 67: Hoare triple {32780#(<= ~counter~0 3)} assume !(0 == ~cond); {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,771 INFO L290 TraceCheckUtils]: 68: Hoare triple {32780#(<= ~counter~0 3)} assume true; {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,772 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {32780#(<= ~counter~0 3)} {32780#(<= ~counter~0 3)} #90#return; {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,772 INFO L272 TraceCheckUtils]: 70: Hoare triple {32780#(<= ~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)); {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,773 INFO L290 TraceCheckUtils]: 71: Hoare triple {32780#(<= ~counter~0 3)} ~cond := #in~cond; {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,773 INFO L290 TraceCheckUtils]: 72: Hoare triple {32780#(<= ~counter~0 3)} assume !(0 == ~cond); {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,779 INFO L290 TraceCheckUtils]: 73: Hoare triple {32780#(<= ~counter~0 3)} assume true; {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,780 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {32780#(<= ~counter~0 3)} {32780#(<= ~counter~0 3)} #92#return; {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,780 INFO L290 TraceCheckUtils]: 75: Hoare triple {32780#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32780#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:12,781 INFO L290 TraceCheckUtils]: 76: Hoare triple {32780#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,782 INFO L290 TraceCheckUtils]: 77: Hoare triple {32850#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,782 INFO L272 TraceCheckUtils]: 78: Hoare triple {32850#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,782 INFO L290 TraceCheckUtils]: 79: Hoare triple {32850#(<= ~counter~0 4)} ~cond := #in~cond; {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,783 INFO L290 TraceCheckUtils]: 80: Hoare triple {32850#(<= ~counter~0 4)} assume !(0 == ~cond); {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,783 INFO L290 TraceCheckUtils]: 81: Hoare triple {32850#(<= ~counter~0 4)} assume true; {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,784 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {32850#(<= ~counter~0 4)} {32850#(<= ~counter~0 4)} #86#return; {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,784 INFO L272 TraceCheckUtils]: 83: Hoare triple {32850#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,784 INFO L290 TraceCheckUtils]: 84: Hoare triple {32850#(<= ~counter~0 4)} ~cond := #in~cond; {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,785 INFO L290 TraceCheckUtils]: 85: Hoare triple {32850#(<= ~counter~0 4)} assume !(0 == ~cond); {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,785 INFO L290 TraceCheckUtils]: 86: Hoare triple {32850#(<= ~counter~0 4)} assume true; {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,786 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32850#(<= ~counter~0 4)} {32850#(<= ~counter~0 4)} #88#return; {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,786 INFO L272 TraceCheckUtils]: 88: Hoare triple {32850#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,786 INFO L290 TraceCheckUtils]: 89: Hoare triple {32850#(<= ~counter~0 4)} ~cond := #in~cond; {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,787 INFO L290 TraceCheckUtils]: 90: Hoare triple {32850#(<= ~counter~0 4)} assume !(0 == ~cond); {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,787 INFO L290 TraceCheckUtils]: 91: Hoare triple {32850#(<= ~counter~0 4)} assume true; {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,788 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32850#(<= ~counter~0 4)} {32850#(<= ~counter~0 4)} #90#return; {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,788 INFO L272 TraceCheckUtils]: 93: Hoare triple {32850#(<= ~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)); {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,788 INFO L290 TraceCheckUtils]: 94: Hoare triple {32850#(<= ~counter~0 4)} ~cond := #in~cond; {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,789 INFO L290 TraceCheckUtils]: 95: Hoare triple {32850#(<= ~counter~0 4)} assume !(0 == ~cond); {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,789 INFO L290 TraceCheckUtils]: 96: Hoare triple {32850#(<= ~counter~0 4)} assume true; {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,790 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {32850#(<= ~counter~0 4)} {32850#(<= ~counter~0 4)} #92#return; {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,790 INFO L290 TraceCheckUtils]: 98: Hoare triple {32850#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,790 INFO L290 TraceCheckUtils]: 99: Hoare triple {32850#(<= ~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; {32850#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:12,791 INFO L290 TraceCheckUtils]: 100: Hoare triple {32850#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32923#(<= |main_#t~post6| 4)} is VALID [2022-04-15 08:45:12,791 INFO L290 TraceCheckUtils]: 101: Hoare triple {32923#(<= |main_#t~post6| 4)} assume !(#t~post6 < 10);havoc #t~post6; {32614#false} is VALID [2022-04-15 08:45:12,791 INFO L272 TraceCheckUtils]: 102: Hoare triple {32614#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {32614#false} is VALID [2022-04-15 08:45:12,791 INFO L290 TraceCheckUtils]: 103: Hoare triple {32614#false} ~cond := #in~cond; {32614#false} is VALID [2022-04-15 08:45:12,791 INFO L290 TraceCheckUtils]: 104: Hoare triple {32614#false} assume 0 == ~cond; {32614#false} is VALID [2022-04-15 08:45:12,791 INFO L290 TraceCheckUtils]: 105: Hoare triple {32614#false} assume !false; {32614#false} is VALID [2022-04-15 08:45:12,792 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-15 08:45:12,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:45:13,168 INFO L290 TraceCheckUtils]: 105: Hoare triple {32614#false} assume !false; {32614#false} is VALID [2022-04-15 08:45:13,169 INFO L290 TraceCheckUtils]: 104: Hoare triple {32614#false} assume 0 == ~cond; {32614#false} is VALID [2022-04-15 08:45:13,169 INFO L290 TraceCheckUtils]: 103: Hoare triple {32614#false} ~cond := #in~cond; {32614#false} is VALID [2022-04-15 08:45:13,169 INFO L272 TraceCheckUtils]: 102: Hoare triple {32614#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {32614#false} is VALID [2022-04-15 08:45:13,169 INFO L290 TraceCheckUtils]: 101: Hoare triple {32951#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {32614#false} is VALID [2022-04-15 08:45:13,169 INFO L290 TraceCheckUtils]: 100: Hoare triple {32955#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32951#(< |main_#t~post6| 10)} is VALID [2022-04-15 08:45:13,170 INFO L290 TraceCheckUtils]: 99: Hoare triple {32955#(< ~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; {32955#(< ~counter~0 10)} is VALID [2022-04-15 08:45:13,170 INFO L290 TraceCheckUtils]: 98: Hoare triple {32955#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {32955#(< ~counter~0 10)} is VALID [2022-04-15 08:45:13,170 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {32613#true} {32955#(< ~counter~0 10)} #92#return; {32955#(< ~counter~0 10)} is VALID [2022-04-15 08:45:13,171 INFO L290 TraceCheckUtils]: 96: Hoare triple {32613#true} assume true; {32613#true} is VALID [2022-04-15 08:45:13,171 INFO L290 TraceCheckUtils]: 95: Hoare triple {32613#true} assume !(0 == ~cond); {32613#true} is VALID [2022-04-15 08:45:13,171 INFO L290 TraceCheckUtils]: 94: Hoare triple {32613#true} ~cond := #in~cond; {32613#true} is VALID [2022-04-15 08:45:13,171 INFO L272 TraceCheckUtils]: 93: Hoare triple {32955#(< ~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)); {32613#true} is VALID [2022-04-15 08:45:13,171 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32613#true} {32955#(< ~counter~0 10)} #90#return; {32955#(< ~counter~0 10)} is VALID [2022-04-15 08:45:13,171 INFO L290 TraceCheckUtils]: 91: Hoare triple {32613#true} assume true; {32613#true} is VALID [2022-04-15 08:45:13,171 INFO L290 TraceCheckUtils]: 90: Hoare triple {32613#true} assume !(0 == ~cond); {32613#true} is VALID [2022-04-15 08:45:13,171 INFO L290 TraceCheckUtils]: 89: Hoare triple {32613#true} ~cond := #in~cond; {32613#true} is VALID [2022-04-15 08:45:13,172 INFO L272 TraceCheckUtils]: 88: Hoare triple {32955#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32613#true} is VALID [2022-04-15 08:45:13,172 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32613#true} {32955#(< ~counter~0 10)} #88#return; {32955#(< ~counter~0 10)} is VALID [2022-04-15 08:45:13,172 INFO L290 TraceCheckUtils]: 86: Hoare triple {32613#true} assume true; {32613#true} is VALID [2022-04-15 08:45:13,172 INFO L290 TraceCheckUtils]: 85: Hoare triple {32613#true} assume !(0 == ~cond); {32613#true} is VALID [2022-04-15 08:45:13,172 INFO L290 TraceCheckUtils]: 84: Hoare triple {32613#true} ~cond := #in~cond; {32613#true} is VALID [2022-04-15 08:45:13,172 INFO L272 TraceCheckUtils]: 83: Hoare triple {32955#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32613#true} is VALID [2022-04-15 08:45:13,173 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {32613#true} {32955#(< ~counter~0 10)} #86#return; {32955#(< ~counter~0 10)} is VALID [2022-04-15 08:45:13,173 INFO L290 TraceCheckUtils]: 81: Hoare triple {32613#true} assume true; {32613#true} is VALID [2022-04-15 08:45:13,173 INFO L290 TraceCheckUtils]: 80: Hoare triple {32613#true} assume !(0 == ~cond); {32613#true} is VALID [2022-04-15 08:45:13,173 INFO L290 TraceCheckUtils]: 79: Hoare triple {32613#true} ~cond := #in~cond; {32613#true} is VALID [2022-04-15 08:45:13,173 INFO L272 TraceCheckUtils]: 78: Hoare triple {32955#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32613#true} is VALID [2022-04-15 08:45:13,173 INFO L290 TraceCheckUtils]: 77: Hoare triple {32955#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {32955#(< ~counter~0 10)} is VALID [2022-04-15 08:45:13,174 INFO L290 TraceCheckUtils]: 76: Hoare triple {33028#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32955#(< ~counter~0 10)} is VALID [2022-04-15 08:45:13,174 INFO L290 TraceCheckUtils]: 75: Hoare triple {33028#(< ~counter~0 9)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {33028#(< ~counter~0 9)} is VALID [2022-04-15 08:45:13,175 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {32613#true} {33028#(< ~counter~0 9)} #92#return; {33028#(< ~counter~0 9)} is VALID [2022-04-15 08:45:13,175 INFO L290 TraceCheckUtils]: 73: Hoare triple {32613#true} assume true; {32613#true} is VALID [2022-04-15 08:45:13,175 INFO L290 TraceCheckUtils]: 72: Hoare triple {32613#true} assume !(0 == ~cond); {32613#true} is VALID [2022-04-15 08:45:13,175 INFO L290 TraceCheckUtils]: 71: Hoare triple {32613#true} ~cond := #in~cond; {32613#true} is VALID [2022-04-15 08:45:13,175 INFO L272 TraceCheckUtils]: 70: Hoare triple {33028#(< ~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)); {32613#true} is VALID [2022-04-15 08:45:13,176 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {32613#true} {33028#(< ~counter~0 9)} #90#return; {33028#(< ~counter~0 9)} is VALID [2022-04-15 08:45:13,176 INFO L290 TraceCheckUtils]: 68: Hoare triple {32613#true} assume true; {32613#true} is VALID [2022-04-15 08:45:13,176 INFO L290 TraceCheckUtils]: 67: Hoare triple {32613#true} assume !(0 == ~cond); {32613#true} is VALID [2022-04-15 08:45:13,176 INFO L290 TraceCheckUtils]: 66: Hoare triple {32613#true} ~cond := #in~cond; {32613#true} is VALID [2022-04-15 08:45:13,176 INFO L272 TraceCheckUtils]: 65: Hoare triple {33028#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32613#true} is VALID [2022-04-15 08:45:13,177 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32613#true} {33028#(< ~counter~0 9)} #88#return; {33028#(< ~counter~0 9)} is VALID [2022-04-15 08:45:13,177 INFO L290 TraceCheckUtils]: 63: Hoare triple {32613#true} assume true; {32613#true} is VALID [2022-04-15 08:45:13,177 INFO L290 TraceCheckUtils]: 62: Hoare triple {32613#true} assume !(0 == ~cond); {32613#true} is VALID [2022-04-15 08:45:13,177 INFO L290 TraceCheckUtils]: 61: Hoare triple {32613#true} ~cond := #in~cond; {32613#true} is VALID [2022-04-15 08:45:13,177 INFO L272 TraceCheckUtils]: 60: Hoare triple {33028#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32613#true} is VALID [2022-04-15 08:45:13,177 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32613#true} {33028#(< ~counter~0 9)} #86#return; {33028#(< ~counter~0 9)} is VALID [2022-04-15 08:45:13,177 INFO L290 TraceCheckUtils]: 58: Hoare triple {32613#true} assume true; {32613#true} is VALID [2022-04-15 08:45:13,178 INFO L290 TraceCheckUtils]: 57: Hoare triple {32613#true} assume !(0 == ~cond); {32613#true} is VALID [2022-04-15 08:45:13,178 INFO L290 TraceCheckUtils]: 56: Hoare triple {32613#true} ~cond := #in~cond; {32613#true} is VALID [2022-04-15 08:45:13,178 INFO L272 TraceCheckUtils]: 55: Hoare triple {33028#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32613#true} is VALID [2022-04-15 08:45:13,178 INFO L290 TraceCheckUtils]: 54: Hoare triple {33028#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {33028#(< ~counter~0 9)} is VALID [2022-04-15 08:45:13,178 INFO L290 TraceCheckUtils]: 53: Hoare triple {33098#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33028#(< ~counter~0 9)} is VALID [2022-04-15 08:45:13,179 INFO L290 TraceCheckUtils]: 52: Hoare triple {33098#(< ~counter~0 8)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {33098#(< ~counter~0 8)} is VALID [2022-04-15 08:45:13,179 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {32613#true} {33098#(< ~counter~0 8)} #92#return; {33098#(< ~counter~0 8)} is VALID [2022-04-15 08:45:13,179 INFO L290 TraceCheckUtils]: 50: Hoare triple {32613#true} assume true; {32613#true} is VALID [2022-04-15 08:45:13,179 INFO L290 TraceCheckUtils]: 49: Hoare triple {32613#true} assume !(0 == ~cond); {32613#true} is VALID [2022-04-15 08:45:13,179 INFO L290 TraceCheckUtils]: 48: Hoare triple {32613#true} ~cond := #in~cond; {32613#true} is VALID [2022-04-15 08:45:13,180 INFO L272 TraceCheckUtils]: 47: Hoare triple {33098#(< ~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)); {32613#true} is VALID [2022-04-15 08:45:13,180 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {32613#true} {33098#(< ~counter~0 8)} #90#return; {33098#(< ~counter~0 8)} is VALID [2022-04-15 08:45:13,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {32613#true} assume true; {32613#true} is VALID [2022-04-15 08:45:13,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {32613#true} assume !(0 == ~cond); {32613#true} is VALID [2022-04-15 08:45:13,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {32613#true} ~cond := #in~cond; {32613#true} is VALID [2022-04-15 08:45:13,180 INFO L272 TraceCheckUtils]: 42: Hoare triple {33098#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32613#true} is VALID [2022-04-15 08:45:13,181 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {32613#true} {33098#(< ~counter~0 8)} #88#return; {33098#(< ~counter~0 8)} is VALID [2022-04-15 08:45:13,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {32613#true} assume true; {32613#true} is VALID [2022-04-15 08:45:13,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {32613#true} assume !(0 == ~cond); {32613#true} is VALID [2022-04-15 08:45:13,181 INFO L290 TraceCheckUtils]: 38: Hoare triple {32613#true} ~cond := #in~cond; {32613#true} is VALID [2022-04-15 08:45:13,181 INFO L272 TraceCheckUtils]: 37: Hoare triple {33098#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32613#true} is VALID [2022-04-15 08:45:13,182 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {32613#true} {33098#(< ~counter~0 8)} #86#return; {33098#(< ~counter~0 8)} is VALID [2022-04-15 08:45:13,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {32613#true} assume true; {32613#true} is VALID [2022-04-15 08:45:13,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {32613#true} assume !(0 == ~cond); {32613#true} is VALID [2022-04-15 08:45:13,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {32613#true} ~cond := #in~cond; {32613#true} is VALID [2022-04-15 08:45:13,182 INFO L272 TraceCheckUtils]: 32: Hoare triple {33098#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32613#true} is VALID [2022-04-15 08:45:13,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {33098#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {33098#(< ~counter~0 8)} is VALID [2022-04-15 08:45:13,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {33168#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33098#(< ~counter~0 8)} is VALID [2022-04-15 08:45:13,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {33168#(< ~counter~0 7)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {33168#(< ~counter~0 7)} is VALID [2022-04-15 08:45:13,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {33168#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {33168#(< ~counter~0 7)} is VALID [2022-04-15 08:45:13,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {33178#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33168#(< ~counter~0 7)} is VALID [2022-04-15 08:45:13,184 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {32613#true} {33178#(< ~counter~0 6)} #84#return; {33178#(< ~counter~0 6)} is VALID [2022-04-15 08:45:13,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {32613#true} assume true; {32613#true} is VALID [2022-04-15 08:45:13,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {32613#true} assume !(0 == ~cond); {32613#true} is VALID [2022-04-15 08:45:13,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {32613#true} ~cond := #in~cond; {32613#true} is VALID [2022-04-15 08:45:13,184 INFO L272 TraceCheckUtils]: 22: Hoare triple {33178#(< ~counter~0 6)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {32613#true} is VALID [2022-04-15 08:45:13,185 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {32613#true} {33178#(< ~counter~0 6)} #82#return; {33178#(< ~counter~0 6)} is VALID [2022-04-15 08:45:13,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {32613#true} assume true; {32613#true} is VALID [2022-04-15 08:45:13,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {32613#true} assume !(0 == ~cond); {32613#true} is VALID [2022-04-15 08:45:13,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {32613#true} ~cond := #in~cond; {32613#true} is VALID [2022-04-15 08:45:13,185 INFO L272 TraceCheckUtils]: 17: Hoare triple {33178#(< ~counter~0 6)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {32613#true} is VALID [2022-04-15 08:45:13,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {33178#(< ~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; {33178#(< ~counter~0 6)} is VALID [2022-04-15 08:45:13,186 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32613#true} {33178#(< ~counter~0 6)} #80#return; {33178#(< ~counter~0 6)} is VALID [2022-04-15 08:45:13,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {32613#true} assume true; {32613#true} is VALID [2022-04-15 08:45:13,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {32613#true} assume !(0 == ~cond); {32613#true} is VALID [2022-04-15 08:45:13,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {32613#true} ~cond := #in~cond; {32613#true} is VALID [2022-04-15 08:45:13,186 INFO L272 TraceCheckUtils]: 11: Hoare triple {33178#(< ~counter~0 6)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {32613#true} is VALID [2022-04-15 08:45:13,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32613#true} {33178#(< ~counter~0 6)} #78#return; {33178#(< ~counter~0 6)} is VALID [2022-04-15 08:45:13,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {32613#true} assume true; {32613#true} is VALID [2022-04-15 08:45:13,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {32613#true} assume !(0 == ~cond); {32613#true} is VALID [2022-04-15 08:45:13,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {32613#true} ~cond := #in~cond; {32613#true} is VALID [2022-04-15 08:45:13,187 INFO L272 TraceCheckUtils]: 6: Hoare triple {33178#(< ~counter~0 6)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {32613#true} is VALID [2022-04-15 08:45:13,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {33178#(< ~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; {33178#(< ~counter~0 6)} is VALID [2022-04-15 08:45:13,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {33178#(< ~counter~0 6)} call #t~ret8 := main(); {33178#(< ~counter~0 6)} is VALID [2022-04-15 08:45:13,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33178#(< ~counter~0 6)} {32613#true} #98#return; {33178#(< ~counter~0 6)} is VALID [2022-04-15 08:45:13,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {33178#(< ~counter~0 6)} assume true; {33178#(< ~counter~0 6)} is VALID [2022-04-15 08:45:13,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {32613#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; {33178#(< ~counter~0 6)} is VALID [2022-04-15 08:45:13,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {32613#true} call ULTIMATE.init(); {32613#true} is VALID [2022-04-15 08:45:13,188 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-15 08:45:13,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:45:13,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19311030] [2022-04-15 08:45:13,189 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:45:13,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420858139] [2022-04-15 08:45:13,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420858139] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:45:13,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:45:13,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 08:45:13,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:45:13,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1244525637] [2022-04-15 08:45:13,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1244525637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:45:13,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:45:13,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 08:45:13,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286492782] [2022-04-15 08:45:13,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:45:13,190 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-15 08:45:13,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:45:13,190 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-15 08:45:13,244 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-15 08:45:13,244 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 08:45:13,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:45:13,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 08:45:13,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:45:13,245 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-15 08:45:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:14,078 INFO L93 Difference]: Finished difference Result 349 states and 452 transitions. [2022-04-15 08:45:14,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 08:45:14,078 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-15 08:45:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:45:14,078 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-15 08:45:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-15 08:45:14,081 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-15 08:45:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-15 08:45:14,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2022-04-15 08:45:14,178 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-15 08:45:14,188 INFO L225 Difference]: With dead ends: 349 [2022-04-15 08:45:14,188 INFO L226 Difference]: Without dead ends: 342 [2022-04-15 08:45:14,188 INFO L912 BasicCegarLoop]: 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-15 08:45:14,189 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 18 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:45:14,189 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 170 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:45:14,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-15 08:45:14,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-15 08:45:14,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:45:14,891 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-15 08:45:14,897 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-15 08:45:14,897 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-15 08:45:14,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:14,903 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2022-04-15 08:45:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-15 08:45:14,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:45:14,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:45:14,904 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-15 08:45:14,904 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-15 08:45:14,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:14,910 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2022-04-15 08:45:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-15 08:45:14,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:45:14,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:45:14,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:45:14,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:45:14,911 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-15 08:45:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 445 transitions. [2022-04-15 08:45:14,918 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 445 transitions. Word has length 106 [2022-04-15 08:45:14,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:45:14,918 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 445 transitions. [2022-04-15 08:45:14,918 INFO L479 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-15 08:45:14,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 445 transitions. [2022-04-15 08:45:15,538 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-15 08:45:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-15 08:45:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-15 08:45:15,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:45:15,539 INFO L499 BasicCegarLoop]: 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-15 08:45:15,557 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-15 08:45:15,750 WARN L460 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-15 08:45:15,750 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:45:15,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:45:15,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1761848073, now seen corresponding path program 3 times [2022-04-15 08:45:15,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:45:15,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1834836119] [2022-04-15 08:45:15,751 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:45:15,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1761848073, now seen corresponding path program 4 times [2022-04-15 08:45:15,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:45:15,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872531589] [2022-04-15 08:45:15,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:45:15,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:45:15,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:45:15,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1175257008] [2022-04-15 08:45:15,761 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 08:45:15,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:45:15,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:45:15,762 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-15 08:45:15,763 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-15 08:45:15,813 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 08:45:15,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:45:15,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 08:45:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:45:15,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:45:16,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {35334#true} call ULTIMATE.init(); {35334#true} is VALID [2022-04-15 08:45:16,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {35334#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; {35334#true} is VALID [2022-04-15 08:45:16,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {35334#true} assume true; {35334#true} is VALID [2022-04-15 08:45:16,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35334#true} {35334#true} #98#return; {35334#true} is VALID [2022-04-15 08:45:16,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {35334#true} call #t~ret8 := main(); {35334#true} is VALID [2022-04-15 08:45:16,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {35334#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; {35334#true} is VALID [2022-04-15 08:45:16,811 INFO L272 TraceCheckUtils]: 6: Hoare triple {35334#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {35334#true} is VALID [2022-04-15 08:45:16,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {35334#true} ~cond := #in~cond; {35334#true} is VALID [2022-04-15 08:45:16,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {35334#true} assume !(0 == ~cond); {35334#true} is VALID [2022-04-15 08:45:16,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {35334#true} assume true; {35334#true} is VALID [2022-04-15 08:45:16,811 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35334#true} {35334#true} #78#return; {35334#true} is VALID [2022-04-15 08:45:16,811 INFO L272 TraceCheckUtils]: 11: Hoare triple {35334#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35334#true} is VALID [2022-04-15 08:45:16,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {35334#true} ~cond := #in~cond; {35334#true} is VALID [2022-04-15 08:45:16,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {35334#true} assume !(0 == ~cond); {35334#true} is VALID [2022-04-15 08:45:16,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {35334#true} assume true; {35334#true} is VALID [2022-04-15 08:45:16,811 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35334#true} {35334#true} #80#return; {35334#true} is VALID [2022-04-15 08:45:16,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {35334#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; {35387#(and (= 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-15 08:45:16,812 INFO L272 TraceCheckUtils]: 17: Hoare triple {35387#(and (= 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)); {35334#true} is VALID [2022-04-15 08:45:16,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {35334#true} ~cond := #in~cond; {35334#true} is VALID [2022-04-15 08:45:16,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {35334#true} assume !(0 == ~cond); {35334#true} is VALID [2022-04-15 08:45:16,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {35334#true} assume true; {35334#true} is VALID [2022-04-15 08:45:16,813 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35334#true} {35387#(and (= 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; {35387#(and (= 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-15 08:45:16,813 INFO L272 TraceCheckUtils]: 22: Hoare triple {35387#(and (= 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)); {35334#true} is VALID [2022-04-15 08:45:16,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {35334#true} ~cond := #in~cond; {35334#true} is VALID [2022-04-15 08:45:16,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {35334#true} assume !(0 == ~cond); {35334#true} is VALID [2022-04-15 08:45:16,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {35334#true} assume true; {35334#true} is VALID [2022-04-15 08:45:16,813 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {35334#true} {35387#(and (= 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; {35387#(and (= 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-15 08:45:16,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {35387#(and (= 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; {35387#(and (= 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-15 08:45:16,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {35387#(and (= 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; {35387#(and (= 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-15 08:45:16,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {35387#(and (= 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; {35427#(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-15 08:45:16,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {35427#(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; {35427#(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-15 08:45:16,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {35427#(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; {35427#(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-15 08:45:16,816 INFO L272 TraceCheckUtils]: 32: Hoare triple {35427#(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)); {35334#true} is VALID [2022-04-15 08:45:16,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {35334#true} ~cond := #in~cond; {35334#true} is VALID [2022-04-15 08:45:16,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {35334#true} assume !(0 == ~cond); {35334#true} is VALID [2022-04-15 08:45:16,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {35334#true} assume true; {35334#true} is VALID [2022-04-15 08:45:16,816 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {35334#true} {35427#(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; {35427#(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-15 08:45:16,816 INFO L272 TraceCheckUtils]: 37: Hoare triple {35427#(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)); {35334#true} is VALID [2022-04-15 08:45:16,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {35334#true} ~cond := #in~cond; {35334#true} is VALID [2022-04-15 08:45:16,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {35334#true} assume !(0 == ~cond); {35334#true} is VALID [2022-04-15 08:45:16,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {35334#true} assume true; {35334#true} is VALID [2022-04-15 08:45:16,817 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {35334#true} {35427#(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; {35427#(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-15 08:45:16,817 INFO L272 TraceCheckUtils]: 42: Hoare triple {35427#(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)); {35334#true} is VALID [2022-04-15 08:45:16,817 INFO L290 TraceCheckUtils]: 43: Hoare triple {35334#true} ~cond := #in~cond; {35334#true} is VALID [2022-04-15 08:45:16,817 INFO L290 TraceCheckUtils]: 44: Hoare triple {35334#true} assume !(0 == ~cond); {35334#true} is VALID [2022-04-15 08:45:16,818 INFO L290 TraceCheckUtils]: 45: Hoare triple {35334#true} assume true; {35334#true} is VALID [2022-04-15 08:45:16,818 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35334#true} {35427#(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; {35427#(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-15 08:45:16,818 INFO L272 TraceCheckUtils]: 47: Hoare triple {35427#(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)); {35334#true} is VALID [2022-04-15 08:45:16,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {35334#true} ~cond := #in~cond; {35334#true} is VALID [2022-04-15 08:45:16,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {35334#true} assume !(0 == ~cond); {35334#true} is VALID [2022-04-15 08:45:16,818 INFO L290 TraceCheckUtils]: 50: Hoare triple {35334#true} assume true; {35334#true} is VALID [2022-04-15 08:45:16,819 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {35334#true} {35427#(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; {35427#(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-15 08:45:16,820 INFO L290 TraceCheckUtils]: 52: Hoare triple {35427#(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; {35497#(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-15 08:45:16,821 INFO L290 TraceCheckUtils]: 53: Hoare triple {35497#(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; {35497#(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-15 08:45:16,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {35497#(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; {35497#(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-15 08:45:16,821 INFO L272 TraceCheckUtils]: 55: Hoare triple {35497#(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)); {35334#true} is VALID [2022-04-15 08:45:16,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {35334#true} ~cond := #in~cond; {35334#true} is VALID [2022-04-15 08:45:16,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {35334#true} assume !(0 == ~cond); {35334#true} is VALID [2022-04-15 08:45:16,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {35334#true} assume true; {35334#true} is VALID [2022-04-15 08:45:16,822 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {35334#true} {35497#(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; {35497#(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-15 08:45:16,822 INFO L272 TraceCheckUtils]: 60: Hoare triple {35497#(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)); {35334#true} is VALID [2022-04-15 08:45:16,822 INFO L290 TraceCheckUtils]: 61: Hoare triple {35334#true} ~cond := #in~cond; {35334#true} is VALID [2022-04-15 08:45:16,822 INFO L290 TraceCheckUtils]: 62: Hoare triple {35334#true} assume !(0 == ~cond); {35334#true} is VALID [2022-04-15 08:45:16,822 INFO L290 TraceCheckUtils]: 63: Hoare triple {35334#true} assume true; {35334#true} is VALID [2022-04-15 08:45:16,824 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35334#true} {35497#(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; {35497#(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-15 08:45:16,824 INFO L272 TraceCheckUtils]: 65: Hoare triple {35497#(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)); {35334#true} is VALID [2022-04-15 08:45:16,824 INFO L290 TraceCheckUtils]: 66: Hoare triple {35334#true} ~cond := #in~cond; {35334#true} is VALID [2022-04-15 08:45:16,824 INFO L290 TraceCheckUtils]: 67: Hoare triple {35334#true} assume !(0 == ~cond); {35334#true} is VALID [2022-04-15 08:45:16,824 INFO L290 TraceCheckUtils]: 68: Hoare triple {35334#true} assume true; {35334#true} is VALID [2022-04-15 08:45:16,824 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {35334#true} {35497#(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; {35497#(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-15 08:45:16,825 INFO L272 TraceCheckUtils]: 70: Hoare triple {35497#(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)); {35334#true} is VALID [2022-04-15 08:45:16,825 INFO L290 TraceCheckUtils]: 71: Hoare triple {35334#true} ~cond := #in~cond; {35334#true} is VALID [2022-04-15 08:45:16,825 INFO L290 TraceCheckUtils]: 72: Hoare triple {35334#true} assume !(0 == ~cond); {35334#true} is VALID [2022-04-15 08:45:16,825 INFO L290 TraceCheckUtils]: 73: Hoare triple {35334#true} assume true; {35334#true} is VALID [2022-04-15 08:45:16,825 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {35334#true} {35497#(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; {35497#(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-15 08:45:16,826 INFO L290 TraceCheckUtils]: 75: Hoare triple {35497#(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; {35567#(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-15 08:45:16,827 INFO L290 TraceCheckUtils]: 76: Hoare triple {35567#(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; {35567#(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-15 08:45:16,827 INFO L290 TraceCheckUtils]: 77: Hoare triple {35567#(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; {35567#(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-15 08:45:16,827 INFO L272 TraceCheckUtils]: 78: Hoare triple {35567#(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)); {35334#true} is VALID [2022-04-15 08:45:16,828 INFO L290 TraceCheckUtils]: 79: Hoare triple {35334#true} ~cond := #in~cond; {35580#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:45:16,828 INFO L290 TraceCheckUtils]: 80: Hoare triple {35580#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {35584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:45:16,831 INFO L290 TraceCheckUtils]: 81: Hoare triple {35584#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:45:16,832 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {35584#(not (= |__VERIFIER_assert_#in~cond| 0))} {35567#(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; {35591#(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-15 08:45:16,832 INFO L272 TraceCheckUtils]: 83: Hoare triple {35591#(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)); {35334#true} is VALID [2022-04-15 08:45:16,833 INFO L290 TraceCheckUtils]: 84: Hoare triple {35334#true} ~cond := #in~cond; {35334#true} is VALID [2022-04-15 08:45:16,833 INFO L290 TraceCheckUtils]: 85: Hoare triple {35334#true} assume !(0 == ~cond); {35334#true} is VALID [2022-04-15 08:45:16,833 INFO L290 TraceCheckUtils]: 86: Hoare triple {35334#true} assume true; {35334#true} is VALID [2022-04-15 08:45:16,833 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {35334#true} {35591#(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; {35591#(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-15 08:45:16,834 INFO L272 TraceCheckUtils]: 88: Hoare triple {35591#(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)); {35334#true} is VALID [2022-04-15 08:45:16,834 INFO L290 TraceCheckUtils]: 89: Hoare triple {35334#true} ~cond := #in~cond; {35334#true} is VALID [2022-04-15 08:45:16,834 INFO L290 TraceCheckUtils]: 90: Hoare triple {35334#true} assume !(0 == ~cond); {35334#true} is VALID [2022-04-15 08:45:16,834 INFO L290 TraceCheckUtils]: 91: Hoare triple {35334#true} assume true; {35334#true} is VALID [2022-04-15 08:45:16,834 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {35334#true} {35591#(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; {35591#(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-15 08:45:16,835 INFO L272 TraceCheckUtils]: 93: Hoare triple {35591#(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)); {35334#true} is VALID [2022-04-15 08:45:16,835 INFO L290 TraceCheckUtils]: 94: Hoare triple {35334#true} ~cond := #in~cond; {35334#true} is VALID [2022-04-15 08:45:16,835 INFO L290 TraceCheckUtils]: 95: Hoare triple {35334#true} assume !(0 == ~cond); {35334#true} is VALID [2022-04-15 08:45:16,835 INFO L290 TraceCheckUtils]: 96: Hoare triple {35334#true} assume true; {35334#true} is VALID [2022-04-15 08:45:16,836 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {35334#true} {35591#(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; {35591#(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-15 08:45:16,836 INFO L290 TraceCheckUtils]: 98: Hoare triple {35591#(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); {35591#(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-15 08:45:16,838 INFO L290 TraceCheckUtils]: 99: Hoare triple {35591#(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; {35643#(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-15 08:45:16,838 INFO L290 TraceCheckUtils]: 100: Hoare triple {35643#(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; {35643#(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-15 08:45:16,839 INFO L290 TraceCheckUtils]: 101: Hoare triple {35643#(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; {35643#(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-15 08:45:16,839 INFO L290 TraceCheckUtils]: 102: Hoare triple {35643#(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); {35653#(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-15 08:45:16,840 INFO L272 TraceCheckUtils]: 103: Hoare triple {35653#(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)); {35657#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:45:16,840 INFO L290 TraceCheckUtils]: 104: Hoare triple {35657#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35661#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:45:16,841 INFO L290 TraceCheckUtils]: 105: Hoare triple {35661#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35335#false} is VALID [2022-04-15 08:45:16,841 INFO L290 TraceCheckUtils]: 106: Hoare triple {35335#false} assume !false; {35335#false} is VALID [2022-04-15 08:45:16,841 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-15 08:45:16,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:45:26,186 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 08:45:26,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:45:26,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872531589] [2022-04-15 08:45:26,271 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:45:26,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175257008] [2022-04-15 08:45:26,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175257008] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 08:45:26,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 08:45:26,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-15 08:45:26,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:45:26,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1834836119] [2022-04-15 08:45:26,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1834836119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:45:26,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:45:26,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 08:45:26,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501317330] [2022-04-15 08:45:26,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:45:26,272 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-15 08:45:26,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:45:26,272 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-15 08:45:26,342 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-15 08:45:26,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 08:45:26,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:45:26,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 08:45:26,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-15 08:45:26,343 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-15 08:45:28,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:28,881 INFO L93 Difference]: Finished difference Result 369 states and 485 transitions. [2022-04-15 08:45:28,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 08:45:28,881 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-15 08:45:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:45:28,881 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-15 08:45:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2022-04-15 08:45:28,882 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-15 08:45:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2022-04-15 08:45:28,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 125 transitions. [2022-04-15 08:45:29,009 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-15 08:45:29,016 INFO L225 Difference]: With dead ends: 369 [2022-04-15 08:45:29,016 INFO L226 Difference]: Without dead ends: 366 [2022-04-15 08:45:29,016 INFO L912 BasicCegarLoop]: 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-15 08:45:29,017 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 35 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 08:45:29,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 296 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 08:45:29,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-04-15 08:45:29,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2022-04-15 08:45:29,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:45:29,644 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-15 08:45:29,644 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-15 08:45:29,645 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-15 08:45:29,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:29,651 INFO L93 Difference]: Finished difference Result 366 states and 481 transitions. [2022-04-15 08:45:29,651 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 481 transitions. [2022-04-15 08:45:29,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:45:29,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:45:29,652 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-15 08:45:29,652 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-15 08:45:29,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:29,658 INFO L93 Difference]: Finished difference Result 366 states and 481 transitions. [2022-04-15 08:45:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 481 transitions. [2022-04-15 08:45:29,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:45:29,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:45:29,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:45:29,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:45:29,659 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-15 08:45:29,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 479 transitions. [2022-04-15 08:45:29,668 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 479 transitions. Word has length 107 [2022-04-15 08:45:29,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:45:29,668 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 479 transitions. [2022-04-15 08:45:29,668 INFO L479 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-15 08:45:29,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 479 transitions. [2022-04-15 08:45:30,328 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-15 08:45:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 479 transitions. [2022-04-15 08:45:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 08:45:30,329 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:45:30,329 INFO L499 BasicCegarLoop]: 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-15 08:45:30,345 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-15 08:45:30,529 WARN L460 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-15 08:45:30,530 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:45:30,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:45:30,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1514731471, now seen corresponding path program 5 times [2022-04-15 08:45:30,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:45:30,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [586812426] [2022-04-15 08:45:30,530 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:45:30,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1514731471, now seen corresponding path program 6 times [2022-04-15 08:45:30,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:45:30,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528732239] [2022-04-15 08:45:30,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:45:30,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:45:30,540 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:45:30,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1601492602] [2022-04-15 08:45:30,540 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 08:45:30,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:45:30,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:45:30,541 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-15 08:45:30,542 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-15 08:45:30,626 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 08:45:30,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:45:30,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 08:45:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:45:30,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:45:31,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {37952#true} call ULTIMATE.init(); {37952#true} is VALID [2022-04-15 08:45:31,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {37952#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; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {37960#(<= ~counter~0 0)} assume true; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37960#(<= ~counter~0 0)} {37952#true} #98#return; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {37960#(<= ~counter~0 0)} call #t~ret8 := main(); {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {37960#(<= ~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; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,058 INFO L272 TraceCheckUtils]: 6: Hoare triple {37960#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {37960#(<= ~counter~0 0)} ~cond := #in~cond; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {37960#(<= ~counter~0 0)} assume !(0 == ~cond); {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {37960#(<= ~counter~0 0)} assume true; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,059 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37960#(<= ~counter~0 0)} {37960#(<= ~counter~0 0)} #78#return; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,059 INFO L272 TraceCheckUtils]: 11: Hoare triple {37960#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {37960#(<= ~counter~0 0)} ~cond := #in~cond; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {37960#(<= ~counter~0 0)} assume !(0 == ~cond); {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {37960#(<= ~counter~0 0)} assume true; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,060 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37960#(<= ~counter~0 0)} {37960#(<= ~counter~0 0)} #80#return; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {37960#(<= ~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; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,061 INFO L272 TraceCheckUtils]: 17: Hoare triple {37960#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {37960#(<= ~counter~0 0)} ~cond := #in~cond; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {37960#(<= ~counter~0 0)} assume !(0 == ~cond); {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {37960#(<= ~counter~0 0)} assume true; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,063 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {37960#(<= ~counter~0 0)} {37960#(<= ~counter~0 0)} #82#return; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,063 INFO L272 TraceCheckUtils]: 22: Hoare triple {37960#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {37960#(<= ~counter~0 0)} ~cond := #in~cond; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {37960#(<= ~counter~0 0)} assume !(0 == ~cond); {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {37960#(<= ~counter~0 0)} assume true; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,064 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {37960#(<= ~counter~0 0)} {37960#(<= ~counter~0 0)} #84#return; {37960#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:31,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {37960#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38039#(<= ~counter~0 1)} is VALID [2022-04-15 08:45:31,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {38039#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {38039#(<= ~counter~0 1)} is VALID [2022-04-15 08:45:31,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {38039#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {38039#(<= ~counter~0 1)} is VALID [2022-04-15 08:45:31,067 INFO L290 TraceCheckUtils]: 30: Hoare triple {38039#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {38049#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,067 INFO L272 TraceCheckUtils]: 32: Hoare triple {38049#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,068 INFO L290 TraceCheckUtils]: 33: Hoare triple {38049#(<= ~counter~0 2)} ~cond := #in~cond; {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,068 INFO L290 TraceCheckUtils]: 34: Hoare triple {38049#(<= ~counter~0 2)} assume !(0 == ~cond); {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,068 INFO L290 TraceCheckUtils]: 35: Hoare triple {38049#(<= ~counter~0 2)} assume true; {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,069 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {38049#(<= ~counter~0 2)} {38049#(<= ~counter~0 2)} #86#return; {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,069 INFO L272 TraceCheckUtils]: 37: Hoare triple {38049#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,069 INFO L290 TraceCheckUtils]: 38: Hoare triple {38049#(<= ~counter~0 2)} ~cond := #in~cond; {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,070 INFO L290 TraceCheckUtils]: 39: Hoare triple {38049#(<= ~counter~0 2)} assume !(0 == ~cond); {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {38049#(<= ~counter~0 2)} assume true; {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,070 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {38049#(<= ~counter~0 2)} {38049#(<= ~counter~0 2)} #88#return; {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,071 INFO L272 TraceCheckUtils]: 42: Hoare triple {38049#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,071 INFO L290 TraceCheckUtils]: 43: Hoare triple {38049#(<= ~counter~0 2)} ~cond := #in~cond; {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,071 INFO L290 TraceCheckUtils]: 44: Hoare triple {38049#(<= ~counter~0 2)} assume !(0 == ~cond); {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,072 INFO L290 TraceCheckUtils]: 45: Hoare triple {38049#(<= ~counter~0 2)} assume true; {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,072 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {38049#(<= ~counter~0 2)} {38049#(<= ~counter~0 2)} #90#return; {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,073 INFO L272 TraceCheckUtils]: 47: Hoare triple {38049#(<= ~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)); {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,073 INFO L290 TraceCheckUtils]: 48: Hoare triple {38049#(<= ~counter~0 2)} ~cond := #in~cond; {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,073 INFO L290 TraceCheckUtils]: 49: Hoare triple {38049#(<= ~counter~0 2)} assume !(0 == ~cond); {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,074 INFO L290 TraceCheckUtils]: 50: Hoare triple {38049#(<= ~counter~0 2)} assume true; {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,074 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {38049#(<= ~counter~0 2)} {38049#(<= ~counter~0 2)} #92#return; {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,074 INFO L290 TraceCheckUtils]: 52: Hoare triple {38049#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,075 INFO L290 TraceCheckUtils]: 53: Hoare triple {38049#(<= ~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; {38049#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:31,075 INFO L290 TraceCheckUtils]: 54: Hoare triple {38049#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38122#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:31,076 INFO L290 TraceCheckUtils]: 55: Hoare triple {38122#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {38122#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:31,076 INFO L290 TraceCheckUtils]: 56: Hoare triple {38122#(<= ~counter~0 3)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {38122#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:31,077 INFO L290 TraceCheckUtils]: 57: Hoare triple {38122#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,077 INFO L290 TraceCheckUtils]: 58: Hoare triple {38132#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,077 INFO L272 TraceCheckUtils]: 59: Hoare triple {38132#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,078 INFO L290 TraceCheckUtils]: 60: Hoare triple {38132#(<= ~counter~0 4)} ~cond := #in~cond; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,078 INFO L290 TraceCheckUtils]: 61: Hoare triple {38132#(<= ~counter~0 4)} assume !(0 == ~cond); {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,078 INFO L290 TraceCheckUtils]: 62: Hoare triple {38132#(<= ~counter~0 4)} assume true; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,079 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {38132#(<= ~counter~0 4)} {38132#(<= ~counter~0 4)} #86#return; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,079 INFO L272 TraceCheckUtils]: 64: Hoare triple {38132#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,079 INFO L290 TraceCheckUtils]: 65: Hoare triple {38132#(<= ~counter~0 4)} ~cond := #in~cond; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,080 INFO L290 TraceCheckUtils]: 66: Hoare triple {38132#(<= ~counter~0 4)} assume !(0 == ~cond); {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,080 INFO L290 TraceCheckUtils]: 67: Hoare triple {38132#(<= ~counter~0 4)} assume true; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,080 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {38132#(<= ~counter~0 4)} {38132#(<= ~counter~0 4)} #88#return; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,081 INFO L272 TraceCheckUtils]: 69: Hoare triple {38132#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,081 INFO L290 TraceCheckUtils]: 70: Hoare triple {38132#(<= ~counter~0 4)} ~cond := #in~cond; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,081 INFO L290 TraceCheckUtils]: 71: Hoare triple {38132#(<= ~counter~0 4)} assume !(0 == ~cond); {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,082 INFO L290 TraceCheckUtils]: 72: Hoare triple {38132#(<= ~counter~0 4)} assume true; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,082 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {38132#(<= ~counter~0 4)} {38132#(<= ~counter~0 4)} #90#return; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,083 INFO L272 TraceCheckUtils]: 74: Hoare triple {38132#(<= ~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)); {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,083 INFO L290 TraceCheckUtils]: 75: Hoare triple {38132#(<= ~counter~0 4)} ~cond := #in~cond; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,083 INFO L290 TraceCheckUtils]: 76: Hoare triple {38132#(<= ~counter~0 4)} assume !(0 == ~cond); {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,084 INFO L290 TraceCheckUtils]: 77: Hoare triple {38132#(<= ~counter~0 4)} assume true; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,084 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {38132#(<= ~counter~0 4)} {38132#(<= ~counter~0 4)} #92#return; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,084 INFO L290 TraceCheckUtils]: 79: Hoare triple {38132#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,085 INFO L290 TraceCheckUtils]: 80: Hoare triple {38132#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,086 INFO L290 TraceCheckUtils]: 81: Hoare triple {38202#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,086 INFO L272 TraceCheckUtils]: 82: Hoare triple {38202#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,086 INFO L290 TraceCheckUtils]: 83: Hoare triple {38202#(<= ~counter~0 5)} ~cond := #in~cond; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,087 INFO L290 TraceCheckUtils]: 84: Hoare triple {38202#(<= ~counter~0 5)} assume !(0 == ~cond); {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,087 INFO L290 TraceCheckUtils]: 85: Hoare triple {38202#(<= ~counter~0 5)} assume true; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,087 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {38202#(<= ~counter~0 5)} {38202#(<= ~counter~0 5)} #86#return; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,088 INFO L272 TraceCheckUtils]: 87: Hoare triple {38202#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,088 INFO L290 TraceCheckUtils]: 88: Hoare triple {38202#(<= ~counter~0 5)} ~cond := #in~cond; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,088 INFO L290 TraceCheckUtils]: 89: Hoare triple {38202#(<= ~counter~0 5)} assume !(0 == ~cond); {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,089 INFO L290 TraceCheckUtils]: 90: Hoare triple {38202#(<= ~counter~0 5)} assume true; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,089 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {38202#(<= ~counter~0 5)} {38202#(<= ~counter~0 5)} #88#return; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,090 INFO L272 TraceCheckUtils]: 92: Hoare triple {38202#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,090 INFO L290 TraceCheckUtils]: 93: Hoare triple {38202#(<= ~counter~0 5)} ~cond := #in~cond; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,090 INFO L290 TraceCheckUtils]: 94: Hoare triple {38202#(<= ~counter~0 5)} assume !(0 == ~cond); {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,090 INFO L290 TraceCheckUtils]: 95: Hoare triple {38202#(<= ~counter~0 5)} assume true; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,091 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {38202#(<= ~counter~0 5)} {38202#(<= ~counter~0 5)} #90#return; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,092 INFO L272 TraceCheckUtils]: 97: Hoare triple {38202#(<= ~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)); {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,092 INFO L290 TraceCheckUtils]: 98: Hoare triple {38202#(<= ~counter~0 5)} ~cond := #in~cond; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,092 INFO L290 TraceCheckUtils]: 99: Hoare triple {38202#(<= ~counter~0 5)} assume !(0 == ~cond); {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,092 INFO L290 TraceCheckUtils]: 100: Hoare triple {38202#(<= ~counter~0 5)} assume true; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,093 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {38202#(<= ~counter~0 5)} {38202#(<= ~counter~0 5)} #92#return; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,093 INFO L290 TraceCheckUtils]: 102: Hoare triple {38202#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,093 INFO L290 TraceCheckUtils]: 103: Hoare triple {38202#(<= ~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; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,094 INFO L290 TraceCheckUtils]: 104: Hoare triple {38202#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38275#(<= |main_#t~post6| 5)} is VALID [2022-04-15 08:45:31,094 INFO L290 TraceCheckUtils]: 105: Hoare triple {38275#(<= |main_#t~post6| 5)} assume !(#t~post6 < 10);havoc #t~post6; {37953#false} is VALID [2022-04-15 08:45:31,094 INFO L272 TraceCheckUtils]: 106: Hoare triple {37953#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {37953#false} is VALID [2022-04-15 08:45:31,094 INFO L290 TraceCheckUtils]: 107: Hoare triple {37953#false} ~cond := #in~cond; {37953#false} is VALID [2022-04-15 08:45:31,094 INFO L290 TraceCheckUtils]: 108: Hoare triple {37953#false} assume 0 == ~cond; {37953#false} is VALID [2022-04-15 08:45:31,094 INFO L290 TraceCheckUtils]: 109: Hoare triple {37953#false} assume !false; {37953#false} is VALID [2022-04-15 08:45:31,095 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-15 08:45:31,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:45:31,504 INFO L290 TraceCheckUtils]: 109: Hoare triple {37953#false} assume !false; {37953#false} is VALID [2022-04-15 08:45:31,505 INFO L290 TraceCheckUtils]: 108: Hoare triple {37953#false} assume 0 == ~cond; {37953#false} is VALID [2022-04-15 08:45:31,505 INFO L290 TraceCheckUtils]: 107: Hoare triple {37953#false} ~cond := #in~cond; {37953#false} is VALID [2022-04-15 08:45:31,505 INFO L272 TraceCheckUtils]: 106: Hoare triple {37953#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {37953#false} is VALID [2022-04-15 08:45:31,505 INFO L290 TraceCheckUtils]: 105: Hoare triple {38303#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {37953#false} is VALID [2022-04-15 08:45:31,505 INFO L290 TraceCheckUtils]: 104: Hoare triple {38307#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38303#(< |main_#t~post6| 10)} is VALID [2022-04-15 08:45:31,506 INFO L290 TraceCheckUtils]: 103: Hoare triple {38307#(< ~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; {38307#(< ~counter~0 10)} is VALID [2022-04-15 08:45:31,506 INFO L290 TraceCheckUtils]: 102: Hoare triple {38307#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {38307#(< ~counter~0 10)} is VALID [2022-04-15 08:45:31,506 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {37952#true} {38307#(< ~counter~0 10)} #92#return; {38307#(< ~counter~0 10)} is VALID [2022-04-15 08:45:31,506 INFO L290 TraceCheckUtils]: 100: Hoare triple {37952#true} assume true; {37952#true} is VALID [2022-04-15 08:45:31,507 INFO L290 TraceCheckUtils]: 99: Hoare triple {37952#true} assume !(0 == ~cond); {37952#true} is VALID [2022-04-15 08:45:31,507 INFO L290 TraceCheckUtils]: 98: Hoare triple {37952#true} ~cond := #in~cond; {37952#true} is VALID [2022-04-15 08:45:31,507 INFO L272 TraceCheckUtils]: 97: Hoare triple {38307#(< ~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)); {37952#true} is VALID [2022-04-15 08:45:31,507 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {37952#true} {38307#(< ~counter~0 10)} #90#return; {38307#(< ~counter~0 10)} is VALID [2022-04-15 08:45:31,507 INFO L290 TraceCheckUtils]: 95: Hoare triple {37952#true} assume true; {37952#true} is VALID [2022-04-15 08:45:31,507 INFO L290 TraceCheckUtils]: 94: Hoare triple {37952#true} assume !(0 == ~cond); {37952#true} is VALID [2022-04-15 08:45:31,507 INFO L290 TraceCheckUtils]: 93: Hoare triple {37952#true} ~cond := #in~cond; {37952#true} is VALID [2022-04-15 08:45:31,507 INFO L272 TraceCheckUtils]: 92: Hoare triple {38307#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {37952#true} is VALID [2022-04-15 08:45:31,508 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {37952#true} {38307#(< ~counter~0 10)} #88#return; {38307#(< ~counter~0 10)} is VALID [2022-04-15 08:45:31,508 INFO L290 TraceCheckUtils]: 90: Hoare triple {37952#true} assume true; {37952#true} is VALID [2022-04-15 08:45:31,508 INFO L290 TraceCheckUtils]: 89: Hoare triple {37952#true} assume !(0 == ~cond); {37952#true} is VALID [2022-04-15 08:45:31,508 INFO L290 TraceCheckUtils]: 88: Hoare triple {37952#true} ~cond := #in~cond; {37952#true} is VALID [2022-04-15 08:45:31,508 INFO L272 TraceCheckUtils]: 87: Hoare triple {38307#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {37952#true} is VALID [2022-04-15 08:45:31,509 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {37952#true} {38307#(< ~counter~0 10)} #86#return; {38307#(< ~counter~0 10)} is VALID [2022-04-15 08:45:31,509 INFO L290 TraceCheckUtils]: 85: Hoare triple {37952#true} assume true; {37952#true} is VALID [2022-04-15 08:45:31,509 INFO L290 TraceCheckUtils]: 84: Hoare triple {37952#true} assume !(0 == ~cond); {37952#true} is VALID [2022-04-15 08:45:31,509 INFO L290 TraceCheckUtils]: 83: Hoare triple {37952#true} ~cond := #in~cond; {37952#true} is VALID [2022-04-15 08:45:31,509 INFO L272 TraceCheckUtils]: 82: Hoare triple {38307#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {37952#true} is VALID [2022-04-15 08:45:31,509 INFO L290 TraceCheckUtils]: 81: Hoare triple {38307#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {38307#(< ~counter~0 10)} is VALID [2022-04-15 08:45:31,510 INFO L290 TraceCheckUtils]: 80: Hoare triple {38380#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38307#(< ~counter~0 10)} is VALID [2022-04-15 08:45:31,510 INFO L290 TraceCheckUtils]: 79: Hoare triple {38380#(< ~counter~0 9)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {38380#(< ~counter~0 9)} is VALID [2022-04-15 08:45:31,511 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {37952#true} {38380#(< ~counter~0 9)} #92#return; {38380#(< ~counter~0 9)} is VALID [2022-04-15 08:45:31,511 INFO L290 TraceCheckUtils]: 77: Hoare triple {37952#true} assume true; {37952#true} is VALID [2022-04-15 08:45:31,511 INFO L290 TraceCheckUtils]: 76: Hoare triple {37952#true} assume !(0 == ~cond); {37952#true} is VALID [2022-04-15 08:45:31,511 INFO L290 TraceCheckUtils]: 75: Hoare triple {37952#true} ~cond := #in~cond; {37952#true} is VALID [2022-04-15 08:45:31,511 INFO L272 TraceCheckUtils]: 74: Hoare triple {38380#(< ~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)); {37952#true} is VALID [2022-04-15 08:45:31,512 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {37952#true} {38380#(< ~counter~0 9)} #90#return; {38380#(< ~counter~0 9)} is VALID [2022-04-15 08:45:31,512 INFO L290 TraceCheckUtils]: 72: Hoare triple {37952#true} assume true; {37952#true} is VALID [2022-04-15 08:45:31,512 INFO L290 TraceCheckUtils]: 71: Hoare triple {37952#true} assume !(0 == ~cond); {37952#true} is VALID [2022-04-15 08:45:31,512 INFO L290 TraceCheckUtils]: 70: Hoare triple {37952#true} ~cond := #in~cond; {37952#true} is VALID [2022-04-15 08:45:31,512 INFO L272 TraceCheckUtils]: 69: Hoare triple {38380#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {37952#true} is VALID [2022-04-15 08:45:31,512 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {37952#true} {38380#(< ~counter~0 9)} #88#return; {38380#(< ~counter~0 9)} is VALID [2022-04-15 08:45:31,513 INFO L290 TraceCheckUtils]: 67: Hoare triple {37952#true} assume true; {37952#true} is VALID [2022-04-15 08:45:31,513 INFO L290 TraceCheckUtils]: 66: Hoare triple {37952#true} assume !(0 == ~cond); {37952#true} is VALID [2022-04-15 08:45:31,513 INFO L290 TraceCheckUtils]: 65: Hoare triple {37952#true} ~cond := #in~cond; {37952#true} is VALID [2022-04-15 08:45:31,513 INFO L272 TraceCheckUtils]: 64: Hoare triple {38380#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {37952#true} is VALID [2022-04-15 08:45:31,513 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37952#true} {38380#(< ~counter~0 9)} #86#return; {38380#(< ~counter~0 9)} is VALID [2022-04-15 08:45:31,513 INFO L290 TraceCheckUtils]: 62: Hoare triple {37952#true} assume true; {37952#true} is VALID [2022-04-15 08:45:31,513 INFO L290 TraceCheckUtils]: 61: Hoare triple {37952#true} assume !(0 == ~cond); {37952#true} is VALID [2022-04-15 08:45:31,513 INFO L290 TraceCheckUtils]: 60: Hoare triple {37952#true} ~cond := #in~cond; {37952#true} is VALID [2022-04-15 08:45:31,513 INFO L272 TraceCheckUtils]: 59: Hoare triple {38380#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {37952#true} is VALID [2022-04-15 08:45:31,514 INFO L290 TraceCheckUtils]: 58: Hoare triple {38380#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {38380#(< ~counter~0 9)} is VALID [2022-04-15 08:45:31,514 INFO L290 TraceCheckUtils]: 57: Hoare triple {38450#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38380#(< ~counter~0 9)} is VALID [2022-04-15 08:45:31,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {38450#(< ~counter~0 8)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {38450#(< ~counter~0 8)} is VALID [2022-04-15 08:45:31,515 INFO L290 TraceCheckUtils]: 55: Hoare triple {38450#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {38450#(< ~counter~0 8)} is VALID [2022-04-15 08:45:31,515 INFO L290 TraceCheckUtils]: 54: Hoare triple {38460#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38450#(< ~counter~0 8)} is VALID [2022-04-15 08:45:31,516 INFO L290 TraceCheckUtils]: 53: Hoare triple {38460#(< ~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; {38460#(< ~counter~0 7)} is VALID [2022-04-15 08:45:31,516 INFO L290 TraceCheckUtils]: 52: Hoare triple {38460#(< ~counter~0 7)} assume !(~c~0 >= ~b~0); {38460#(< ~counter~0 7)} is VALID [2022-04-15 08:45:31,516 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {37952#true} {38460#(< ~counter~0 7)} #92#return; {38460#(< ~counter~0 7)} is VALID [2022-04-15 08:45:31,516 INFO L290 TraceCheckUtils]: 50: Hoare triple {37952#true} assume true; {37952#true} is VALID [2022-04-15 08:45:31,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {37952#true} assume !(0 == ~cond); {37952#true} is VALID [2022-04-15 08:45:31,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {37952#true} ~cond := #in~cond; {37952#true} is VALID [2022-04-15 08:45:31,517 INFO L272 TraceCheckUtils]: 47: Hoare triple {38460#(< ~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)); {37952#true} is VALID [2022-04-15 08:45:31,517 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {37952#true} {38460#(< ~counter~0 7)} #90#return; {38460#(< ~counter~0 7)} is VALID [2022-04-15 08:45:31,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {37952#true} assume true; {37952#true} is VALID [2022-04-15 08:45:31,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {37952#true} assume !(0 == ~cond); {37952#true} is VALID [2022-04-15 08:45:31,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {37952#true} ~cond := #in~cond; {37952#true} is VALID [2022-04-15 08:45:31,517 INFO L272 TraceCheckUtils]: 42: Hoare triple {38460#(< ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {37952#true} is VALID [2022-04-15 08:45:31,518 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37952#true} {38460#(< ~counter~0 7)} #88#return; {38460#(< ~counter~0 7)} is VALID [2022-04-15 08:45:31,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {37952#true} assume true; {37952#true} is VALID [2022-04-15 08:45:31,518 INFO L290 TraceCheckUtils]: 39: Hoare triple {37952#true} assume !(0 == ~cond); {37952#true} is VALID [2022-04-15 08:45:31,518 INFO L290 TraceCheckUtils]: 38: Hoare triple {37952#true} ~cond := #in~cond; {37952#true} is VALID [2022-04-15 08:45:31,518 INFO L272 TraceCheckUtils]: 37: Hoare triple {38460#(< ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {37952#true} is VALID [2022-04-15 08:45:31,519 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {37952#true} {38460#(< ~counter~0 7)} #86#return; {38460#(< ~counter~0 7)} is VALID [2022-04-15 08:45:31,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {37952#true} assume true; {37952#true} is VALID [2022-04-15 08:45:31,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {37952#true} assume !(0 == ~cond); {37952#true} is VALID [2022-04-15 08:45:31,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {37952#true} ~cond := #in~cond; {37952#true} is VALID [2022-04-15 08:45:31,519 INFO L272 TraceCheckUtils]: 32: Hoare triple {38460#(< ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {37952#true} is VALID [2022-04-15 08:45:31,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {38460#(< ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {38460#(< ~counter~0 7)} is VALID [2022-04-15 08:45:31,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {38202#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38460#(< ~counter~0 7)} is VALID [2022-04-15 08:45:31,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {38202#(<= ~counter~0 5)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {38202#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {38132#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38202#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:31,521 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {37952#true} {38132#(<= ~counter~0 4)} #84#return; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {37952#true} assume true; {37952#true} is VALID [2022-04-15 08:45:31,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {37952#true} assume !(0 == ~cond); {37952#true} is VALID [2022-04-15 08:45:31,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {37952#true} ~cond := #in~cond; {37952#true} is VALID [2022-04-15 08:45:31,521 INFO L272 TraceCheckUtils]: 22: Hoare triple {38132#(<= ~counter~0 4)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {37952#true} is VALID [2022-04-15 08:45:31,522 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {37952#true} {38132#(<= ~counter~0 4)} #82#return; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {37952#true} assume true; {37952#true} is VALID [2022-04-15 08:45:31,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {37952#true} assume !(0 == ~cond); {37952#true} is VALID [2022-04-15 08:45:31,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {37952#true} ~cond := #in~cond; {37952#true} is VALID [2022-04-15 08:45:31,522 INFO L272 TraceCheckUtils]: 17: Hoare triple {38132#(<= ~counter~0 4)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {37952#true} is VALID [2022-04-15 08:45:31,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {38132#(<= ~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; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,523 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37952#true} {38132#(<= ~counter~0 4)} #80#return; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {37952#true} assume true; {37952#true} is VALID [2022-04-15 08:45:31,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {37952#true} assume !(0 == ~cond); {37952#true} is VALID [2022-04-15 08:45:31,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {37952#true} ~cond := #in~cond; {37952#true} is VALID [2022-04-15 08:45:31,523 INFO L272 TraceCheckUtils]: 11: Hoare triple {38132#(<= ~counter~0 4)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37952#true} is VALID [2022-04-15 08:45:31,523 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37952#true} {38132#(<= ~counter~0 4)} #78#return; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {37952#true} assume true; {37952#true} is VALID [2022-04-15 08:45:31,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {37952#true} assume !(0 == ~cond); {37952#true} is VALID [2022-04-15 08:45:31,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {37952#true} ~cond := #in~cond; {37952#true} is VALID [2022-04-15 08:45:31,524 INFO L272 TraceCheckUtils]: 6: Hoare triple {38132#(<= ~counter~0 4)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {37952#true} is VALID [2022-04-15 08:45:31,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {38132#(<= ~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; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {38132#(<= ~counter~0 4)} call #t~ret8 := main(); {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38132#(<= ~counter~0 4)} {37952#true} #98#return; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {38132#(<= ~counter~0 4)} assume true; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {37952#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; {38132#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:31,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {37952#true} call ULTIMATE.init(); {37952#true} is VALID [2022-04-15 08:45:31,525 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-15 08:45:31,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:45:31,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528732239] [2022-04-15 08:45:31,526 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:45:31,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601492602] [2022-04-15 08:45:31,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601492602] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:45:31,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:45:31,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-15 08:45:31,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:45:31,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [586812426] [2022-04-15 08:45:31,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [586812426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:45:31,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:45:31,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 08:45:31,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501981409] [2022-04-15 08:45:31,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:45:31,527 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-15 08:45:31,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:45:31,528 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-15 08:45:31,586 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-15 08:45:31,586 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 08:45:31,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:45:31,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 08:45:31,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:45:31,587 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-15 08:45:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:32,603 INFO L93 Difference]: Finished difference Result 434 states and 549 transitions. [2022-04-15 08:45:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 08:45:32,603 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-15 08:45:32,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:45:32,603 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-15 08:45:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2022-04-15 08:45:32,604 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-15 08:45:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2022-04-15 08:45:32,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 133 transitions. [2022-04-15 08:45:32,716 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-15 08:45:32,726 INFO L225 Difference]: With dead ends: 434 [2022-04-15 08:45:32,726 INFO L226 Difference]: Without dead ends: 425 [2022-04-15 08:45:32,726 INFO L912 BasicCegarLoop]: 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-15 08:45:32,727 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 47 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:45:32,727 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 186 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:45:32,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-04-15 08:45:33,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 423. [2022-04-15 08:45:33,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:45:33,434 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-15 08:45:33,434 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-15 08:45:33,435 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-15 08:45:33,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:33,442 INFO L93 Difference]: Finished difference Result 425 states and 538 transitions. [2022-04-15 08:45:33,443 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 538 transitions. [2022-04-15 08:45:33,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:45:33,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:45:33,444 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-15 08:45:33,444 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-15 08:45:33,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:33,451 INFO L93 Difference]: Finished difference Result 425 states and 538 transitions. [2022-04-15 08:45:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 538 transitions. [2022-04-15 08:45:33,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:45:33,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:45:33,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:45:33,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:45:33,453 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-15 08:45:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 536 transitions. [2022-04-15 08:45:33,462 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 536 transitions. Word has length 110 [2022-04-15 08:45:33,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:45:33,462 INFO L478 AbstractCegarLoop]: Abstraction has 423 states and 536 transitions. [2022-04-15 08:45:33,462 INFO L479 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-15 08:45:33,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 423 states and 536 transitions. [2022-04-15 08:45:34,227 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-15 08:45:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 536 transitions. [2022-04-15 08:45:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 08:45:34,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:45:34,228 INFO L499 BasicCegarLoop]: 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-15 08:45:34,234 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-15 08:45:34,429 WARN L460 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-15 08:45:34,431 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:45:34,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:45:34,431 INFO L85 PathProgramCache]: Analyzing trace with hash -289933735, now seen corresponding path program 5 times [2022-04-15 08:45:34,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:45:34,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [847748314] [2022-04-15 08:45:34,432 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:45:34,432 INFO L85 PathProgramCache]: Analyzing trace with hash -289933735, now seen corresponding path program 6 times [2022-04-15 08:45:34,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:45:34,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173005578] [2022-04-15 08:45:34,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:45:34,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:45:34,441 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:45:34,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1167121870] [2022-04-15 08:45:34,442 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 08:45:34,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:45:34,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:45:34,443 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-15 08:45:34,443 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-15 08:45:34,513 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 08:45:34,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:45:34,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:45:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:45:34,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:45:34,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {41197#true} call ULTIMATE.init(); {41197#true} is VALID [2022-04-15 08:45:34,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {41197#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; {41197#true} is VALID [2022-04-15 08:45:34,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41197#true} {41197#true} #98#return; {41197#true} is VALID [2022-04-15 08:45:34,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {41197#true} call #t~ret8 := main(); {41197#true} is VALID [2022-04-15 08:45:34,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {41197#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; {41197#true} is VALID [2022-04-15 08:45:34,798 INFO L272 TraceCheckUtils]: 6: Hoare triple {41197#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:34,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:34,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:34,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,798 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41197#true} {41197#true} #78#return; {41197#true} is VALID [2022-04-15 08:45:34,798 INFO L272 TraceCheckUtils]: 11: Hoare triple {41197#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:34,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:34,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:34,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,799 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41197#true} {41197#true} #80#return; {41197#true} is VALID [2022-04-15 08:45:34,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {41197#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; {41197#true} is VALID [2022-04-15 08:45:34,799 INFO L272 TraceCheckUtils]: 17: Hoare triple {41197#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:34,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:34,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:34,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,799 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41197#true} {41197#true} #82#return; {41197#true} is VALID [2022-04-15 08:45:34,799 INFO L272 TraceCheckUtils]: 22: Hoare triple {41197#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:34,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:34,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:34,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,799 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41197#true} {41197#true} #84#return; {41197#true} is VALID [2022-04-15 08:45:34,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {41197#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41197#true} is VALID [2022-04-15 08:45:34,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {41197#true} assume !!(#t~post6 < 10);havoc #t~post6; {41197#true} is VALID [2022-04-15 08:45:34,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {41197#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {41197#true} is VALID [2022-04-15 08:45:34,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {41197#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41197#true} is VALID [2022-04-15 08:45:34,800 INFO L290 TraceCheckUtils]: 31: Hoare triple {41197#true} assume !!(#t~post7 < 10);havoc #t~post7; {41197#true} is VALID [2022-04-15 08:45:34,800 INFO L272 TraceCheckUtils]: 32: Hoare triple {41197#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:34,800 INFO L290 TraceCheckUtils]: 33: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:34,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:34,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,800 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {41197#true} {41197#true} #86#return; {41197#true} is VALID [2022-04-15 08:45:34,800 INFO L272 TraceCheckUtils]: 37: Hoare triple {41197#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:34,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:34,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:34,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,801 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {41197#true} {41197#true} #88#return; {41197#true} is VALID [2022-04-15 08:45:34,801 INFO L272 TraceCheckUtils]: 42: Hoare triple {41197#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:34,801 INFO L290 TraceCheckUtils]: 43: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:34,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:34,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,801 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {41197#true} {41197#true} #90#return; {41197#true} is VALID [2022-04-15 08:45:34,801 INFO L272 TraceCheckUtils]: 47: Hoare triple {41197#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)); {41197#true} is VALID [2022-04-15 08:45:34,801 INFO L290 TraceCheckUtils]: 48: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:34,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:34,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,801 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {41197#true} {41197#true} #92#return; {41197#true} is VALID [2022-04-15 08:45:34,815 INFO L290 TraceCheckUtils]: 52: Hoare triple {41197#true} assume !(~c~0 >= ~b~0); {41358#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 08:45:34,816 INFO L290 TraceCheckUtils]: 53: Hoare triple {41358#(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; {41362#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 08:45:34,816 INFO L290 TraceCheckUtils]: 54: Hoare triple {41362#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41362#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 08:45:34,816 INFO L290 TraceCheckUtils]: 55: Hoare triple {41362#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {41362#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 08:45:34,817 INFO L290 TraceCheckUtils]: 56: Hoare triple {41362#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {41372#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:45:34,817 INFO L290 TraceCheckUtils]: 57: Hoare triple {41372#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41372#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:45:34,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {41372#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {41372#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:45:34,817 INFO L272 TraceCheckUtils]: 59: Hoare triple {41372#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:34,817 INFO L290 TraceCheckUtils]: 60: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:34,817 INFO L290 TraceCheckUtils]: 61: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:34,817 INFO L290 TraceCheckUtils]: 62: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,818 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {41197#true} {41372#(< main_~b~0 main_~c~0)} #86#return; {41372#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:45:34,818 INFO L272 TraceCheckUtils]: 64: Hoare triple {41372#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:34,818 INFO L290 TraceCheckUtils]: 65: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:34,818 INFO L290 TraceCheckUtils]: 66: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:34,818 INFO L290 TraceCheckUtils]: 67: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,819 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {41197#true} {41372#(< main_~b~0 main_~c~0)} #88#return; {41372#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:45:34,819 INFO L272 TraceCheckUtils]: 69: Hoare triple {41372#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:34,819 INFO L290 TraceCheckUtils]: 70: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:34,819 INFO L290 TraceCheckUtils]: 71: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:34,819 INFO L290 TraceCheckUtils]: 72: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,819 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {41197#true} {41372#(< main_~b~0 main_~c~0)} #90#return; {41372#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:45:34,819 INFO L272 TraceCheckUtils]: 74: Hoare triple {41372#(< 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)); {41197#true} is VALID [2022-04-15 08:45:34,820 INFO L290 TraceCheckUtils]: 75: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:34,820 INFO L290 TraceCheckUtils]: 76: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:34,820 INFO L290 TraceCheckUtils]: 77: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,820 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {41197#true} {41372#(< main_~b~0 main_~c~0)} #92#return; {41372#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:45:34,822 INFO L290 TraceCheckUtils]: 79: Hoare triple {41372#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {41442#(< 0 main_~c~0)} is VALID [2022-04-15 08:45:34,822 INFO L290 TraceCheckUtils]: 80: Hoare triple {41442#(< 0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41442#(< 0 main_~c~0)} is VALID [2022-04-15 08:45:34,822 INFO L290 TraceCheckUtils]: 81: Hoare triple {41442#(< 0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {41442#(< 0 main_~c~0)} is VALID [2022-04-15 08:45:34,822 INFO L272 TraceCheckUtils]: 82: Hoare triple {41442#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:34,822 INFO L290 TraceCheckUtils]: 83: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:34,822 INFO L290 TraceCheckUtils]: 84: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:34,822 INFO L290 TraceCheckUtils]: 85: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,823 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {41197#true} {41442#(< 0 main_~c~0)} #86#return; {41442#(< 0 main_~c~0)} is VALID [2022-04-15 08:45:34,823 INFO L272 TraceCheckUtils]: 87: Hoare triple {41442#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:34,823 INFO L290 TraceCheckUtils]: 88: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:34,823 INFO L290 TraceCheckUtils]: 89: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:34,823 INFO L290 TraceCheckUtils]: 90: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,824 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {41197#true} {41442#(< 0 main_~c~0)} #88#return; {41442#(< 0 main_~c~0)} is VALID [2022-04-15 08:45:34,824 INFO L272 TraceCheckUtils]: 92: Hoare triple {41442#(< 0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:34,824 INFO L290 TraceCheckUtils]: 93: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:34,824 INFO L290 TraceCheckUtils]: 94: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:34,824 INFO L290 TraceCheckUtils]: 95: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,824 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {41197#true} {41442#(< 0 main_~c~0)} #90#return; {41442#(< 0 main_~c~0)} is VALID [2022-04-15 08:45:34,824 INFO L272 TraceCheckUtils]: 97: Hoare triple {41442#(< 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)); {41197#true} is VALID [2022-04-15 08:45:34,825 INFO L290 TraceCheckUtils]: 98: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:34,825 INFO L290 TraceCheckUtils]: 99: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:34,825 INFO L290 TraceCheckUtils]: 100: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:34,825 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {41197#true} {41442#(< 0 main_~c~0)} #92#return; {41442#(< 0 main_~c~0)} is VALID [2022-04-15 08:45:34,825 INFO L290 TraceCheckUtils]: 102: Hoare triple {41442#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {41442#(< 0 main_~c~0)} is VALID [2022-04-15 08:45:34,826 INFO L290 TraceCheckUtils]: 103: Hoare triple {41442#(< 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; {41515#(< 0 main_~b~0)} is VALID [2022-04-15 08:45:34,826 INFO L290 TraceCheckUtils]: 104: Hoare triple {41515#(< 0 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41515#(< 0 main_~b~0)} is VALID [2022-04-15 08:45:34,826 INFO L290 TraceCheckUtils]: 105: Hoare triple {41515#(< 0 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {41515#(< 0 main_~b~0)} is VALID [2022-04-15 08:45:34,827 INFO L290 TraceCheckUtils]: 106: Hoare triple {41515#(< 0 main_~b~0)} assume !(0 != ~b~0); {41198#false} is VALID [2022-04-15 08:45:34,827 INFO L272 TraceCheckUtils]: 107: Hoare triple {41198#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {41198#false} is VALID [2022-04-15 08:45:34,827 INFO L290 TraceCheckUtils]: 108: Hoare triple {41198#false} ~cond := #in~cond; {41198#false} is VALID [2022-04-15 08:45:34,827 INFO L290 TraceCheckUtils]: 109: Hoare triple {41198#false} assume 0 == ~cond; {41198#false} is VALID [2022-04-15 08:45:34,827 INFO L290 TraceCheckUtils]: 110: Hoare triple {41198#false} assume !false; {41198#false} is VALID [2022-04-15 08:45:34,827 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-15 08:45:34,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:45:35,161 INFO L290 TraceCheckUtils]: 110: Hoare triple {41198#false} assume !false; {41198#false} is VALID [2022-04-15 08:45:35,161 INFO L290 TraceCheckUtils]: 109: Hoare triple {41198#false} assume 0 == ~cond; {41198#false} is VALID [2022-04-15 08:45:35,161 INFO L290 TraceCheckUtils]: 108: Hoare triple {41198#false} ~cond := #in~cond; {41198#false} is VALID [2022-04-15 08:45:35,162 INFO L272 TraceCheckUtils]: 107: Hoare triple {41198#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {41198#false} is VALID [2022-04-15 08:45:35,162 INFO L290 TraceCheckUtils]: 106: Hoare triple {41515#(< 0 main_~b~0)} assume !(0 != ~b~0); {41198#false} is VALID [2022-04-15 08:45:35,162 INFO L290 TraceCheckUtils]: 105: Hoare triple {41515#(< 0 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {41515#(< 0 main_~b~0)} is VALID [2022-04-15 08:45:35,162 INFO L290 TraceCheckUtils]: 104: Hoare triple {41515#(< 0 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41515#(< 0 main_~b~0)} is VALID [2022-04-15 08:45:35,163 INFO L290 TraceCheckUtils]: 103: Hoare triple {41442#(< 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; {41515#(< 0 main_~b~0)} is VALID [2022-04-15 08:45:35,163 INFO L290 TraceCheckUtils]: 102: Hoare triple {41442#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {41442#(< 0 main_~c~0)} is VALID [2022-04-15 08:45:35,164 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {41197#true} {41442#(< 0 main_~c~0)} #92#return; {41442#(< 0 main_~c~0)} is VALID [2022-04-15 08:45:35,164 INFO L290 TraceCheckUtils]: 100: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,164 INFO L290 TraceCheckUtils]: 99: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:35,164 INFO L290 TraceCheckUtils]: 98: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:35,164 INFO L272 TraceCheckUtils]: 97: Hoare triple {41442#(< 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)); {41197#true} is VALID [2022-04-15 08:45:35,165 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {41197#true} {41442#(< 0 main_~c~0)} #90#return; {41442#(< 0 main_~c~0)} is VALID [2022-04-15 08:45:35,165 INFO L290 TraceCheckUtils]: 95: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,165 INFO L290 TraceCheckUtils]: 94: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:35,165 INFO L290 TraceCheckUtils]: 93: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:35,165 INFO L272 TraceCheckUtils]: 92: Hoare triple {41442#(< 0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:35,166 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {41197#true} {41442#(< 0 main_~c~0)} #88#return; {41442#(< 0 main_~c~0)} is VALID [2022-04-15 08:45:35,166 INFO L290 TraceCheckUtils]: 90: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,166 INFO L290 TraceCheckUtils]: 89: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:35,166 INFO L290 TraceCheckUtils]: 88: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:35,166 INFO L272 TraceCheckUtils]: 87: Hoare triple {41442#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:35,166 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {41197#true} {41442#(< 0 main_~c~0)} #86#return; {41442#(< 0 main_~c~0)} is VALID [2022-04-15 08:45:35,166 INFO L290 TraceCheckUtils]: 85: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,166 INFO L290 TraceCheckUtils]: 84: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:35,167 INFO L290 TraceCheckUtils]: 83: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:35,167 INFO L272 TraceCheckUtils]: 82: Hoare triple {41442#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:35,167 INFO L290 TraceCheckUtils]: 81: Hoare triple {41442#(< 0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {41442#(< 0 main_~c~0)} is VALID [2022-04-15 08:45:35,167 INFO L290 TraceCheckUtils]: 80: Hoare triple {41442#(< 0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41442#(< 0 main_~c~0)} is VALID [2022-04-15 08:45:35,169 INFO L290 TraceCheckUtils]: 79: Hoare triple {41372#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {41442#(< 0 main_~c~0)} is VALID [2022-04-15 08:45:35,169 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {41197#true} {41372#(< main_~b~0 main_~c~0)} #92#return; {41372#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:45:35,169 INFO L290 TraceCheckUtils]: 77: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,169 INFO L290 TraceCheckUtils]: 76: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:35,169 INFO L290 TraceCheckUtils]: 75: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:35,170 INFO L272 TraceCheckUtils]: 74: Hoare triple {41372#(< 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)); {41197#true} is VALID [2022-04-15 08:45:35,170 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {41197#true} {41372#(< main_~b~0 main_~c~0)} #90#return; {41372#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:45:35,170 INFO L290 TraceCheckUtils]: 72: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,170 INFO L290 TraceCheckUtils]: 71: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:35,170 INFO L290 TraceCheckUtils]: 70: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:35,170 INFO L272 TraceCheckUtils]: 69: Hoare triple {41372#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:35,171 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {41197#true} {41372#(< main_~b~0 main_~c~0)} #88#return; {41372#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:45:35,172 INFO L290 TraceCheckUtils]: 67: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,172 INFO L290 TraceCheckUtils]: 66: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:35,172 INFO L290 TraceCheckUtils]: 65: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:35,172 INFO L272 TraceCheckUtils]: 64: Hoare triple {41372#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:35,172 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {41197#true} {41372#(< main_~b~0 main_~c~0)} #86#return; {41372#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:45:35,172 INFO L290 TraceCheckUtils]: 62: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,172 INFO L290 TraceCheckUtils]: 61: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:35,173 INFO L290 TraceCheckUtils]: 60: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:35,173 INFO L272 TraceCheckUtils]: 59: Hoare triple {41372#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:35,173 INFO L290 TraceCheckUtils]: 58: Hoare triple {41372#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {41372#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:45:35,173 INFO L290 TraceCheckUtils]: 57: Hoare triple {41372#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41372#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:45:35,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {41362#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {41372#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 08:45:35,174 INFO L290 TraceCheckUtils]: 55: Hoare triple {41362#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {41362#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 08:45:35,174 INFO L290 TraceCheckUtils]: 54: Hoare triple {41362#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41362#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 08:45:35,175 INFO L290 TraceCheckUtils]: 53: Hoare triple {41358#(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; {41362#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 08:45:35,175 INFO L290 TraceCheckUtils]: 52: Hoare triple {41197#true} assume !(~c~0 >= ~b~0); {41358#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 08:45:35,175 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {41197#true} {41197#true} #92#return; {41197#true} is VALID [2022-04-15 08:45:35,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:35,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:35,175 INFO L272 TraceCheckUtils]: 47: Hoare triple {41197#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)); {41197#true} is VALID [2022-04-15 08:45:35,175 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {41197#true} {41197#true} #90#return; {41197#true} is VALID [2022-04-15 08:45:35,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:35,176 INFO L290 TraceCheckUtils]: 43: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:35,176 INFO L272 TraceCheckUtils]: 42: Hoare triple {41197#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:35,176 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {41197#true} {41197#true} #88#return; {41197#true} is VALID [2022-04-15 08:45:35,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,176 INFO L290 TraceCheckUtils]: 39: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:35,176 INFO L290 TraceCheckUtils]: 38: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:35,176 INFO L272 TraceCheckUtils]: 37: Hoare triple {41197#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:35,176 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {41197#true} {41197#true} #86#return; {41197#true} is VALID [2022-04-15 08:45:35,176 INFO L290 TraceCheckUtils]: 35: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:35,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:35,176 INFO L272 TraceCheckUtils]: 32: Hoare triple {41197#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:35,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {41197#true} assume !!(#t~post7 < 10);havoc #t~post7; {41197#true} is VALID [2022-04-15 08:45:35,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {41197#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41197#true} is VALID [2022-04-15 08:45:35,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {41197#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {41197#true} is VALID [2022-04-15 08:45:35,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {41197#true} assume !!(#t~post6 < 10);havoc #t~post6; {41197#true} is VALID [2022-04-15 08:45:35,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {41197#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41197#true} is VALID [2022-04-15 08:45:35,177 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41197#true} {41197#true} #84#return; {41197#true} is VALID [2022-04-15 08:45:35,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:35,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:35,177 INFO L272 TraceCheckUtils]: 22: Hoare triple {41197#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:35,177 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41197#true} {41197#true} #82#return; {41197#true} is VALID [2022-04-15 08:45:35,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:35,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:35,177 INFO L272 TraceCheckUtils]: 17: Hoare triple {41197#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:35,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {41197#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; {41197#true} is VALID [2022-04-15 08:45:35,178 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41197#true} {41197#true} #80#return; {41197#true} is VALID [2022-04-15 08:45:35,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:35,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:35,178 INFO L272 TraceCheckUtils]: 11: Hoare triple {41197#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:35,178 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41197#true} {41197#true} #78#return; {41197#true} is VALID [2022-04-15 08:45:35,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {41197#true} assume !(0 == ~cond); {41197#true} is VALID [2022-04-15 08:45:35,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {41197#true} ~cond := #in~cond; {41197#true} is VALID [2022-04-15 08:45:35,178 INFO L272 TraceCheckUtils]: 6: Hoare triple {41197#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {41197#true} is VALID [2022-04-15 08:45:35,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {41197#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; {41197#true} is VALID [2022-04-15 08:45:35,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {41197#true} call #t~ret8 := main(); {41197#true} is VALID [2022-04-15 08:45:35,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41197#true} {41197#true} #98#return; {41197#true} is VALID [2022-04-15 08:45:35,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {41197#true} assume true; {41197#true} is VALID [2022-04-15 08:45:35,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {41197#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; {41197#true} is VALID [2022-04-15 08:45:35,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {41197#true} call ULTIMATE.init(); {41197#true} is VALID [2022-04-15 08:45:35,179 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-15 08:45:35,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:45:35,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173005578] [2022-04-15 08:45:35,179 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:45:35,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167121870] [2022-04-15 08:45:35,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167121870] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:45:35,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:45:35,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-04-15 08:45:35,180 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:45:35,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [847748314] [2022-04-15 08:45:35,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [847748314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:45:35,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:45:35,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 08:45:35,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538683788] [2022-04-15 08:45:35,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:45:35,180 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-15 08:45:35,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:45:35,181 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-15 08:45:35,238 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-15 08:45:35,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 08:45:35,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:45:35,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 08:45:35,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 08:45:35,239 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-15 08:45:37,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:37,580 INFO L93 Difference]: Finished difference Result 589 states and 810 transitions. [2022-04-15 08:45:37,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 08:45:37,580 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-15 08:45:37,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:45:37,580 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-15 08:45:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 178 transitions. [2022-04-15 08:45:37,582 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-15 08:45:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 178 transitions. [2022-04-15 08:45:37,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 178 transitions. [2022-04-15 08:45:37,731 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-15 08:45:37,757 INFO L225 Difference]: With dead ends: 589 [2022-04-15 08:45:37,757 INFO L226 Difference]: Without dead ends: 581 [2022-04-15 08:45:37,757 INFO L912 BasicCegarLoop]: 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-15 08:45:37,757 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 32 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 08:45:37,757 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 369 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 08:45:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-04-15 08:45:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 470. [2022-04-15 08:45:38,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:45:38,637 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-15 08:45:38,638 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-15 08:45:38,638 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-15 08:45:38,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:38,653 INFO L93 Difference]: Finished difference Result 581 states and 798 transitions. [2022-04-15 08:45:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 798 transitions. [2022-04-15 08:45:38,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:45:38,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:45:38,655 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-15 08:45:38,655 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-15 08:45:38,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:38,671 INFO L93 Difference]: Finished difference Result 581 states and 798 transitions. [2022-04-15 08:45:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 798 transitions. [2022-04-15 08:45:38,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:45:38,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:45:38,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:45:38,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:45:38,673 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-15 08:45:38,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 614 transitions. [2022-04-15 08:45:38,685 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 614 transitions. Word has length 111 [2022-04-15 08:45:38,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:45:38,685 INFO L478 AbstractCegarLoop]: Abstraction has 470 states and 614 transitions. [2022-04-15 08:45:38,685 INFO L479 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-15 08:45:38,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 470 states and 614 transitions. [2022-04-15 08:45:39,744 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-15 08:45:39,744 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 614 transitions. [2022-04-15 08:45:39,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-15 08:45:39,745 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:45:39,745 INFO L499 BasicCegarLoop]: 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-15 08:45:39,764 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-15 08:45:39,947 WARN L460 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-15 08:45:39,948 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:45:39,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:45:39,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1282766646, now seen corresponding path program 3 times [2022-04-15 08:45:39,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:45:39,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [572118615] [2022-04-15 08:45:39,948 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:45:39,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1282766646, now seen corresponding path program 4 times [2022-04-15 08:45:39,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:45:39,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852251525] [2022-04-15 08:45:39,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:45:39,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:45:39,960 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:45:39,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2109294162] [2022-04-15 08:45:39,960 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 08:45:39,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:45:39,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:45:39,961 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-15 08:45:39,962 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-15 08:45:40,027 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 08:45:40,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:45:40,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 08:45:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:45:40,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:45:40,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {45175#true} call ULTIMATE.init(); {45175#true} is VALID [2022-04-15 08:45:40,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {45175#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; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {45183#(<= ~counter~0 0)} assume true; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45183#(<= ~counter~0 0)} {45175#true} #98#return; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {45183#(<= ~counter~0 0)} call #t~ret8 := main(); {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {45183#(<= ~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; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,466 INFO L272 TraceCheckUtils]: 6: Hoare triple {45183#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {45183#(<= ~counter~0 0)} ~cond := #in~cond; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {45183#(<= ~counter~0 0)} assume !(0 == ~cond); {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {45183#(<= ~counter~0 0)} assume true; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,467 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45183#(<= ~counter~0 0)} {45183#(<= ~counter~0 0)} #78#return; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,468 INFO L272 TraceCheckUtils]: 11: Hoare triple {45183#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {45183#(<= ~counter~0 0)} ~cond := #in~cond; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {45183#(<= ~counter~0 0)} assume !(0 == ~cond); {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {45183#(<= ~counter~0 0)} assume true; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,469 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45183#(<= ~counter~0 0)} {45183#(<= ~counter~0 0)} #80#return; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {45183#(<= ~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; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,469 INFO L272 TraceCheckUtils]: 17: Hoare triple {45183#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {45183#(<= ~counter~0 0)} ~cond := #in~cond; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {45183#(<= ~counter~0 0)} assume !(0 == ~cond); {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {45183#(<= ~counter~0 0)} assume true; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,471 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {45183#(<= ~counter~0 0)} {45183#(<= ~counter~0 0)} #82#return; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,471 INFO L272 TraceCheckUtils]: 22: Hoare triple {45183#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {45183#(<= ~counter~0 0)} ~cond := #in~cond; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {45183#(<= ~counter~0 0)} assume !(0 == ~cond); {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {45183#(<= ~counter~0 0)} assume true; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,472 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {45183#(<= ~counter~0 0)} {45183#(<= ~counter~0 0)} #84#return; {45183#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:40,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {45183#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45262#(<= ~counter~0 1)} is VALID [2022-04-15 08:45:40,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {45262#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {45262#(<= ~counter~0 1)} is VALID [2022-04-15 08:45:40,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {45262#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {45262#(<= ~counter~0 1)} is VALID [2022-04-15 08:45:40,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {45262#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {45272#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,475 INFO L272 TraceCheckUtils]: 32: Hoare triple {45272#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {45272#(<= ~counter~0 2)} ~cond := #in~cond; {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {45272#(<= ~counter~0 2)} assume !(0 == ~cond); {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {45272#(<= ~counter~0 2)} assume true; {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,476 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {45272#(<= ~counter~0 2)} {45272#(<= ~counter~0 2)} #86#return; {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,477 INFO L272 TraceCheckUtils]: 37: Hoare triple {45272#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {45272#(<= ~counter~0 2)} ~cond := #in~cond; {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,477 INFO L290 TraceCheckUtils]: 39: Hoare triple {45272#(<= ~counter~0 2)} assume !(0 == ~cond); {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,477 INFO L290 TraceCheckUtils]: 40: Hoare triple {45272#(<= ~counter~0 2)} assume true; {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,478 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {45272#(<= ~counter~0 2)} {45272#(<= ~counter~0 2)} #88#return; {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,478 INFO L272 TraceCheckUtils]: 42: Hoare triple {45272#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,479 INFO L290 TraceCheckUtils]: 43: Hoare triple {45272#(<= ~counter~0 2)} ~cond := #in~cond; {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,479 INFO L290 TraceCheckUtils]: 44: Hoare triple {45272#(<= ~counter~0 2)} assume !(0 == ~cond); {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,479 INFO L290 TraceCheckUtils]: 45: Hoare triple {45272#(<= ~counter~0 2)} assume true; {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,480 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {45272#(<= ~counter~0 2)} {45272#(<= ~counter~0 2)} #90#return; {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,480 INFO L272 TraceCheckUtils]: 47: Hoare triple {45272#(<= ~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)); {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,481 INFO L290 TraceCheckUtils]: 48: Hoare triple {45272#(<= ~counter~0 2)} ~cond := #in~cond; {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,481 INFO L290 TraceCheckUtils]: 49: Hoare triple {45272#(<= ~counter~0 2)} assume !(0 == ~cond); {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,481 INFO L290 TraceCheckUtils]: 50: Hoare triple {45272#(<= ~counter~0 2)} assume true; {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,482 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {45272#(<= ~counter~0 2)} {45272#(<= ~counter~0 2)} #92#return; {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,482 INFO L290 TraceCheckUtils]: 52: Hoare triple {45272#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {45272#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:40,482 INFO L290 TraceCheckUtils]: 53: Hoare triple {45272#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,483 INFO L290 TraceCheckUtils]: 54: Hoare triple {45342#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,483 INFO L272 TraceCheckUtils]: 55: Hoare triple {45342#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,483 INFO L290 TraceCheckUtils]: 56: Hoare triple {45342#(<= ~counter~0 3)} ~cond := #in~cond; {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,484 INFO L290 TraceCheckUtils]: 57: Hoare triple {45342#(<= ~counter~0 3)} assume !(0 == ~cond); {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,484 INFO L290 TraceCheckUtils]: 58: Hoare triple {45342#(<= ~counter~0 3)} assume true; {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,484 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {45342#(<= ~counter~0 3)} {45342#(<= ~counter~0 3)} #86#return; {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,485 INFO L272 TraceCheckUtils]: 60: Hoare triple {45342#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,485 INFO L290 TraceCheckUtils]: 61: Hoare triple {45342#(<= ~counter~0 3)} ~cond := #in~cond; {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,485 INFO L290 TraceCheckUtils]: 62: Hoare triple {45342#(<= ~counter~0 3)} assume !(0 == ~cond); {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,486 INFO L290 TraceCheckUtils]: 63: Hoare triple {45342#(<= ~counter~0 3)} assume true; {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,486 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {45342#(<= ~counter~0 3)} {45342#(<= ~counter~0 3)} #88#return; {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,487 INFO L272 TraceCheckUtils]: 65: Hoare triple {45342#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,487 INFO L290 TraceCheckUtils]: 66: Hoare triple {45342#(<= ~counter~0 3)} ~cond := #in~cond; {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,487 INFO L290 TraceCheckUtils]: 67: Hoare triple {45342#(<= ~counter~0 3)} assume !(0 == ~cond); {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,487 INFO L290 TraceCheckUtils]: 68: Hoare triple {45342#(<= ~counter~0 3)} assume true; {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,488 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {45342#(<= ~counter~0 3)} {45342#(<= ~counter~0 3)} #90#return; {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,489 INFO L272 TraceCheckUtils]: 70: Hoare triple {45342#(<= ~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)); {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,489 INFO L290 TraceCheckUtils]: 71: Hoare triple {45342#(<= ~counter~0 3)} ~cond := #in~cond; {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,489 INFO L290 TraceCheckUtils]: 72: Hoare triple {45342#(<= ~counter~0 3)} assume !(0 == ~cond); {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,489 INFO L290 TraceCheckUtils]: 73: Hoare triple {45342#(<= ~counter~0 3)} assume true; {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,490 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {45342#(<= ~counter~0 3)} {45342#(<= ~counter~0 3)} #92#return; {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,490 INFO L290 TraceCheckUtils]: 75: Hoare triple {45342#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {45342#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:40,491 INFO L290 TraceCheckUtils]: 76: Hoare triple {45342#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,491 INFO L290 TraceCheckUtils]: 77: Hoare triple {45412#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,491 INFO L272 TraceCheckUtils]: 78: Hoare triple {45412#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,492 INFO L290 TraceCheckUtils]: 79: Hoare triple {45412#(<= ~counter~0 4)} ~cond := #in~cond; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,492 INFO L290 TraceCheckUtils]: 80: Hoare triple {45412#(<= ~counter~0 4)} assume !(0 == ~cond); {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,492 INFO L290 TraceCheckUtils]: 81: Hoare triple {45412#(<= ~counter~0 4)} assume true; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,493 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {45412#(<= ~counter~0 4)} {45412#(<= ~counter~0 4)} #86#return; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,493 INFO L272 TraceCheckUtils]: 83: Hoare triple {45412#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,493 INFO L290 TraceCheckUtils]: 84: Hoare triple {45412#(<= ~counter~0 4)} ~cond := #in~cond; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,494 INFO L290 TraceCheckUtils]: 85: Hoare triple {45412#(<= ~counter~0 4)} assume !(0 == ~cond); {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,494 INFO L290 TraceCheckUtils]: 86: Hoare triple {45412#(<= ~counter~0 4)} assume true; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,494 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {45412#(<= ~counter~0 4)} {45412#(<= ~counter~0 4)} #88#return; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,495 INFO L272 TraceCheckUtils]: 88: Hoare triple {45412#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,495 INFO L290 TraceCheckUtils]: 89: Hoare triple {45412#(<= ~counter~0 4)} ~cond := #in~cond; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,495 INFO L290 TraceCheckUtils]: 90: Hoare triple {45412#(<= ~counter~0 4)} assume !(0 == ~cond); {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,496 INFO L290 TraceCheckUtils]: 91: Hoare triple {45412#(<= ~counter~0 4)} assume true; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,496 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {45412#(<= ~counter~0 4)} {45412#(<= ~counter~0 4)} #90#return; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,497 INFO L272 TraceCheckUtils]: 93: Hoare triple {45412#(<= ~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)); {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,497 INFO L290 TraceCheckUtils]: 94: Hoare triple {45412#(<= ~counter~0 4)} ~cond := #in~cond; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,497 INFO L290 TraceCheckUtils]: 95: Hoare triple {45412#(<= ~counter~0 4)} assume !(0 == ~cond); {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,497 INFO L290 TraceCheckUtils]: 96: Hoare triple {45412#(<= ~counter~0 4)} assume true; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,498 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {45412#(<= ~counter~0 4)} {45412#(<= ~counter~0 4)} #92#return; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,498 INFO L290 TraceCheckUtils]: 98: Hoare triple {45412#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,499 INFO L290 TraceCheckUtils]: 99: Hoare triple {45412#(<= ~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; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,499 INFO L290 TraceCheckUtils]: 100: Hoare triple {45412#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45485#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:40,499 INFO L290 TraceCheckUtils]: 101: Hoare triple {45485#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {45485#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:40,500 INFO L290 TraceCheckUtils]: 102: Hoare triple {45485#(<= ~counter~0 5)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {45485#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:40,500 INFO L290 TraceCheckUtils]: 103: Hoare triple {45485#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45495#(<= |main_#t~post7| 5)} is VALID [2022-04-15 08:45:40,500 INFO L290 TraceCheckUtils]: 104: Hoare triple {45495#(<= |main_#t~post7| 5)} assume !(#t~post7 < 10);havoc #t~post7; {45176#false} is VALID [2022-04-15 08:45:40,500 INFO L290 TraceCheckUtils]: 105: Hoare triple {45176#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; {45176#false} is VALID [2022-04-15 08:45:40,500 INFO L290 TraceCheckUtils]: 106: Hoare triple {45176#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45176#false} is VALID [2022-04-15 08:45:40,500 INFO L290 TraceCheckUtils]: 107: Hoare triple {45176#false} assume !(#t~post6 < 10);havoc #t~post6; {45176#false} is VALID [2022-04-15 08:45:40,501 INFO L272 TraceCheckUtils]: 108: Hoare triple {45176#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {45176#false} is VALID [2022-04-15 08:45:40,501 INFO L290 TraceCheckUtils]: 109: Hoare triple {45176#false} ~cond := #in~cond; {45176#false} is VALID [2022-04-15 08:45:40,501 INFO L290 TraceCheckUtils]: 110: Hoare triple {45176#false} assume 0 == ~cond; {45176#false} is VALID [2022-04-15 08:45:40,501 INFO L290 TraceCheckUtils]: 111: Hoare triple {45176#false} assume !false; {45176#false} is VALID [2022-04-15 08:45:40,501 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-15 08:45:40,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:45:40,881 INFO L290 TraceCheckUtils]: 111: Hoare triple {45176#false} assume !false; {45176#false} is VALID [2022-04-15 08:45:40,881 INFO L290 TraceCheckUtils]: 110: Hoare triple {45176#false} assume 0 == ~cond; {45176#false} is VALID [2022-04-15 08:45:40,881 INFO L290 TraceCheckUtils]: 109: Hoare triple {45176#false} ~cond := #in~cond; {45176#false} is VALID [2022-04-15 08:45:40,881 INFO L272 TraceCheckUtils]: 108: Hoare triple {45176#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {45176#false} is VALID [2022-04-15 08:45:40,882 INFO L290 TraceCheckUtils]: 107: Hoare triple {45176#false} assume !(#t~post6 < 10);havoc #t~post6; {45176#false} is VALID [2022-04-15 08:45:40,882 INFO L290 TraceCheckUtils]: 106: Hoare triple {45176#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45176#false} is VALID [2022-04-15 08:45:40,882 INFO L290 TraceCheckUtils]: 105: Hoare triple {45176#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; {45176#false} is VALID [2022-04-15 08:45:40,882 INFO L290 TraceCheckUtils]: 104: Hoare triple {45541#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {45176#false} is VALID [2022-04-15 08:45:40,882 INFO L290 TraceCheckUtils]: 103: Hoare triple {45545#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45541#(< |main_#t~post7| 10)} is VALID [2022-04-15 08:45:40,883 INFO L290 TraceCheckUtils]: 102: Hoare triple {45545#(< ~counter~0 10)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {45545#(< ~counter~0 10)} is VALID [2022-04-15 08:45:40,883 INFO L290 TraceCheckUtils]: 101: Hoare triple {45545#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {45545#(< ~counter~0 10)} is VALID [2022-04-15 08:45:40,884 INFO L290 TraceCheckUtils]: 100: Hoare triple {45555#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45545#(< ~counter~0 10)} is VALID [2022-04-15 08:45:40,884 INFO L290 TraceCheckUtils]: 99: Hoare triple {45555#(< ~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; {45555#(< ~counter~0 9)} is VALID [2022-04-15 08:45:40,884 INFO L290 TraceCheckUtils]: 98: Hoare triple {45555#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {45555#(< ~counter~0 9)} is VALID [2022-04-15 08:45:40,885 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {45175#true} {45555#(< ~counter~0 9)} #92#return; {45555#(< ~counter~0 9)} is VALID [2022-04-15 08:45:40,885 INFO L290 TraceCheckUtils]: 96: Hoare triple {45175#true} assume true; {45175#true} is VALID [2022-04-15 08:45:40,885 INFO L290 TraceCheckUtils]: 95: Hoare triple {45175#true} assume !(0 == ~cond); {45175#true} is VALID [2022-04-15 08:45:40,885 INFO L290 TraceCheckUtils]: 94: Hoare triple {45175#true} ~cond := #in~cond; {45175#true} is VALID [2022-04-15 08:45:40,885 INFO L272 TraceCheckUtils]: 93: Hoare triple {45555#(< ~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)); {45175#true} is VALID [2022-04-15 08:45:40,886 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {45175#true} {45555#(< ~counter~0 9)} #90#return; {45555#(< ~counter~0 9)} is VALID [2022-04-15 08:45:40,886 INFO L290 TraceCheckUtils]: 91: Hoare triple {45175#true} assume true; {45175#true} is VALID [2022-04-15 08:45:40,886 INFO L290 TraceCheckUtils]: 90: Hoare triple {45175#true} assume !(0 == ~cond); {45175#true} is VALID [2022-04-15 08:45:40,886 INFO L290 TraceCheckUtils]: 89: Hoare triple {45175#true} ~cond := #in~cond; {45175#true} is VALID [2022-04-15 08:45:40,886 INFO L272 TraceCheckUtils]: 88: Hoare triple {45555#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45175#true} is VALID [2022-04-15 08:45:40,887 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {45175#true} {45555#(< ~counter~0 9)} #88#return; {45555#(< ~counter~0 9)} is VALID [2022-04-15 08:45:40,887 INFO L290 TraceCheckUtils]: 86: Hoare triple {45175#true} assume true; {45175#true} is VALID [2022-04-15 08:45:40,887 INFO L290 TraceCheckUtils]: 85: Hoare triple {45175#true} assume !(0 == ~cond); {45175#true} is VALID [2022-04-15 08:45:40,887 INFO L290 TraceCheckUtils]: 84: Hoare triple {45175#true} ~cond := #in~cond; {45175#true} is VALID [2022-04-15 08:45:40,887 INFO L272 TraceCheckUtils]: 83: Hoare triple {45555#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45175#true} is VALID [2022-04-15 08:45:40,900 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {45175#true} {45555#(< ~counter~0 9)} #86#return; {45555#(< ~counter~0 9)} is VALID [2022-04-15 08:45:40,900 INFO L290 TraceCheckUtils]: 81: Hoare triple {45175#true} assume true; {45175#true} is VALID [2022-04-15 08:45:40,900 INFO L290 TraceCheckUtils]: 80: Hoare triple {45175#true} assume !(0 == ~cond); {45175#true} is VALID [2022-04-15 08:45:40,900 INFO L290 TraceCheckUtils]: 79: Hoare triple {45175#true} ~cond := #in~cond; {45175#true} is VALID [2022-04-15 08:45:40,900 INFO L272 TraceCheckUtils]: 78: Hoare triple {45555#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45175#true} is VALID [2022-04-15 08:45:40,900 INFO L290 TraceCheckUtils]: 77: Hoare triple {45555#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {45555#(< ~counter~0 9)} is VALID [2022-04-15 08:45:40,901 INFO L290 TraceCheckUtils]: 76: Hoare triple {45628#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45555#(< ~counter~0 9)} is VALID [2022-04-15 08:45:40,901 INFO L290 TraceCheckUtils]: 75: Hoare triple {45628#(< ~counter~0 8)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {45628#(< ~counter~0 8)} is VALID [2022-04-15 08:45:40,902 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {45175#true} {45628#(< ~counter~0 8)} #92#return; {45628#(< ~counter~0 8)} is VALID [2022-04-15 08:45:40,902 INFO L290 TraceCheckUtils]: 73: Hoare triple {45175#true} assume true; {45175#true} is VALID [2022-04-15 08:45:40,902 INFO L290 TraceCheckUtils]: 72: Hoare triple {45175#true} assume !(0 == ~cond); {45175#true} is VALID [2022-04-15 08:45:40,902 INFO L290 TraceCheckUtils]: 71: Hoare triple {45175#true} ~cond := #in~cond; {45175#true} is VALID [2022-04-15 08:45:40,902 INFO L272 TraceCheckUtils]: 70: Hoare triple {45628#(< ~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)); {45175#true} is VALID [2022-04-15 08:45:40,903 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {45175#true} {45628#(< ~counter~0 8)} #90#return; {45628#(< ~counter~0 8)} is VALID [2022-04-15 08:45:40,903 INFO L290 TraceCheckUtils]: 68: Hoare triple {45175#true} assume true; {45175#true} is VALID [2022-04-15 08:45:40,903 INFO L290 TraceCheckUtils]: 67: Hoare triple {45175#true} assume !(0 == ~cond); {45175#true} is VALID [2022-04-15 08:45:40,903 INFO L290 TraceCheckUtils]: 66: Hoare triple {45175#true} ~cond := #in~cond; {45175#true} is VALID [2022-04-15 08:45:40,903 INFO L272 TraceCheckUtils]: 65: Hoare triple {45628#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45175#true} is VALID [2022-04-15 08:45:40,904 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {45175#true} {45628#(< ~counter~0 8)} #88#return; {45628#(< ~counter~0 8)} is VALID [2022-04-15 08:45:40,904 INFO L290 TraceCheckUtils]: 63: Hoare triple {45175#true} assume true; {45175#true} is VALID [2022-04-15 08:45:40,904 INFO L290 TraceCheckUtils]: 62: Hoare triple {45175#true} assume !(0 == ~cond); {45175#true} is VALID [2022-04-15 08:45:40,904 INFO L290 TraceCheckUtils]: 61: Hoare triple {45175#true} ~cond := #in~cond; {45175#true} is VALID [2022-04-15 08:45:40,904 INFO L272 TraceCheckUtils]: 60: Hoare triple {45628#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45175#true} is VALID [2022-04-15 08:45:40,904 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {45175#true} {45628#(< ~counter~0 8)} #86#return; {45628#(< ~counter~0 8)} is VALID [2022-04-15 08:45:40,904 INFO L290 TraceCheckUtils]: 58: Hoare triple {45175#true} assume true; {45175#true} is VALID [2022-04-15 08:45:40,905 INFO L290 TraceCheckUtils]: 57: Hoare triple {45175#true} assume !(0 == ~cond); {45175#true} is VALID [2022-04-15 08:45:40,905 INFO L290 TraceCheckUtils]: 56: Hoare triple {45175#true} ~cond := #in~cond; {45175#true} is VALID [2022-04-15 08:45:40,905 INFO L272 TraceCheckUtils]: 55: Hoare triple {45628#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45175#true} is VALID [2022-04-15 08:45:40,905 INFO L290 TraceCheckUtils]: 54: Hoare triple {45628#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {45628#(< ~counter~0 8)} is VALID [2022-04-15 08:45:40,906 INFO L290 TraceCheckUtils]: 53: Hoare triple {45698#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45628#(< ~counter~0 8)} is VALID [2022-04-15 08:45:40,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {45698#(< ~counter~0 7)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {45698#(< ~counter~0 7)} is VALID [2022-04-15 08:45:40,906 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {45175#true} {45698#(< ~counter~0 7)} #92#return; {45698#(< ~counter~0 7)} is VALID [2022-04-15 08:45:40,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {45175#true} assume true; {45175#true} is VALID [2022-04-15 08:45:40,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {45175#true} assume !(0 == ~cond); {45175#true} is VALID [2022-04-15 08:45:40,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {45175#true} ~cond := #in~cond; {45175#true} is VALID [2022-04-15 08:45:40,907 INFO L272 TraceCheckUtils]: 47: Hoare triple {45698#(< ~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)); {45175#true} is VALID [2022-04-15 08:45:40,907 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {45175#true} {45698#(< ~counter~0 7)} #90#return; {45698#(< ~counter~0 7)} is VALID [2022-04-15 08:45:40,907 INFO L290 TraceCheckUtils]: 45: Hoare triple {45175#true} assume true; {45175#true} is VALID [2022-04-15 08:45:40,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {45175#true} assume !(0 == ~cond); {45175#true} is VALID [2022-04-15 08:45:40,907 INFO L290 TraceCheckUtils]: 43: Hoare triple {45175#true} ~cond := #in~cond; {45175#true} is VALID [2022-04-15 08:45:40,907 INFO L272 TraceCheckUtils]: 42: Hoare triple {45698#(< ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45175#true} is VALID [2022-04-15 08:45:40,908 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {45175#true} {45698#(< ~counter~0 7)} #88#return; {45698#(< ~counter~0 7)} is VALID [2022-04-15 08:45:40,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {45175#true} assume true; {45175#true} is VALID [2022-04-15 08:45:40,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {45175#true} assume !(0 == ~cond); {45175#true} is VALID [2022-04-15 08:45:40,908 INFO L290 TraceCheckUtils]: 38: Hoare triple {45175#true} ~cond := #in~cond; {45175#true} is VALID [2022-04-15 08:45:40,908 INFO L272 TraceCheckUtils]: 37: Hoare triple {45698#(< ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45175#true} is VALID [2022-04-15 08:45:40,909 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {45175#true} {45698#(< ~counter~0 7)} #86#return; {45698#(< ~counter~0 7)} is VALID [2022-04-15 08:45:40,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {45175#true} assume true; {45175#true} is VALID [2022-04-15 08:45:40,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {45175#true} assume !(0 == ~cond); {45175#true} is VALID [2022-04-15 08:45:40,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {45175#true} ~cond := #in~cond; {45175#true} is VALID [2022-04-15 08:45:40,909 INFO L272 TraceCheckUtils]: 32: Hoare triple {45698#(< ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45175#true} is VALID [2022-04-15 08:45:40,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {45698#(< ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {45698#(< ~counter~0 7)} is VALID [2022-04-15 08:45:40,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {45485#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45698#(< ~counter~0 7)} is VALID [2022-04-15 08:45:40,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {45485#(<= ~counter~0 5)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {45485#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:40,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {45485#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {45485#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:40,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {45412#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45485#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:40,911 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {45175#true} {45412#(<= ~counter~0 4)} #84#return; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {45175#true} assume true; {45175#true} is VALID [2022-04-15 08:45:40,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {45175#true} assume !(0 == ~cond); {45175#true} is VALID [2022-04-15 08:45:40,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {45175#true} ~cond := #in~cond; {45175#true} is VALID [2022-04-15 08:45:40,912 INFO L272 TraceCheckUtils]: 22: Hoare triple {45412#(<= ~counter~0 4)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {45175#true} is VALID [2022-04-15 08:45:40,912 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {45175#true} {45412#(<= ~counter~0 4)} #82#return; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {45175#true} assume true; {45175#true} is VALID [2022-04-15 08:45:40,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {45175#true} assume !(0 == ~cond); {45175#true} is VALID [2022-04-15 08:45:40,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {45175#true} ~cond := #in~cond; {45175#true} is VALID [2022-04-15 08:45:40,912 INFO L272 TraceCheckUtils]: 17: Hoare triple {45412#(<= ~counter~0 4)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {45175#true} is VALID [2022-04-15 08:45:40,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {45412#(<= ~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; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,913 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45175#true} {45412#(<= ~counter~0 4)} #80#return; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {45175#true} assume true; {45175#true} is VALID [2022-04-15 08:45:40,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {45175#true} assume !(0 == ~cond); {45175#true} is VALID [2022-04-15 08:45:40,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {45175#true} ~cond := #in~cond; {45175#true} is VALID [2022-04-15 08:45:40,913 INFO L272 TraceCheckUtils]: 11: Hoare triple {45412#(<= ~counter~0 4)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {45175#true} is VALID [2022-04-15 08:45:40,914 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45175#true} {45412#(<= ~counter~0 4)} #78#return; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {45175#true} assume true; {45175#true} is VALID [2022-04-15 08:45:40,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {45175#true} assume !(0 == ~cond); {45175#true} is VALID [2022-04-15 08:45:40,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {45175#true} ~cond := #in~cond; {45175#true} is VALID [2022-04-15 08:45:40,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {45412#(<= ~counter~0 4)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {45175#true} is VALID [2022-04-15 08:45:40,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {45412#(<= ~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; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {45412#(<= ~counter~0 4)} call #t~ret8 := main(); {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45412#(<= ~counter~0 4)} {45175#true} #98#return; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {45412#(<= ~counter~0 4)} assume true; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {45175#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; {45412#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:40,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {45175#true} call ULTIMATE.init(); {45175#true} is VALID [2022-04-15 08:45:40,916 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-15 08:45:40,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:45:40,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852251525] [2022-04-15 08:45:40,916 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:45:40,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109294162] [2022-04-15 08:45:40,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109294162] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:45:40,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:45:40,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-15 08:45:40,916 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:45:40,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [572118615] [2022-04-15 08:45:40,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [572118615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:45:40,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:45:40,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 08:45:40,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062917961] [2022-04-15 08:45:40,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:45:40,918 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-15 08:45:40,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:45:40,918 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-15 08:45:40,977 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-15 08:45:40,977 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 08:45:40,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:45:40,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 08:45:40,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:45:40,978 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-15 08:45:42,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:42,216 INFO L93 Difference]: Finished difference Result 644 states and 881 transitions. [2022-04-15 08:45:42,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 08:45:42,216 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-15 08:45:42,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:45:42,217 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-15 08:45:42,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 152 transitions. [2022-04-15 08:45:42,218 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-15 08:45:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 152 transitions. [2022-04-15 08:45:42,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 152 transitions. [2022-04-15 08:45:42,337 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-15 08:45:42,348 INFO L225 Difference]: With dead ends: 644 [2022-04-15 08:45:42,348 INFO L226 Difference]: Without dead ends: 474 [2022-04-15 08:45:42,349 INFO L912 BasicCegarLoop]: 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-15 08:45:42,349 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 57 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:45:42,350 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 187 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:45:42,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-04-15 08:45:43,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-04-15 08:45:43,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:45:43,283 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-15 08:45:43,284 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-15 08:45:43,284 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-15 08:45:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:43,294 INFO L93 Difference]: Finished difference Result 474 states and 616 transitions. [2022-04-15 08:45:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 616 transitions. [2022-04-15 08:45:43,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:45:43,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:45:43,296 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-15 08:45:43,297 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-15 08:45:43,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:43,309 INFO L93 Difference]: Finished difference Result 474 states and 616 transitions. [2022-04-15 08:45:43,309 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 616 transitions. [2022-04-15 08:45:43,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:45:43,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:45:43,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:45:43,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:45:43,311 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-15 08:45:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 616 transitions. [2022-04-15 08:45:43,323 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 616 transitions. Word has length 112 [2022-04-15 08:45:43,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:45:43,324 INFO L478 AbstractCegarLoop]: Abstraction has 474 states and 616 transitions. [2022-04-15 08:45:43,324 INFO L479 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-15 08:45:43,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 474 states and 616 transitions. [2022-04-15 08:45:44,316 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-15 08:45:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 616 transitions. [2022-04-15 08:45:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-15 08:45:44,317 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:45:44,317 INFO L499 BasicCegarLoop]: 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-15 08:45:44,335 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-15 08:45:44,517 WARN L460 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-15 08:45:44,517 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:45:44,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:45:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1546024104, now seen corresponding path program 5 times [2022-04-15 08:45:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:45:44,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1429166331] [2022-04-15 08:45:44,518 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:45:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1546024104, now seen corresponding path program 6 times [2022-04-15 08:45:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:45:44,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243624096] [2022-04-15 08:45:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:45:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:45:44,530 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:45:44,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [9472183] [2022-04-15 08:45:44,530 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 08:45:44,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:45:44,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:45:44,531 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-15 08:45:44,532 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-15 08:45:44,620 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 08:45:44,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:45:44,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 08:45:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:45:44,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:45:45,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {49052#true} call ULTIMATE.init(); {49052#true} is VALID [2022-04-15 08:45:45,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {49052#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; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {49060#(<= ~counter~0 0)} assume true; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49060#(<= ~counter~0 0)} {49052#true} #98#return; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {49060#(<= ~counter~0 0)} call #t~ret8 := main(); {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {49060#(<= ~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; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,062 INFO L272 TraceCheckUtils]: 6: Hoare triple {49060#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {49060#(<= ~counter~0 0)} ~cond := #in~cond; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {49060#(<= ~counter~0 0)} assume !(0 == ~cond); {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {49060#(<= ~counter~0 0)} assume true; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,063 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {49060#(<= ~counter~0 0)} {49060#(<= ~counter~0 0)} #78#return; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,063 INFO L272 TraceCheckUtils]: 11: Hoare triple {49060#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {49060#(<= ~counter~0 0)} ~cond := #in~cond; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {49060#(<= ~counter~0 0)} assume !(0 == ~cond); {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {49060#(<= ~counter~0 0)} assume true; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,064 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {49060#(<= ~counter~0 0)} {49060#(<= ~counter~0 0)} #80#return; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {49060#(<= ~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; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,065 INFO L272 TraceCheckUtils]: 17: Hoare triple {49060#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {49060#(<= ~counter~0 0)} ~cond := #in~cond; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {49060#(<= ~counter~0 0)} assume !(0 == ~cond); {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {49060#(<= ~counter~0 0)} assume true; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,066 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {49060#(<= ~counter~0 0)} {49060#(<= ~counter~0 0)} #82#return; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,067 INFO L272 TraceCheckUtils]: 22: Hoare triple {49060#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {49060#(<= ~counter~0 0)} ~cond := #in~cond; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {49060#(<= ~counter~0 0)} assume !(0 == ~cond); {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {49060#(<= ~counter~0 0)} assume true; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,068 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {49060#(<= ~counter~0 0)} {49060#(<= ~counter~0 0)} #84#return; {49060#(<= ~counter~0 0)} is VALID [2022-04-15 08:45:45,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {49060#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49139#(<= ~counter~0 1)} is VALID [2022-04-15 08:45:45,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {49139#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {49139#(<= ~counter~0 1)} is VALID [2022-04-15 08:45:45,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {49139#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49139#(<= ~counter~0 1)} is VALID [2022-04-15 08:45:45,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {49139#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {49149#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,071 INFO L272 TraceCheckUtils]: 32: Hoare triple {49149#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {49149#(<= ~counter~0 2)} ~cond := #in~cond; {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {49149#(<= ~counter~0 2)} assume !(0 == ~cond); {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {49149#(<= ~counter~0 2)} assume true; {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,072 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {49149#(<= ~counter~0 2)} {49149#(<= ~counter~0 2)} #86#return; {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,073 INFO L272 TraceCheckUtils]: 37: Hoare triple {49149#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {49149#(<= ~counter~0 2)} ~cond := #in~cond; {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,073 INFO L290 TraceCheckUtils]: 39: Hoare triple {49149#(<= ~counter~0 2)} assume !(0 == ~cond); {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {49149#(<= ~counter~0 2)} assume true; {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,074 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {49149#(<= ~counter~0 2)} {49149#(<= ~counter~0 2)} #88#return; {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,075 INFO L272 TraceCheckUtils]: 42: Hoare triple {49149#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {49149#(<= ~counter~0 2)} ~cond := #in~cond; {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {49149#(<= ~counter~0 2)} assume !(0 == ~cond); {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {49149#(<= ~counter~0 2)} assume true; {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,076 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {49149#(<= ~counter~0 2)} {49149#(<= ~counter~0 2)} #90#return; {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,076 INFO L272 TraceCheckUtils]: 47: Hoare triple {49149#(<= ~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)); {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,077 INFO L290 TraceCheckUtils]: 48: Hoare triple {49149#(<= ~counter~0 2)} ~cond := #in~cond; {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,077 INFO L290 TraceCheckUtils]: 49: Hoare triple {49149#(<= ~counter~0 2)} assume !(0 == ~cond); {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,077 INFO L290 TraceCheckUtils]: 50: Hoare triple {49149#(<= ~counter~0 2)} assume true; {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,078 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {49149#(<= ~counter~0 2)} {49149#(<= ~counter~0 2)} #92#return; {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,078 INFO L290 TraceCheckUtils]: 52: Hoare triple {49149#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,078 INFO L290 TraceCheckUtils]: 53: Hoare triple {49149#(<= ~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; {49149#(<= ~counter~0 2)} is VALID [2022-04-15 08:45:45,079 INFO L290 TraceCheckUtils]: 54: Hoare triple {49149#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49222#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:45,079 INFO L290 TraceCheckUtils]: 55: Hoare triple {49222#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {49222#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:45,080 INFO L290 TraceCheckUtils]: 56: Hoare triple {49222#(<= ~counter~0 3)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49222#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:45,080 INFO L290 TraceCheckUtils]: 57: Hoare triple {49222#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,081 INFO L290 TraceCheckUtils]: 58: Hoare triple {49232#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,081 INFO L272 TraceCheckUtils]: 59: Hoare triple {49232#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,081 INFO L290 TraceCheckUtils]: 60: Hoare triple {49232#(<= ~counter~0 4)} ~cond := #in~cond; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,082 INFO L290 TraceCheckUtils]: 61: Hoare triple {49232#(<= ~counter~0 4)} assume !(0 == ~cond); {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,082 INFO L290 TraceCheckUtils]: 62: Hoare triple {49232#(<= ~counter~0 4)} assume true; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,082 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {49232#(<= ~counter~0 4)} {49232#(<= ~counter~0 4)} #86#return; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,083 INFO L272 TraceCheckUtils]: 64: Hoare triple {49232#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,083 INFO L290 TraceCheckUtils]: 65: Hoare triple {49232#(<= ~counter~0 4)} ~cond := #in~cond; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,083 INFO L290 TraceCheckUtils]: 66: Hoare triple {49232#(<= ~counter~0 4)} assume !(0 == ~cond); {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,084 INFO L290 TraceCheckUtils]: 67: Hoare triple {49232#(<= ~counter~0 4)} assume true; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,084 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {49232#(<= ~counter~0 4)} {49232#(<= ~counter~0 4)} #88#return; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,085 INFO L272 TraceCheckUtils]: 69: Hoare triple {49232#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,085 INFO L290 TraceCheckUtils]: 70: Hoare triple {49232#(<= ~counter~0 4)} ~cond := #in~cond; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,085 INFO L290 TraceCheckUtils]: 71: Hoare triple {49232#(<= ~counter~0 4)} assume !(0 == ~cond); {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,086 INFO L290 TraceCheckUtils]: 72: Hoare triple {49232#(<= ~counter~0 4)} assume true; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,086 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {49232#(<= ~counter~0 4)} {49232#(<= ~counter~0 4)} #90#return; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,087 INFO L272 TraceCheckUtils]: 74: Hoare triple {49232#(<= ~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)); {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,087 INFO L290 TraceCheckUtils]: 75: Hoare triple {49232#(<= ~counter~0 4)} ~cond := #in~cond; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,087 INFO L290 TraceCheckUtils]: 76: Hoare triple {49232#(<= ~counter~0 4)} assume !(0 == ~cond); {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,087 INFO L290 TraceCheckUtils]: 77: Hoare triple {49232#(<= ~counter~0 4)} assume true; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,088 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {49232#(<= ~counter~0 4)} {49232#(<= ~counter~0 4)} #92#return; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,088 INFO L290 TraceCheckUtils]: 79: Hoare triple {49232#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,089 INFO L290 TraceCheckUtils]: 80: Hoare triple {49232#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,089 INFO L290 TraceCheckUtils]: 81: Hoare triple {49302#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,090 INFO L272 TraceCheckUtils]: 82: Hoare triple {49302#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,090 INFO L290 TraceCheckUtils]: 83: Hoare triple {49302#(<= ~counter~0 5)} ~cond := #in~cond; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,090 INFO L290 TraceCheckUtils]: 84: Hoare triple {49302#(<= ~counter~0 5)} assume !(0 == ~cond); {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,091 INFO L290 TraceCheckUtils]: 85: Hoare triple {49302#(<= ~counter~0 5)} assume true; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,091 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {49302#(<= ~counter~0 5)} {49302#(<= ~counter~0 5)} #86#return; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,092 INFO L272 TraceCheckUtils]: 87: Hoare triple {49302#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,092 INFO L290 TraceCheckUtils]: 88: Hoare triple {49302#(<= ~counter~0 5)} ~cond := #in~cond; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,092 INFO L290 TraceCheckUtils]: 89: Hoare triple {49302#(<= ~counter~0 5)} assume !(0 == ~cond); {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,093 INFO L290 TraceCheckUtils]: 90: Hoare triple {49302#(<= ~counter~0 5)} assume true; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,093 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {49302#(<= ~counter~0 5)} {49302#(<= ~counter~0 5)} #88#return; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,094 INFO L272 TraceCheckUtils]: 92: Hoare triple {49302#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,094 INFO L290 TraceCheckUtils]: 93: Hoare triple {49302#(<= ~counter~0 5)} ~cond := #in~cond; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,094 INFO L290 TraceCheckUtils]: 94: Hoare triple {49302#(<= ~counter~0 5)} assume !(0 == ~cond); {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,094 INFO L290 TraceCheckUtils]: 95: Hoare triple {49302#(<= ~counter~0 5)} assume true; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,095 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {49302#(<= ~counter~0 5)} {49302#(<= ~counter~0 5)} #90#return; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,095 INFO L272 TraceCheckUtils]: 97: Hoare triple {49302#(<= ~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)); {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,096 INFO L290 TraceCheckUtils]: 98: Hoare triple {49302#(<= ~counter~0 5)} ~cond := #in~cond; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,096 INFO L290 TraceCheckUtils]: 99: Hoare triple {49302#(<= ~counter~0 5)} assume !(0 == ~cond); {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,096 INFO L290 TraceCheckUtils]: 100: Hoare triple {49302#(<= ~counter~0 5)} assume true; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,097 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {49302#(<= ~counter~0 5)} {49302#(<= ~counter~0 5)} #92#return; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,097 INFO L290 TraceCheckUtils]: 102: Hoare triple {49302#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,097 INFO L290 TraceCheckUtils]: 103: Hoare triple {49302#(<= ~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; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,098 INFO L290 TraceCheckUtils]: 104: Hoare triple {49302#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49375#(<= ~counter~0 6)} is VALID [2022-04-15 08:45:45,098 INFO L290 TraceCheckUtils]: 105: Hoare triple {49375#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {49375#(<= ~counter~0 6)} is VALID [2022-04-15 08:45:45,099 INFO L290 TraceCheckUtils]: 106: Hoare triple {49375#(<= ~counter~0 6)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49375#(<= ~counter~0 6)} is VALID [2022-04-15 08:45:45,099 INFO L290 TraceCheckUtils]: 107: Hoare triple {49375#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49385#(<= |main_#t~post7| 6)} is VALID [2022-04-15 08:45:45,099 INFO L290 TraceCheckUtils]: 108: Hoare triple {49385#(<= |main_#t~post7| 6)} assume !(#t~post7 < 10);havoc #t~post7; {49053#false} is VALID [2022-04-15 08:45:45,099 INFO L290 TraceCheckUtils]: 109: Hoare triple {49053#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; {49053#false} is VALID [2022-04-15 08:45:45,099 INFO L290 TraceCheckUtils]: 110: Hoare triple {49053#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49053#false} is VALID [2022-04-15 08:45:45,100 INFO L290 TraceCheckUtils]: 111: Hoare triple {49053#false} assume !(#t~post6 < 10);havoc #t~post6; {49053#false} is VALID [2022-04-15 08:45:45,100 INFO L272 TraceCheckUtils]: 112: Hoare triple {49053#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {49053#false} is VALID [2022-04-15 08:45:45,100 INFO L290 TraceCheckUtils]: 113: Hoare triple {49053#false} ~cond := #in~cond; {49053#false} is VALID [2022-04-15 08:45:45,100 INFO L290 TraceCheckUtils]: 114: Hoare triple {49053#false} assume 0 == ~cond; {49053#false} is VALID [2022-04-15 08:45:45,100 INFO L290 TraceCheckUtils]: 115: Hoare triple {49053#false} assume !false; {49053#false} is VALID [2022-04-15 08:45:45,100 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-15 08:45:45,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:45:45,521 INFO L290 TraceCheckUtils]: 115: Hoare triple {49053#false} assume !false; {49053#false} is VALID [2022-04-15 08:45:45,521 INFO L290 TraceCheckUtils]: 114: Hoare triple {49053#false} assume 0 == ~cond; {49053#false} is VALID [2022-04-15 08:45:45,521 INFO L290 TraceCheckUtils]: 113: Hoare triple {49053#false} ~cond := #in~cond; {49053#false} is VALID [2022-04-15 08:45:45,521 INFO L272 TraceCheckUtils]: 112: Hoare triple {49053#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {49053#false} is VALID [2022-04-15 08:45:45,521 INFO L290 TraceCheckUtils]: 111: Hoare triple {49053#false} assume !(#t~post6 < 10);havoc #t~post6; {49053#false} is VALID [2022-04-15 08:45:45,521 INFO L290 TraceCheckUtils]: 110: Hoare triple {49053#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49053#false} is VALID [2022-04-15 08:45:45,521 INFO L290 TraceCheckUtils]: 109: Hoare triple {49053#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; {49053#false} is VALID [2022-04-15 08:45:45,521 INFO L290 TraceCheckUtils]: 108: Hoare triple {49431#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {49053#false} is VALID [2022-04-15 08:45:45,522 INFO L290 TraceCheckUtils]: 107: Hoare triple {49435#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49431#(< |main_#t~post7| 10)} is VALID [2022-04-15 08:45:45,522 INFO L290 TraceCheckUtils]: 106: Hoare triple {49435#(< ~counter~0 10)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49435#(< ~counter~0 10)} is VALID [2022-04-15 08:45:45,522 INFO L290 TraceCheckUtils]: 105: Hoare triple {49435#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {49435#(< ~counter~0 10)} is VALID [2022-04-15 08:45:45,523 INFO L290 TraceCheckUtils]: 104: Hoare triple {49445#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49435#(< ~counter~0 10)} is VALID [2022-04-15 08:45:45,524 INFO L290 TraceCheckUtils]: 103: Hoare triple {49445#(< ~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; {49445#(< ~counter~0 9)} is VALID [2022-04-15 08:45:45,524 INFO L290 TraceCheckUtils]: 102: Hoare triple {49445#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {49445#(< ~counter~0 9)} is VALID [2022-04-15 08:45:45,524 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {49052#true} {49445#(< ~counter~0 9)} #92#return; {49445#(< ~counter~0 9)} is VALID [2022-04-15 08:45:45,525 INFO L290 TraceCheckUtils]: 100: Hoare triple {49052#true} assume true; {49052#true} is VALID [2022-04-15 08:45:45,525 INFO L290 TraceCheckUtils]: 99: Hoare triple {49052#true} assume !(0 == ~cond); {49052#true} is VALID [2022-04-15 08:45:45,525 INFO L290 TraceCheckUtils]: 98: Hoare triple {49052#true} ~cond := #in~cond; {49052#true} is VALID [2022-04-15 08:45:45,525 INFO L272 TraceCheckUtils]: 97: Hoare triple {49445#(< ~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)); {49052#true} is VALID [2022-04-15 08:45:45,525 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {49052#true} {49445#(< ~counter~0 9)} #90#return; {49445#(< ~counter~0 9)} is VALID [2022-04-15 08:45:45,525 INFO L290 TraceCheckUtils]: 95: Hoare triple {49052#true} assume true; {49052#true} is VALID [2022-04-15 08:45:45,525 INFO L290 TraceCheckUtils]: 94: Hoare triple {49052#true} assume !(0 == ~cond); {49052#true} is VALID [2022-04-15 08:45:45,525 INFO L290 TraceCheckUtils]: 93: Hoare triple {49052#true} ~cond := #in~cond; {49052#true} is VALID [2022-04-15 08:45:45,526 INFO L272 TraceCheckUtils]: 92: Hoare triple {49445#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49052#true} is VALID [2022-04-15 08:45:45,526 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {49052#true} {49445#(< ~counter~0 9)} #88#return; {49445#(< ~counter~0 9)} is VALID [2022-04-15 08:45:45,526 INFO L290 TraceCheckUtils]: 90: Hoare triple {49052#true} assume true; {49052#true} is VALID [2022-04-15 08:45:45,526 INFO L290 TraceCheckUtils]: 89: Hoare triple {49052#true} assume !(0 == ~cond); {49052#true} is VALID [2022-04-15 08:45:45,526 INFO L290 TraceCheckUtils]: 88: Hoare triple {49052#true} ~cond := #in~cond; {49052#true} is VALID [2022-04-15 08:45:45,526 INFO L272 TraceCheckUtils]: 87: Hoare triple {49445#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49052#true} is VALID [2022-04-15 08:45:45,527 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {49052#true} {49445#(< ~counter~0 9)} #86#return; {49445#(< ~counter~0 9)} is VALID [2022-04-15 08:45:45,527 INFO L290 TraceCheckUtils]: 85: Hoare triple {49052#true} assume true; {49052#true} is VALID [2022-04-15 08:45:45,527 INFO L290 TraceCheckUtils]: 84: Hoare triple {49052#true} assume !(0 == ~cond); {49052#true} is VALID [2022-04-15 08:45:45,527 INFO L290 TraceCheckUtils]: 83: Hoare triple {49052#true} ~cond := #in~cond; {49052#true} is VALID [2022-04-15 08:45:45,527 INFO L272 TraceCheckUtils]: 82: Hoare triple {49445#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49052#true} is VALID [2022-04-15 08:45:45,527 INFO L290 TraceCheckUtils]: 81: Hoare triple {49445#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {49445#(< ~counter~0 9)} is VALID [2022-04-15 08:45:45,528 INFO L290 TraceCheckUtils]: 80: Hoare triple {49518#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49445#(< ~counter~0 9)} is VALID [2022-04-15 08:45:45,528 INFO L290 TraceCheckUtils]: 79: Hoare triple {49518#(< ~counter~0 8)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {49518#(< ~counter~0 8)} is VALID [2022-04-15 08:45:45,529 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {49052#true} {49518#(< ~counter~0 8)} #92#return; {49518#(< ~counter~0 8)} is VALID [2022-04-15 08:45:45,529 INFO L290 TraceCheckUtils]: 77: Hoare triple {49052#true} assume true; {49052#true} is VALID [2022-04-15 08:45:45,529 INFO L290 TraceCheckUtils]: 76: Hoare triple {49052#true} assume !(0 == ~cond); {49052#true} is VALID [2022-04-15 08:45:45,529 INFO L290 TraceCheckUtils]: 75: Hoare triple {49052#true} ~cond := #in~cond; {49052#true} is VALID [2022-04-15 08:45:45,529 INFO L272 TraceCheckUtils]: 74: Hoare triple {49518#(< ~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)); {49052#true} is VALID [2022-04-15 08:45:45,529 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {49052#true} {49518#(< ~counter~0 8)} #90#return; {49518#(< ~counter~0 8)} is VALID [2022-04-15 08:45:45,529 INFO L290 TraceCheckUtils]: 72: Hoare triple {49052#true} assume true; {49052#true} is VALID [2022-04-15 08:45:45,530 INFO L290 TraceCheckUtils]: 71: Hoare triple {49052#true} assume !(0 == ~cond); {49052#true} is VALID [2022-04-15 08:45:45,530 INFO L290 TraceCheckUtils]: 70: Hoare triple {49052#true} ~cond := #in~cond; {49052#true} is VALID [2022-04-15 08:45:45,530 INFO L272 TraceCheckUtils]: 69: Hoare triple {49518#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49052#true} is VALID [2022-04-15 08:45:45,530 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {49052#true} {49518#(< ~counter~0 8)} #88#return; {49518#(< ~counter~0 8)} is VALID [2022-04-15 08:45:45,530 INFO L290 TraceCheckUtils]: 67: Hoare triple {49052#true} assume true; {49052#true} is VALID [2022-04-15 08:45:45,530 INFO L290 TraceCheckUtils]: 66: Hoare triple {49052#true} assume !(0 == ~cond); {49052#true} is VALID [2022-04-15 08:45:45,530 INFO L290 TraceCheckUtils]: 65: Hoare triple {49052#true} ~cond := #in~cond; {49052#true} is VALID [2022-04-15 08:45:45,530 INFO L272 TraceCheckUtils]: 64: Hoare triple {49518#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49052#true} is VALID [2022-04-15 08:45:45,531 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {49052#true} {49518#(< ~counter~0 8)} #86#return; {49518#(< ~counter~0 8)} is VALID [2022-04-15 08:45:45,531 INFO L290 TraceCheckUtils]: 62: Hoare triple {49052#true} assume true; {49052#true} is VALID [2022-04-15 08:45:45,531 INFO L290 TraceCheckUtils]: 61: Hoare triple {49052#true} assume !(0 == ~cond); {49052#true} is VALID [2022-04-15 08:45:45,531 INFO L290 TraceCheckUtils]: 60: Hoare triple {49052#true} ~cond := #in~cond; {49052#true} is VALID [2022-04-15 08:45:45,531 INFO L272 TraceCheckUtils]: 59: Hoare triple {49518#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49052#true} is VALID [2022-04-15 08:45:45,531 INFO L290 TraceCheckUtils]: 58: Hoare triple {49518#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {49518#(< ~counter~0 8)} is VALID [2022-04-15 08:45:45,532 INFO L290 TraceCheckUtils]: 57: Hoare triple {49375#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49518#(< ~counter~0 8)} is VALID [2022-04-15 08:45:45,532 INFO L290 TraceCheckUtils]: 56: Hoare triple {49375#(<= ~counter~0 6)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49375#(<= ~counter~0 6)} is VALID [2022-04-15 08:45:45,532 INFO L290 TraceCheckUtils]: 55: Hoare triple {49375#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {49375#(<= ~counter~0 6)} is VALID [2022-04-15 08:45:45,533 INFO L290 TraceCheckUtils]: 54: Hoare triple {49302#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49375#(<= ~counter~0 6)} is VALID [2022-04-15 08:45:45,533 INFO L290 TraceCheckUtils]: 53: Hoare triple {49302#(<= ~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; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,534 INFO L290 TraceCheckUtils]: 52: Hoare triple {49302#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,534 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {49052#true} {49302#(<= ~counter~0 5)} #92#return; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,534 INFO L290 TraceCheckUtils]: 50: Hoare triple {49052#true} assume true; {49052#true} is VALID [2022-04-15 08:45:45,534 INFO L290 TraceCheckUtils]: 49: Hoare triple {49052#true} assume !(0 == ~cond); {49052#true} is VALID [2022-04-15 08:45:45,534 INFO L290 TraceCheckUtils]: 48: Hoare triple {49052#true} ~cond := #in~cond; {49052#true} is VALID [2022-04-15 08:45:45,534 INFO L272 TraceCheckUtils]: 47: Hoare triple {49302#(<= ~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)); {49052#true} is VALID [2022-04-15 08:45:45,535 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {49052#true} {49302#(<= ~counter~0 5)} #90#return; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,535 INFO L290 TraceCheckUtils]: 45: Hoare triple {49052#true} assume true; {49052#true} is VALID [2022-04-15 08:45:45,535 INFO L290 TraceCheckUtils]: 44: Hoare triple {49052#true} assume !(0 == ~cond); {49052#true} is VALID [2022-04-15 08:45:45,535 INFO L290 TraceCheckUtils]: 43: Hoare triple {49052#true} ~cond := #in~cond; {49052#true} is VALID [2022-04-15 08:45:45,535 INFO L272 TraceCheckUtils]: 42: Hoare triple {49302#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49052#true} is VALID [2022-04-15 08:45:45,536 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {49052#true} {49302#(<= ~counter~0 5)} #88#return; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {49052#true} assume true; {49052#true} is VALID [2022-04-15 08:45:45,536 INFO L290 TraceCheckUtils]: 39: Hoare triple {49052#true} assume !(0 == ~cond); {49052#true} is VALID [2022-04-15 08:45:45,536 INFO L290 TraceCheckUtils]: 38: Hoare triple {49052#true} ~cond := #in~cond; {49052#true} is VALID [2022-04-15 08:45:45,536 INFO L272 TraceCheckUtils]: 37: Hoare triple {49302#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49052#true} is VALID [2022-04-15 08:45:45,536 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {49052#true} {49302#(<= ~counter~0 5)} #86#return; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {49052#true} assume true; {49052#true} is VALID [2022-04-15 08:45:45,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {49052#true} assume !(0 == ~cond); {49052#true} is VALID [2022-04-15 08:45:45,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {49052#true} ~cond := #in~cond; {49052#true} is VALID [2022-04-15 08:45:45,537 INFO L272 TraceCheckUtils]: 32: Hoare triple {49302#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49052#true} is VALID [2022-04-15 08:45:45,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {49302#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {49232#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49302#(<= ~counter~0 5)} is VALID [2022-04-15 08:45:45,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {49232#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {49232#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {49222#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49232#(<= ~counter~0 4)} is VALID [2022-04-15 08:45:45,539 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {49052#true} {49222#(<= ~counter~0 3)} #84#return; {49222#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:45,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {49052#true} assume true; {49052#true} is VALID [2022-04-15 08:45:45,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {49052#true} assume !(0 == ~cond); {49052#true} is VALID [2022-04-15 08:45:45,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {49052#true} ~cond := #in~cond; {49052#true} is VALID [2022-04-15 08:45:45,539 INFO L272 TraceCheckUtils]: 22: Hoare triple {49222#(<= ~counter~0 3)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {49052#true} is VALID [2022-04-15 08:45:45,540 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {49052#true} {49222#(<= ~counter~0 3)} #82#return; {49222#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:45,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {49052#true} assume true; {49052#true} is VALID [2022-04-15 08:45:45,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {49052#true} assume !(0 == ~cond); {49052#true} is VALID [2022-04-15 08:45:45,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {49052#true} ~cond := #in~cond; {49052#true} is VALID [2022-04-15 08:45:45,540 INFO L272 TraceCheckUtils]: 17: Hoare triple {49222#(<= ~counter~0 3)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {49052#true} is VALID [2022-04-15 08:45:45,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {49222#(<= ~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; {49222#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:45,540 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {49052#true} {49222#(<= ~counter~0 3)} #80#return; {49222#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:45,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {49052#true} assume true; {49052#true} is VALID [2022-04-15 08:45:45,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {49052#true} assume !(0 == ~cond); {49052#true} is VALID [2022-04-15 08:45:45,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {49052#true} ~cond := #in~cond; {49052#true} is VALID [2022-04-15 08:45:45,541 INFO L272 TraceCheckUtils]: 11: Hoare triple {49222#(<= ~counter~0 3)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {49052#true} is VALID [2022-04-15 08:45:45,541 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {49052#true} {49222#(<= ~counter~0 3)} #78#return; {49222#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:45,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {49052#true} assume true; {49052#true} is VALID [2022-04-15 08:45:45,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {49052#true} assume !(0 == ~cond); {49052#true} is VALID [2022-04-15 08:45:45,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {49052#true} ~cond := #in~cond; {49052#true} is VALID [2022-04-15 08:45:45,541 INFO L272 TraceCheckUtils]: 6: Hoare triple {49222#(<= ~counter~0 3)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {49052#true} is VALID [2022-04-15 08:45:45,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {49222#(<= ~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; {49222#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:45,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {49222#(<= ~counter~0 3)} call #t~ret8 := main(); {49222#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:45,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49222#(<= ~counter~0 3)} {49052#true} #98#return; {49222#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:45,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {49222#(<= ~counter~0 3)} assume true; {49222#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:45,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {49052#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; {49222#(<= ~counter~0 3)} is VALID [2022-04-15 08:45:45,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {49052#true} call ULTIMATE.init(); {49052#true} is VALID [2022-04-15 08:45:45,543 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-15 08:45:45,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:45:45,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243624096] [2022-04-15 08:45:45,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:45:45,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9472183] [2022-04-15 08:45:45,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9472183] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:45:45,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:45:45,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-15 08:45:45,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:45:45,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1429166331] [2022-04-15 08:45:45,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1429166331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:45:45,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:45:45,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 08:45:45,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018579518] [2022-04-15 08:45:45,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:45:45,545 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-15 08:45:45,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:45:45,545 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-15 08:45:45,604 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-15 08:45:45,604 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 08:45:45,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:45:45,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 08:45:45,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:45:45,605 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-15 08:45:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:47,092 INFO L93 Difference]: Finished difference Result 731 states and 966 transitions. [2022-04-15 08:45:47,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 08:45:47,092 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-15 08:45:47,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:45:47,092 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-15 08:45:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 175 transitions. [2022-04-15 08:45:47,094 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-15 08:45:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 175 transitions. [2022-04-15 08:45:47,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 175 transitions. [2022-04-15 08:45:47,252 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-15 08:45:47,267 INFO L225 Difference]: With dead ends: 731 [2022-04-15 08:45:47,267 INFO L226 Difference]: Without dead ends: 561 [2022-04-15 08:45:47,268 INFO L912 BasicCegarLoop]: 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-15 08:45:47,268 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 97 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 08:45:47,268 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 228 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 08:45:47,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-04-15 08:45:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 553. [2022-04-15 08:45:48,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:45:48,282 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-15 08:45:48,282 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-15 08:45:48,282 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-15 08:45:48,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:48,293 INFO L93 Difference]: Finished difference Result 561 states and 699 transitions. [2022-04-15 08:45:48,293 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 699 transitions. [2022-04-15 08:45:48,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:45:48,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:45:48,295 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-15 08:45:48,295 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-15 08:45:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:45:48,306 INFO L93 Difference]: Finished difference Result 561 states and 699 transitions. [2022-04-15 08:45:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 699 transitions. [2022-04-15 08:45:48,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:45:48,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:45:48,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:45:48,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:45:48,307 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-15 08:45:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 692 transitions. [2022-04-15 08:45:48,322 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 692 transitions. Word has length 116 [2022-04-15 08:45:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:45:48,322 INFO L478 AbstractCegarLoop]: Abstraction has 553 states and 692 transitions. [2022-04-15 08:45:48,322 INFO L479 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-15 08:45:48,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 553 states and 692 transitions. [2022-04-15 08:45:49,382 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-15 08:45:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 692 transitions. [2022-04-15 08:45:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 08:45:49,383 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:45:49,383 INFO L499 BasicCegarLoop]: 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-15 08:45:49,399 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-15 08:45:49,583 WARN L460 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-15 08:45:49,583 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:45:49,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:45:49,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1978671899, now seen corresponding path program 3 times [2022-04-15 08:45:49,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:45:49,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1108874555] [2022-04-15 08:45:49,592 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:45:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1978671899, now seen corresponding path program 4 times [2022-04-15 08:45:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:45:49,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743681723] [2022-04-15 08:45:49,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:45:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:45:49,601 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:45:49,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [596199236] [2022-04-15 08:45:49,602 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 08:45:49,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:45:49,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:45:49,602 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-15 08:45:49,606 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-15 08:45:49,665 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 08:45:49,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:45:49,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 08:45:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:45:49,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:45:49,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {53461#true} call ULTIMATE.init(); {53461#true} is VALID [2022-04-15 08:45:49,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {53461#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; {53461#true} is VALID [2022-04-15 08:45:49,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53461#true} {53461#true} #98#return; {53461#true} is VALID [2022-04-15 08:45:49,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {53461#true} call #t~ret8 := main(); {53461#true} is VALID [2022-04-15 08:45:49,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {53461#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; {53461#true} is VALID [2022-04-15 08:45:49,913 INFO L272 TraceCheckUtils]: 6: Hoare triple {53461#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:45:49,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:45:49,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:45:49,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,914 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {53461#true} {53461#true} #78#return; {53461#true} is VALID [2022-04-15 08:45:49,914 INFO L272 TraceCheckUtils]: 11: Hoare triple {53461#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:45:49,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:45:49,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:45:49,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,914 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {53461#true} {53461#true} #80#return; {53461#true} is VALID [2022-04-15 08:45:49,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {53461#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; {53461#true} is VALID [2022-04-15 08:45:49,914 INFO L272 TraceCheckUtils]: 17: Hoare triple {53461#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:45:49,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:45:49,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:45:49,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,914 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {53461#true} {53461#true} #82#return; {53461#true} is VALID [2022-04-15 08:45:49,914 INFO L272 TraceCheckUtils]: 22: Hoare triple {53461#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:45:49,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:45:49,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:45:49,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,915 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {53461#true} {53461#true} #84#return; {53461#true} is VALID [2022-04-15 08:45:49,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {53461#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53461#true} is VALID [2022-04-15 08:45:49,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {53461#true} assume !!(#t~post6 < 10);havoc #t~post6; {53461#true} is VALID [2022-04-15 08:45:49,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {53461#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {53461#true} is VALID [2022-04-15 08:45:49,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {53461#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53461#true} is VALID [2022-04-15 08:45:49,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {53461#true} assume !!(#t~post7 < 10);havoc #t~post7; {53461#true} is VALID [2022-04-15 08:45:49,915 INFO L272 TraceCheckUtils]: 32: Hoare triple {53461#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:45:49,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:45:49,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:45:49,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,915 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {53461#true} {53461#true} #86#return; {53461#true} is VALID [2022-04-15 08:45:49,915 INFO L272 TraceCheckUtils]: 37: Hoare triple {53461#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:45:49,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:45:49,916 INFO L290 TraceCheckUtils]: 39: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:45:49,916 INFO L290 TraceCheckUtils]: 40: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,916 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {53461#true} {53461#true} #88#return; {53461#true} is VALID [2022-04-15 08:45:49,916 INFO L272 TraceCheckUtils]: 42: Hoare triple {53461#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:45:49,916 INFO L290 TraceCheckUtils]: 43: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:45:49,916 INFO L290 TraceCheckUtils]: 44: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:45:49,916 INFO L290 TraceCheckUtils]: 45: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,916 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {53461#true} {53461#true} #90#return; {53461#true} is VALID [2022-04-15 08:45:49,916 INFO L272 TraceCheckUtils]: 47: Hoare triple {53461#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)); {53461#true} is VALID [2022-04-15 08:45:49,916 INFO L290 TraceCheckUtils]: 48: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:45:49,916 INFO L290 TraceCheckUtils]: 49: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:45:49,916 INFO L290 TraceCheckUtils]: 50: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,916 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {53461#true} {53461#true} #92#return; {53461#true} is VALID [2022-04-15 08:45:49,916 INFO L290 TraceCheckUtils]: 52: Hoare triple {53461#true} assume !(~c~0 >= ~b~0); {53461#true} is VALID [2022-04-15 08:45:49,916 INFO L290 TraceCheckUtils]: 53: Hoare triple {53461#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; {53461#true} is VALID [2022-04-15 08:45:49,917 INFO L290 TraceCheckUtils]: 54: Hoare triple {53461#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53461#true} is VALID [2022-04-15 08:45:49,917 INFO L290 TraceCheckUtils]: 55: Hoare triple {53461#true} assume !!(#t~post6 < 10);havoc #t~post6; {53461#true} is VALID [2022-04-15 08:45:49,917 INFO L290 TraceCheckUtils]: 56: Hoare triple {53461#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {53461#true} is VALID [2022-04-15 08:45:49,917 INFO L290 TraceCheckUtils]: 57: Hoare triple {53461#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53461#true} is VALID [2022-04-15 08:45:49,917 INFO L290 TraceCheckUtils]: 58: Hoare triple {53461#true} assume !!(#t~post7 < 10);havoc #t~post7; {53461#true} is VALID [2022-04-15 08:45:49,917 INFO L272 TraceCheckUtils]: 59: Hoare triple {53461#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:45:49,917 INFO L290 TraceCheckUtils]: 60: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:45:49,917 INFO L290 TraceCheckUtils]: 61: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:45:49,917 INFO L290 TraceCheckUtils]: 62: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,917 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {53461#true} {53461#true} #86#return; {53461#true} is VALID [2022-04-15 08:45:49,917 INFO L272 TraceCheckUtils]: 64: Hoare triple {53461#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:45:49,917 INFO L290 TraceCheckUtils]: 65: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:45:49,917 INFO L290 TraceCheckUtils]: 66: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:45:49,917 INFO L290 TraceCheckUtils]: 67: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,917 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {53461#true} {53461#true} #88#return; {53461#true} is VALID [2022-04-15 08:45:49,917 INFO L272 TraceCheckUtils]: 69: Hoare triple {53461#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:45:49,918 INFO L290 TraceCheckUtils]: 70: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:45:49,918 INFO L290 TraceCheckUtils]: 71: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:45:49,918 INFO L290 TraceCheckUtils]: 72: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,918 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {53461#true} {53461#true} #90#return; {53461#true} is VALID [2022-04-15 08:45:49,918 INFO L272 TraceCheckUtils]: 74: Hoare triple {53461#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)); {53461#true} is VALID [2022-04-15 08:45:49,918 INFO L290 TraceCheckUtils]: 75: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:45:49,918 INFO L290 TraceCheckUtils]: 76: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:45:49,918 INFO L290 TraceCheckUtils]: 77: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,918 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {53461#true} {53461#true} #92#return; {53461#true} is VALID [2022-04-15 08:45:49,918 INFO L290 TraceCheckUtils]: 79: Hoare triple {53461#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {53461#true} is VALID [2022-04-15 08:45:49,918 INFO L290 TraceCheckUtils]: 80: Hoare triple {53461#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53461#true} is VALID [2022-04-15 08:45:49,918 INFO L290 TraceCheckUtils]: 81: Hoare triple {53461#true} assume !!(#t~post7 < 10);havoc #t~post7; {53461#true} is VALID [2022-04-15 08:45:49,918 INFO L272 TraceCheckUtils]: 82: Hoare triple {53461#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:45:49,918 INFO L290 TraceCheckUtils]: 83: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:45:49,918 INFO L290 TraceCheckUtils]: 84: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:45:49,919 INFO L290 TraceCheckUtils]: 85: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,919 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {53461#true} {53461#true} #86#return; {53461#true} is VALID [2022-04-15 08:45:49,919 INFO L272 TraceCheckUtils]: 87: Hoare triple {53461#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:45:49,919 INFO L290 TraceCheckUtils]: 88: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:45:49,919 INFO L290 TraceCheckUtils]: 89: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:45:49,919 INFO L290 TraceCheckUtils]: 90: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,919 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {53461#true} {53461#true} #88#return; {53461#true} is VALID [2022-04-15 08:45:49,919 INFO L272 TraceCheckUtils]: 92: Hoare triple {53461#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:45:49,924 INFO L290 TraceCheckUtils]: 93: Hoare triple {53461#true} ~cond := #in~cond; {53745#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:45:49,924 INFO L290 TraceCheckUtils]: 94: Hoare triple {53745#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {53749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:45:49,924 INFO L290 TraceCheckUtils]: 95: Hoare triple {53749#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {53749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:45:49,925 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {53749#(not (= |__VERIFIER_assert_#in~cond| 0))} {53461#true} #90#return; {53756#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 08:45:49,925 INFO L272 TraceCheckUtils]: 97: Hoare triple {53756#(= 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)); {53461#true} is VALID [2022-04-15 08:45:49,925 INFO L290 TraceCheckUtils]: 98: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:45:49,925 INFO L290 TraceCheckUtils]: 99: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:45:49,925 INFO L290 TraceCheckUtils]: 100: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,926 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {53461#true} {53756#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {53756#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 08:45:49,926 INFO L290 TraceCheckUtils]: 102: Hoare triple {53756#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {53756#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 08:45:49,926 INFO L290 TraceCheckUtils]: 103: Hoare triple {53756#(= 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; {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:45:49,927 INFO L290 TraceCheckUtils]: 104: Hoare triple {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:45:49,927 INFO L290 TraceCheckUtils]: 105: Hoare triple {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:45:49,927 INFO L290 TraceCheckUtils]: 106: Hoare triple {53778#(= 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; {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:45:49,928 INFO L290 TraceCheckUtils]: 107: Hoare triple {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:45:49,928 INFO L290 TraceCheckUtils]: 108: Hoare triple {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:45:49,928 INFO L272 TraceCheckUtils]: 109: Hoare triple {53778#(= 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)); {53461#true} is VALID [2022-04-15 08:45:49,928 INFO L290 TraceCheckUtils]: 110: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:45:49,928 INFO L290 TraceCheckUtils]: 111: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:45:49,928 INFO L290 TraceCheckUtils]: 112: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:45:49,929 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {53461#true} {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:45:49,929 INFO L272 TraceCheckUtils]: 114: Hoare triple {53778#(= 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)); {53812#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:45:49,930 INFO L290 TraceCheckUtils]: 115: Hoare triple {53812#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53816#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:45:49,930 INFO L290 TraceCheckUtils]: 116: Hoare triple {53816#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53462#false} is VALID [2022-04-15 08:45:49,930 INFO L290 TraceCheckUtils]: 117: Hoare triple {53462#false} assume !false; {53462#false} is VALID [2022-04-15 08:45:49,930 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-15 08:45:49,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:46:02,484 INFO L290 TraceCheckUtils]: 117: Hoare triple {53462#false} assume !false; {53462#false} is VALID [2022-04-15 08:46:02,484 INFO L290 TraceCheckUtils]: 116: Hoare triple {53816#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53462#false} is VALID [2022-04-15 08:46:02,484 INFO L290 TraceCheckUtils]: 115: Hoare triple {53812#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53816#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:46:02,485 INFO L272 TraceCheckUtils]: 114: Hoare triple {53778#(= 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)); {53812#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:46:02,486 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {53461#true} {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:46:02,486 INFO L290 TraceCheckUtils]: 112: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,486 INFO L290 TraceCheckUtils]: 111: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:46:02,486 INFO L290 TraceCheckUtils]: 110: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:46:02,486 INFO L272 TraceCheckUtils]: 109: Hoare triple {53778#(= 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)); {53461#true} is VALID [2022-04-15 08:46:02,487 INFO L290 TraceCheckUtils]: 108: Hoare triple {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:46:02,487 INFO L290 TraceCheckUtils]: 107: Hoare triple {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:46:02,488 INFO L290 TraceCheckUtils]: 106: Hoare triple {53778#(= 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; {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:46:02,488 INFO L290 TraceCheckUtils]: 105: Hoare triple {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:46:02,489 INFO L290 TraceCheckUtils]: 104: Hoare triple {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:46:02,489 INFO L290 TraceCheckUtils]: 103: Hoare triple {53756#(= 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; {53778#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 08:46:02,489 INFO L290 TraceCheckUtils]: 102: Hoare triple {53756#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {53756#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 08:46:02,490 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {53461#true} {53756#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {53756#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 08:46:02,490 INFO L290 TraceCheckUtils]: 100: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,490 INFO L290 TraceCheckUtils]: 99: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:46:02,490 INFO L290 TraceCheckUtils]: 98: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:46:02,490 INFO L272 TraceCheckUtils]: 97: Hoare triple {53756#(= 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)); {53461#true} is VALID [2022-04-15 08:46:02,491 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {53749#(not (= |__VERIFIER_assert_#in~cond| 0))} {53461#true} #90#return; {53756#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 08:46:02,491 INFO L290 TraceCheckUtils]: 95: Hoare triple {53749#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {53749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:46:02,492 INFO L290 TraceCheckUtils]: 94: Hoare triple {53895#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {53749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:46:02,492 INFO L290 TraceCheckUtils]: 93: Hoare triple {53461#true} ~cond := #in~cond; {53895#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 08:46:02,492 INFO L272 TraceCheckUtils]: 92: Hoare triple {53461#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:46:02,492 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {53461#true} {53461#true} #88#return; {53461#true} is VALID [2022-04-15 08:46:02,492 INFO L290 TraceCheckUtils]: 90: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,492 INFO L290 TraceCheckUtils]: 89: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:46:02,493 INFO L290 TraceCheckUtils]: 88: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:46:02,493 INFO L272 TraceCheckUtils]: 87: Hoare triple {53461#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:46:02,493 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {53461#true} {53461#true} #86#return; {53461#true} is VALID [2022-04-15 08:46:02,493 INFO L290 TraceCheckUtils]: 85: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,493 INFO L290 TraceCheckUtils]: 84: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:46:02,493 INFO L290 TraceCheckUtils]: 83: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:46:02,493 INFO L272 TraceCheckUtils]: 82: Hoare triple {53461#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:46:02,493 INFO L290 TraceCheckUtils]: 81: Hoare triple {53461#true} assume !!(#t~post7 < 10);havoc #t~post7; {53461#true} is VALID [2022-04-15 08:46:02,493 INFO L290 TraceCheckUtils]: 80: Hoare triple {53461#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53461#true} is VALID [2022-04-15 08:46:02,493 INFO L290 TraceCheckUtils]: 79: Hoare triple {53461#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {53461#true} is VALID [2022-04-15 08:46:02,493 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {53461#true} {53461#true} #92#return; {53461#true} is VALID [2022-04-15 08:46:02,493 INFO L290 TraceCheckUtils]: 77: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,493 INFO L290 TraceCheckUtils]: 76: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:46:02,493 INFO L290 TraceCheckUtils]: 75: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:46:02,493 INFO L272 TraceCheckUtils]: 74: Hoare triple {53461#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)); {53461#true} is VALID [2022-04-15 08:46:02,494 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {53461#true} {53461#true} #90#return; {53461#true} is VALID [2022-04-15 08:46:02,494 INFO L290 TraceCheckUtils]: 72: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,494 INFO L290 TraceCheckUtils]: 71: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:46:02,494 INFO L290 TraceCheckUtils]: 70: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:46:02,494 INFO L272 TraceCheckUtils]: 69: Hoare triple {53461#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:46:02,494 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {53461#true} {53461#true} #88#return; {53461#true} is VALID [2022-04-15 08:46:02,494 INFO L290 TraceCheckUtils]: 67: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,494 INFO L290 TraceCheckUtils]: 66: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:46:02,494 INFO L290 TraceCheckUtils]: 65: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:46:02,494 INFO L272 TraceCheckUtils]: 64: Hoare triple {53461#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:46:02,494 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {53461#true} {53461#true} #86#return; {53461#true} is VALID [2022-04-15 08:46:02,494 INFO L290 TraceCheckUtils]: 62: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,494 INFO L290 TraceCheckUtils]: 61: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:46:02,494 INFO L290 TraceCheckUtils]: 60: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:46:02,494 INFO L272 TraceCheckUtils]: 59: Hoare triple {53461#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:46:02,495 INFO L290 TraceCheckUtils]: 58: Hoare triple {53461#true} assume !!(#t~post7 < 10);havoc #t~post7; {53461#true} is VALID [2022-04-15 08:46:02,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {53461#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53461#true} is VALID [2022-04-15 08:46:02,495 INFO L290 TraceCheckUtils]: 56: Hoare triple {53461#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {53461#true} is VALID [2022-04-15 08:46:02,495 INFO L290 TraceCheckUtils]: 55: Hoare triple {53461#true} assume !!(#t~post6 < 10);havoc #t~post6; {53461#true} is VALID [2022-04-15 08:46:02,495 INFO L290 TraceCheckUtils]: 54: Hoare triple {53461#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53461#true} is VALID [2022-04-15 08:46:02,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {53461#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; {53461#true} is VALID [2022-04-15 08:46:02,495 INFO L290 TraceCheckUtils]: 52: Hoare triple {53461#true} assume !(~c~0 >= ~b~0); {53461#true} is VALID [2022-04-15 08:46:02,495 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {53461#true} {53461#true} #92#return; {53461#true} is VALID [2022-04-15 08:46:02,495 INFO L290 TraceCheckUtils]: 50: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,495 INFO L290 TraceCheckUtils]: 49: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:46:02,495 INFO L290 TraceCheckUtils]: 48: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:46:02,495 INFO L272 TraceCheckUtils]: 47: Hoare triple {53461#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)); {53461#true} is VALID [2022-04-15 08:46:02,495 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {53461#true} {53461#true} #90#return; {53461#true} is VALID [2022-04-15 08:46:02,495 INFO L290 TraceCheckUtils]: 45: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,496 INFO L290 TraceCheckUtils]: 44: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:46:02,496 INFO L290 TraceCheckUtils]: 43: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:46:02,496 INFO L272 TraceCheckUtils]: 42: Hoare triple {53461#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:46:02,496 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {53461#true} {53461#true} #88#return; {53461#true} is VALID [2022-04-15 08:46:02,496 INFO L290 TraceCheckUtils]: 40: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,496 INFO L290 TraceCheckUtils]: 39: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:46:02,496 INFO L290 TraceCheckUtils]: 38: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:46:02,496 INFO L272 TraceCheckUtils]: 37: Hoare triple {53461#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:46:02,496 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {53461#true} {53461#true} #86#return; {53461#true} is VALID [2022-04-15 08:46:02,496 INFO L290 TraceCheckUtils]: 35: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:46:02,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:46:02,496 INFO L272 TraceCheckUtils]: 32: Hoare triple {53461#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:46:02,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {53461#true} assume !!(#t~post7 < 10);havoc #t~post7; {53461#true} is VALID [2022-04-15 08:46:02,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {53461#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53461#true} is VALID [2022-04-15 08:46:02,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {53461#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {53461#true} is VALID [2022-04-15 08:46:02,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {53461#true} assume !!(#t~post6 < 10);havoc #t~post6; {53461#true} is VALID [2022-04-15 08:46:02,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {53461#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53461#true} is VALID [2022-04-15 08:46:02,497 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {53461#true} {53461#true} #84#return; {53461#true} is VALID [2022-04-15 08:46:02,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:46:02,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:46:02,497 INFO L272 TraceCheckUtils]: 22: Hoare triple {53461#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:46:02,497 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {53461#true} {53461#true} #82#return; {53461#true} is VALID [2022-04-15 08:46:02,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:46:02,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:46:02,497 INFO L272 TraceCheckUtils]: 17: Hoare triple {53461#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:46:02,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {53461#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; {53461#true} is VALID [2022-04-15 08:46:02,497 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {53461#true} {53461#true} #80#return; {53461#true} is VALID [2022-04-15 08:46:02,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:46:02,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:46:02,498 INFO L272 TraceCheckUtils]: 11: Hoare triple {53461#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:46:02,498 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {53461#true} {53461#true} #78#return; {53461#true} is VALID [2022-04-15 08:46:02,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {53461#true} assume !(0 == ~cond); {53461#true} is VALID [2022-04-15 08:46:02,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {53461#true} ~cond := #in~cond; {53461#true} is VALID [2022-04-15 08:46:02,498 INFO L272 TraceCheckUtils]: 6: Hoare triple {53461#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {53461#true} is VALID [2022-04-15 08:46:02,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {53461#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; {53461#true} is VALID [2022-04-15 08:46:02,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {53461#true} call #t~ret8 := main(); {53461#true} is VALID [2022-04-15 08:46:02,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53461#true} {53461#true} #98#return; {53461#true} is VALID [2022-04-15 08:46:02,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {53461#true} assume true; {53461#true} is VALID [2022-04-15 08:46:02,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {53461#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; {53461#true} is VALID [2022-04-15 08:46:02,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {53461#true} call ULTIMATE.init(); {53461#true} is VALID [2022-04-15 08:46:02,499 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-15 08:46:02,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:46:02,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743681723] [2022-04-15 08:46:02,499 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:46:02,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596199236] [2022-04-15 08:46:02,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596199236] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:46:02,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:46:02,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-15 08:46:02,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:46:02,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1108874555] [2022-04-15 08:46:02,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1108874555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:46:02,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:46:02,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 08:46:02,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071238570] [2022-04-15 08:46:02,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:46:02,500 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-15 08:46:02,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:46:02,501 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-15 08:46:02,545 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-15 08:46:02,546 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 08:46:02,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:46:02,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 08:46:02,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 08:46:02,546 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-15 08:46:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:46:04,134 INFO L93 Difference]: Finished difference Result 584 states and 734 transitions. [2022-04-15 08:46:04,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 08:46:04,134 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-15 08:46:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:46:04,134 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-15 08:46:04,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-04-15 08:46:04,135 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-15 08:46:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-04-15 08:46:04,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2022-04-15 08:46:04,204 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-15 08:46:04,220 INFO L225 Difference]: With dead ends: 584 [2022-04-15 08:46:04,220 INFO L226 Difference]: Without dead ends: 581 [2022-04-15 08:46:04,220 INFO L912 BasicCegarLoop]: 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-15 08:46:04,221 INFO L913 BasicCegarLoop]: 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-15 08:46:04,221 INFO L914 BasicCegarLoop]: 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-15 08:46:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-04-15 08:46:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 577. [2022-04-15 08:46:05,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:46:05,251 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-15 08:46:05,251 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-15 08:46:05,252 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-15 08:46:05,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:46:05,264 INFO L93 Difference]: Finished difference Result 581 states and 730 transitions. [2022-04-15 08:46:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 730 transitions. [2022-04-15 08:46:05,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:46:05,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:46:05,265 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-15 08:46:05,266 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-15 08:46:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:46:05,278 INFO L93 Difference]: Finished difference Result 581 states and 730 transitions. [2022-04-15 08:46:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 730 transitions. [2022-04-15 08:46:05,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:46:05,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:46:05,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:46:05,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:46:05,279 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-15 08:46:05,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 726 transitions. [2022-04-15 08:46:05,304 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 726 transitions. Word has length 118 [2022-04-15 08:46:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:46:05,305 INFO L478 AbstractCegarLoop]: Abstraction has 577 states and 726 transitions. [2022-04-15 08:46:05,305 INFO L479 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-15 08:46:05,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 577 states and 726 transitions. [2022-04-15 08:46:06,461 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-15 08:46:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 726 transitions. [2022-04-15 08:46:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-15 08:46:06,462 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:46:06,462 INFO L499 BasicCegarLoop]: 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-15 08:46:06,478 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-15 08:46:06,667 WARN L460 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-15 08:46:06,668 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:46:06,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:46:06,670 INFO L85 PathProgramCache]: Analyzing trace with hash 992936989, now seen corresponding path program 5 times [2022-04-15 08:46:06,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:46:06,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1241185498] [2022-04-15 08:46:06,670 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:46:06,670 INFO L85 PathProgramCache]: Analyzing trace with hash 992936989, now seen corresponding path program 6 times [2022-04-15 08:46:06,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:46:06,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546895100] [2022-04-15 08:46:06,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:46:06,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:46:06,683 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:46:06,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [928787376] [2022-04-15 08:46:06,684 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 08:46:06,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:46:06,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:46:06,685 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-15 08:46:06,685 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-15 08:46:07,179 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 08:46:07,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:46:07,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 08:46:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:46:07,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:46:31,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {57668#true} call ULTIMATE.init(); {57668#true} is VALID [2022-04-15 08:46:31,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {57668#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; {57668#true} is VALID [2022-04-15 08:46:31,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57668#true} {57668#true} #98#return; {57668#true} is VALID [2022-04-15 08:46:31,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {57668#true} call #t~ret8 := main(); {57668#true} is VALID [2022-04-15 08:46:31,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {57668#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; {57668#true} is VALID [2022-04-15 08:46:31,243 INFO L272 TraceCheckUtils]: 6: Hoare triple {57668#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {57668#true} is VALID [2022-04-15 08:46:31,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {57668#true} ~cond := #in~cond; {57694#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 08:46:31,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {57694#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {57698#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:46:31,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {57698#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {57698#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:46:31,244 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {57698#(not (= |assume_abort_if_not_#in~cond| 0))} {57668#true} #78#return; {57705#(<= 1 main_~x~0)} is VALID [2022-04-15 08:46:31,245 INFO L272 TraceCheckUtils]: 11: Hoare triple {57705#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {57668#true} is VALID [2022-04-15 08:46:31,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {57668#true} ~cond := #in~cond; {57668#true} is VALID [2022-04-15 08:46:31,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {57668#true} assume !(0 == ~cond); {57668#true} is VALID [2022-04-15 08:46:31,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,245 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {57668#true} {57705#(<= 1 main_~x~0)} #80#return; {57705#(<= 1 main_~x~0)} is VALID [2022-04-15 08:46:31,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {57705#(<= 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; {57724#(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-15 08:46:31,246 INFO L272 TraceCheckUtils]: 17: Hoare triple {57724#(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)); {57668#true} is VALID [2022-04-15 08:46:31,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {57668#true} ~cond := #in~cond; {57668#true} is VALID [2022-04-15 08:46:31,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {57668#true} assume !(0 == ~cond); {57668#true} is VALID [2022-04-15 08:46:31,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,247 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {57668#true} {57724#(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; {57724#(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-15 08:46:31,247 INFO L272 TraceCheckUtils]: 22: Hoare triple {57724#(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)); {57668#true} is VALID [2022-04-15 08:46:31,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {57668#true} ~cond := #in~cond; {57694#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 08:46:31,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {57694#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {57698#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:46:31,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {57698#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {57698#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 08:46:31,248 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {57698#(not (= |assume_abort_if_not_#in~cond| 0))} {57724#(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; {57755#(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-15 08:46:31,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {57755#(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; {57755#(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-15 08:46:31,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {57755#(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; {57755#(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-15 08:46:31,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {57755#(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; {57755#(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-15 08:46:31,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {57755#(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; {57755#(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-15 08:46:31,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {57755#(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; {57755#(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-15 08:46:31,250 INFO L272 TraceCheckUtils]: 32: Hoare triple {57755#(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)); {57668#true} is VALID [2022-04-15 08:46:31,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {57668#true} ~cond := #in~cond; {57668#true} is VALID [2022-04-15 08:46:31,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {57668#true} assume !(0 == ~cond); {57668#true} is VALID [2022-04-15 08:46:31,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,251 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {57668#true} {57755#(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; {57755#(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-15 08:46:31,251 INFO L272 TraceCheckUtils]: 37: Hoare triple {57755#(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)); {57668#true} is VALID [2022-04-15 08:46:31,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {57668#true} ~cond := #in~cond; {57668#true} is VALID [2022-04-15 08:46:31,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {57668#true} assume !(0 == ~cond); {57668#true} is VALID [2022-04-15 08:46:31,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,252 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {57668#true} {57755#(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; {57755#(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-15 08:46:31,252 INFO L272 TraceCheckUtils]: 42: Hoare triple {57755#(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)); {57668#true} is VALID [2022-04-15 08:46:31,252 INFO L290 TraceCheckUtils]: 43: Hoare triple {57668#true} ~cond := #in~cond; {57668#true} is VALID [2022-04-15 08:46:31,252 INFO L290 TraceCheckUtils]: 44: Hoare triple {57668#true} assume !(0 == ~cond); {57668#true} is VALID [2022-04-15 08:46:31,252 INFO L290 TraceCheckUtils]: 45: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,253 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {57668#true} {57755#(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; {57755#(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-15 08:46:31,253 INFO L272 TraceCheckUtils]: 47: Hoare triple {57755#(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)); {57668#true} is VALID [2022-04-15 08:46:31,253 INFO L290 TraceCheckUtils]: 48: Hoare triple {57668#true} ~cond := #in~cond; {57668#true} is VALID [2022-04-15 08:46:31,253 INFO L290 TraceCheckUtils]: 49: Hoare triple {57668#true} assume !(0 == ~cond); {57668#true} is VALID [2022-04-15 08:46:31,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,254 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {57668#true} {57755#(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; {57755#(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-15 08:46:31,254 INFO L290 TraceCheckUtils]: 52: Hoare triple {57755#(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; {57755#(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-15 08:46:31,255 INFO L290 TraceCheckUtils]: 53: Hoare triple {57755#(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; {57755#(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-15 08:46:31,255 INFO L290 TraceCheckUtils]: 54: Hoare triple {57755#(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; {57755#(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-15 08:46:31,255 INFO L272 TraceCheckUtils]: 55: Hoare triple {57755#(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)); {57668#true} is VALID [2022-04-15 08:46:31,255 INFO L290 TraceCheckUtils]: 56: Hoare triple {57668#true} ~cond := #in~cond; {57668#true} is VALID [2022-04-15 08:46:31,255 INFO L290 TraceCheckUtils]: 57: Hoare triple {57668#true} assume !(0 == ~cond); {57668#true} is VALID [2022-04-15 08:46:31,255 INFO L290 TraceCheckUtils]: 58: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,256 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {57668#true} {57755#(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; {57755#(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-15 08:46:31,256 INFO L272 TraceCheckUtils]: 60: Hoare triple {57755#(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)); {57668#true} is VALID [2022-04-15 08:46:31,256 INFO L290 TraceCheckUtils]: 61: Hoare triple {57668#true} ~cond := #in~cond; {57668#true} is VALID [2022-04-15 08:46:31,256 INFO L290 TraceCheckUtils]: 62: Hoare triple {57668#true} assume !(0 == ~cond); {57668#true} is VALID [2022-04-15 08:46:31,256 INFO L290 TraceCheckUtils]: 63: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,257 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {57668#true} {57755#(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; {57755#(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-15 08:46:31,257 INFO L272 TraceCheckUtils]: 65: Hoare triple {57755#(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)); {57668#true} is VALID [2022-04-15 08:46:31,257 INFO L290 TraceCheckUtils]: 66: Hoare triple {57668#true} ~cond := #in~cond; {57668#true} is VALID [2022-04-15 08:46:31,257 INFO L290 TraceCheckUtils]: 67: Hoare triple {57668#true} assume !(0 == ~cond); {57668#true} is VALID [2022-04-15 08:46:31,257 INFO L290 TraceCheckUtils]: 68: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,258 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {57668#true} {57755#(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; {57755#(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-15 08:46:31,258 INFO L272 TraceCheckUtils]: 70: Hoare triple {57755#(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)); {57668#true} is VALID [2022-04-15 08:46:31,258 INFO L290 TraceCheckUtils]: 71: Hoare triple {57668#true} ~cond := #in~cond; {57668#true} is VALID [2022-04-15 08:46:31,258 INFO L290 TraceCheckUtils]: 72: Hoare triple {57668#true} assume !(0 == ~cond); {57668#true} is VALID [2022-04-15 08:46:31,258 INFO L290 TraceCheckUtils]: 73: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,259 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {57668#true} {57755#(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; {57755#(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-15 08:46:31,260 INFO L290 TraceCheckUtils]: 75: Hoare triple {57755#(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; {57903#(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-15 08:46:31,261 INFO L290 TraceCheckUtils]: 76: Hoare triple {57903#(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; {57903#(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-15 08:46:31,261 INFO L290 TraceCheckUtils]: 77: Hoare triple {57903#(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; {57903#(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-15 08:46:31,261 INFO L272 TraceCheckUtils]: 78: Hoare triple {57903#(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)); {57668#true} is VALID [2022-04-15 08:46:31,261 INFO L290 TraceCheckUtils]: 79: Hoare triple {57668#true} ~cond := #in~cond; {57668#true} is VALID [2022-04-15 08:46:31,261 INFO L290 TraceCheckUtils]: 80: Hoare triple {57668#true} assume !(0 == ~cond); {57668#true} is VALID [2022-04-15 08:46:31,261 INFO L290 TraceCheckUtils]: 81: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,262 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {57668#true} {57903#(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; {57903#(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-15 08:46:31,262 INFO L272 TraceCheckUtils]: 83: Hoare triple {57903#(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)); {57668#true} is VALID [2022-04-15 08:46:31,262 INFO L290 TraceCheckUtils]: 84: Hoare triple {57668#true} ~cond := #in~cond; {57668#true} is VALID [2022-04-15 08:46:31,262 INFO L290 TraceCheckUtils]: 85: Hoare triple {57668#true} assume !(0 == ~cond); {57668#true} is VALID [2022-04-15 08:46:31,262 INFO L290 TraceCheckUtils]: 86: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,263 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {57668#true} {57903#(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; {57903#(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-15 08:46:31,263 INFO L272 TraceCheckUtils]: 88: Hoare triple {57903#(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)); {57668#true} is VALID [2022-04-15 08:46:31,263 INFO L290 TraceCheckUtils]: 89: Hoare triple {57668#true} ~cond := #in~cond; {57668#true} is VALID [2022-04-15 08:46:31,263 INFO L290 TraceCheckUtils]: 90: Hoare triple {57668#true} assume !(0 == ~cond); {57668#true} is VALID [2022-04-15 08:46:31,263 INFO L290 TraceCheckUtils]: 91: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,264 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {57668#true} {57903#(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; {57903#(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-15 08:46:31,264 INFO L272 TraceCheckUtils]: 93: Hoare triple {57903#(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)); {57668#true} is VALID [2022-04-15 08:46:31,264 INFO L290 TraceCheckUtils]: 94: Hoare triple {57668#true} ~cond := #in~cond; {57668#true} is VALID [2022-04-15 08:46:31,264 INFO L290 TraceCheckUtils]: 95: Hoare triple {57668#true} assume !(0 == ~cond); {57668#true} is VALID [2022-04-15 08:46:31,264 INFO L290 TraceCheckUtils]: 96: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,265 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {57668#true} {57903#(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; {57903#(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-15 08:46:31,265 INFO L290 TraceCheckUtils]: 98: Hoare triple {57903#(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); {57973#(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-15 08:46:31,266 INFO L290 TraceCheckUtils]: 99: Hoare triple {57973#(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; {57977#(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-15 08:46:31,266 INFO L290 TraceCheckUtils]: 100: Hoare triple {57977#(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; {57977#(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-15 08:46:31,267 INFO L290 TraceCheckUtils]: 101: Hoare triple {57977#(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; {57977#(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-15 08:46:31,267 INFO L290 TraceCheckUtils]: 102: Hoare triple {57977#(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; {57987#(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-15 08:46:31,267 INFO L290 TraceCheckUtils]: 103: Hoare triple {57987#(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; {57987#(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-15 08:46:31,268 INFO L290 TraceCheckUtils]: 104: Hoare triple {57987#(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; {57987#(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-15 08:46:31,268 INFO L272 TraceCheckUtils]: 105: Hoare triple {57987#(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)); {57668#true} is VALID [2022-04-15 08:46:31,268 INFO L290 TraceCheckUtils]: 106: Hoare triple {57668#true} ~cond := #in~cond; {57668#true} is VALID [2022-04-15 08:46:31,268 INFO L290 TraceCheckUtils]: 107: Hoare triple {57668#true} assume !(0 == ~cond); {57668#true} is VALID [2022-04-15 08:46:31,268 INFO L290 TraceCheckUtils]: 108: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,269 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {57668#true} {57987#(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; {57987#(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-15 08:46:31,269 INFO L272 TraceCheckUtils]: 110: Hoare triple {57987#(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)); {57668#true} is VALID [2022-04-15 08:46:31,269 INFO L290 TraceCheckUtils]: 111: Hoare triple {57668#true} ~cond := #in~cond; {57668#true} is VALID [2022-04-15 08:46:31,269 INFO L290 TraceCheckUtils]: 112: Hoare triple {57668#true} assume !(0 == ~cond); {57668#true} is VALID [2022-04-15 08:46:31,269 INFO L290 TraceCheckUtils]: 113: Hoare triple {57668#true} assume true; {57668#true} is VALID [2022-04-15 08:46:31,270 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {57668#true} {57987#(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; {57987#(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-15 08:46:31,270 INFO L272 TraceCheckUtils]: 115: Hoare triple {57987#(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)); {57668#true} is VALID [2022-04-15 08:46:31,270 INFO L290 TraceCheckUtils]: 116: Hoare triple {57668#true} ~cond := #in~cond; {58030#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:46:31,270 INFO L290 TraceCheckUtils]: 117: Hoare triple {58030#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {58034#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:46:31,270 INFO L290 TraceCheckUtils]: 118: Hoare triple {58034#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {58034#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:46:31,271 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {58034#(not (= |__VERIFIER_assert_#in~cond| 0))} {57987#(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; {58041#(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-15 08:46:31,275 INFO L272 TraceCheckUtils]: 120: Hoare triple {58041#(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)); {58045#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:46:31,276 INFO L290 TraceCheckUtils]: 121: Hoare triple {58045#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {58049#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:46:31,276 INFO L290 TraceCheckUtils]: 122: Hoare triple {58049#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {57669#false} is VALID [2022-04-15 08:46:31,276 INFO L290 TraceCheckUtils]: 123: Hoare triple {57669#false} assume !false; {57669#false} is VALID [2022-04-15 08:46:31,277 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-15 08:46:31,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:47:14,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:47:14,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546895100] [2022-04-15 08:47:14,749 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:47:14,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928787376] [2022-04-15 08:47:14,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928787376] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 08:47:14,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 08:47:14,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-15 08:47:14,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:47:14,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1241185498] [2022-04-15 08:47:14,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1241185498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:47:14,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:47:14,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 08:47:14,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183369137] [2022-04-15 08:47:14,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:47:14,750 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-15 08:47:14,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:47:14,750 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-15 08:47:14,825 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-15 08:47:14,825 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 08:47:14,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:47:14,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 08:47:14,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=402, Unknown=1, NotChecked=0, Total=506 [2022-04-15 08:47:14,826 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-15 08:47:28,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:47:28,583 INFO L93 Difference]: Finished difference Result 604 states and 757 transitions. [2022-04-15 08:47:28,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 08:47:28,583 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-15 08:47:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:47:28,584 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-15 08:47:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 111 transitions. [2022-04-15 08:47:28,585 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-15 08:47:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 111 transitions. [2022-04-15 08:47:28,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 111 transitions. [2022-04-15 08:47:28,734 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-15 08:47:28,751 INFO L225 Difference]: With dead ends: 604 [2022-04-15 08:47:28,751 INFO L226 Difference]: Without dead ends: 600 [2022-04-15 08:47:28,751 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=133, Invalid=568, Unknown=1, NotChecked=0, Total=702 [2022-04-15 08:47:28,752 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 50 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-15 08:47:28,752 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 276 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-15 08:47:28,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-04-15 08:47:29,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 578. [2022-04-15 08:47:29,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:47:29,884 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-15 08:47:29,885 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-15 08:47:29,885 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-15 08:47:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:47:29,897 INFO L93 Difference]: Finished difference Result 600 states and 752 transitions. [2022-04-15 08:47:29,897 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 752 transitions. [2022-04-15 08:47:29,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:47:29,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:47:29,899 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-15 08:47:29,899 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-15 08:47:29,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:47:29,911 INFO L93 Difference]: Finished difference Result 600 states and 752 transitions. [2022-04-15 08:47:29,911 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 752 transitions. [2022-04-15 08:47:29,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:47:29,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:47:29,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:47:29,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:47:29,913 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-15 08:47:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 720 transitions. [2022-04-15 08:47:29,928 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 720 transitions. Word has length 124 [2022-04-15 08:47:29,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:47:29,928 INFO L478 AbstractCegarLoop]: Abstraction has 578 states and 720 transitions. [2022-04-15 08:47:29,928 INFO L479 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-15 08:47:29,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 578 states and 720 transitions. [2022-04-15 08:47:31,137 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-15 08:47:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 720 transitions. [2022-04-15 08:47:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-15 08:47:31,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:47:31,138 INFO L499 BasicCegarLoop]: 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-15 08:47:31,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-15 08:47:31,338 WARN L460 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-15 08:47:31,338 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:47:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:47:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1110867224, now seen corresponding path program 7 times [2022-04-15 08:47:31,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:47:31,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [922062522] [2022-04-15 08:47:31,339 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:47:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1110867224, now seen corresponding path program 8 times [2022-04-15 08:47:31,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:47:31,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753783578] [2022-04-15 08:47:31,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:47:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:47:31,351 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:47:31,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923348175] [2022-04-15 08:47:31,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:47:31,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:47:31,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:47:31,352 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-15 08:47:31,353 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-15 08:47:31,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:47:31,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:47:31,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-15 08:47:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:47:31,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:47:45,775 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 08:47:52,505 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 08:47:58,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {61784#true} call ULTIMATE.init(); {61784#true} is VALID [2022-04-15 08:47:58,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {61784#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; {61784#true} is VALID [2022-04-15 08:47:58,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:47:58,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61784#true} {61784#true} #98#return; {61784#true} is VALID [2022-04-15 08:47:58,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {61784#true} call #t~ret8 := main(); {61784#true} is VALID [2022-04-15 08:47:58,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {61784#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; {61784#true} is VALID [2022-04-15 08:47:58,772 INFO L272 TraceCheckUtils]: 6: Hoare triple {61784#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {61784#true} is VALID [2022-04-15 08:47:58,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:47:58,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:47:58,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:47:58,772 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {61784#true} {61784#true} #78#return; {61784#true} is VALID [2022-04-15 08:47:58,772 INFO L272 TraceCheckUtils]: 11: Hoare triple {61784#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {61784#true} is VALID [2022-04-15 08:47:58,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:47:58,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:47:58,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:47:58,773 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {61784#true} {61784#true} #80#return; {61784#true} is VALID [2022-04-15 08:47:58,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {61784#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; {61837#(and (= 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-15 08:47:58,773 INFO L272 TraceCheckUtils]: 17: Hoare triple {61837#(and (= 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)); {61784#true} is VALID [2022-04-15 08:47:58,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:47:58,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:47:58,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:47:58,774 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {61784#true} {61837#(and (= 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; {61837#(and (= 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-15 08:47:58,774 INFO L272 TraceCheckUtils]: 22: Hoare triple {61837#(and (= 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)); {61784#true} is VALID [2022-04-15 08:47:58,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:47:58,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:47:58,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:47:58,775 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {61784#true} {61837#(and (= 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; {61837#(and (= 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-15 08:47:58,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {61837#(and (= 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; {61837#(and (= 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-15 08:47:58,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {61837#(and (= 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; {61837#(and (= 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-15 08:47:58,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {61837#(and (= 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; {61877#(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-15 08:47:58,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {61877#(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; {61877#(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-15 08:47:58,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {61877#(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; {61877#(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-15 08:47:58,777 INFO L272 TraceCheckUtils]: 32: Hoare triple {61877#(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)); {61784#true} is VALID [2022-04-15 08:47:58,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:47:58,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:47:58,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:47:58,777 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {61784#true} {61877#(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; {61877#(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-15 08:47:58,777 INFO L272 TraceCheckUtils]: 37: Hoare triple {61877#(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)); {61784#true} is VALID [2022-04-15 08:47:58,777 INFO L290 TraceCheckUtils]: 38: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:47:58,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:47:58,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:47:58,778 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {61784#true} {61877#(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; {61877#(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-15 08:47:58,778 INFO L272 TraceCheckUtils]: 42: Hoare triple {61877#(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)); {61784#true} is VALID [2022-04-15 08:47:58,779 INFO L290 TraceCheckUtils]: 43: Hoare triple {61784#true} ~cond := #in~cond; {61920#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:47:58,779 INFO L290 TraceCheckUtils]: 44: Hoare triple {61920#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:47:58,779 INFO L290 TraceCheckUtils]: 45: Hoare triple {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:47:58,780 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} {61877#(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; {61877#(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-15 08:47:58,780 INFO L272 TraceCheckUtils]: 47: Hoare triple {61877#(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)); {61784#true} is VALID [2022-04-15 08:47:58,780 INFO L290 TraceCheckUtils]: 48: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:47:58,780 INFO L290 TraceCheckUtils]: 49: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:47:58,780 INFO L290 TraceCheckUtils]: 50: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:47:58,781 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {61784#true} {61877#(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; {61877#(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-15 08:47:58,781 INFO L290 TraceCheckUtils]: 52: Hoare triple {61877#(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); {61877#(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-15 08:47:58,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {61877#(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; {61952#(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-15 08:47:58,782 INFO L290 TraceCheckUtils]: 54: Hoare triple {61952#(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; {61952#(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-15 08:47:58,782 INFO L290 TraceCheckUtils]: 55: Hoare triple {61952#(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; {61952#(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-15 08:47:58,782 INFO L290 TraceCheckUtils]: 56: Hoare triple {61952#(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; {61962#(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-15 08:47:58,783 INFO L290 TraceCheckUtils]: 57: Hoare triple {61962#(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; {61962#(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-15 08:47:58,783 INFO L290 TraceCheckUtils]: 58: Hoare triple {61962#(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; {61962#(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-15 08:47:58,783 INFO L272 TraceCheckUtils]: 59: Hoare triple {61962#(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)); {61784#true} is VALID [2022-04-15 08:47:58,783 INFO L290 TraceCheckUtils]: 60: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:47:58,783 INFO L290 TraceCheckUtils]: 61: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:47:58,783 INFO L290 TraceCheckUtils]: 62: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:47:58,784 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {61784#true} {61962#(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; {61962#(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-15 08:47:58,784 INFO L272 TraceCheckUtils]: 64: Hoare triple {61962#(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)); {61784#true} is VALID [2022-04-15 08:47:58,784 INFO L290 TraceCheckUtils]: 65: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:47:58,784 INFO L290 TraceCheckUtils]: 66: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:47:58,784 INFO L290 TraceCheckUtils]: 67: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:47:58,785 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {61784#true} {61962#(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; {61962#(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-15 08:47:58,785 INFO L272 TraceCheckUtils]: 69: Hoare triple {61962#(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)); {61784#true} is VALID [2022-04-15 08:47:58,785 INFO L290 TraceCheckUtils]: 70: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:47:58,785 INFO L290 TraceCheckUtils]: 71: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:47:58,785 INFO L290 TraceCheckUtils]: 72: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:47:58,786 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {61784#true} {61962#(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; {61962#(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-15 08:47:58,786 INFO L272 TraceCheckUtils]: 74: Hoare triple {61962#(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)); {61784#true} is VALID [2022-04-15 08:47:58,786 INFO L290 TraceCheckUtils]: 75: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:47:58,786 INFO L290 TraceCheckUtils]: 76: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:47:58,786 INFO L290 TraceCheckUtils]: 77: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:47:58,787 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {61784#true} {61962#(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; {61962#(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-15 08:47:58,788 INFO L290 TraceCheckUtils]: 79: Hoare triple {61962#(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; {62032#(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-15 08:47:58,788 INFO L290 TraceCheckUtils]: 80: Hoare triple {62032#(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; {62032#(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-15 08:47:58,789 INFO L290 TraceCheckUtils]: 81: Hoare triple {62032#(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; {62032#(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-15 08:47:58,789 INFO L272 TraceCheckUtils]: 82: Hoare triple {62032#(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)); {61784#true} is VALID [2022-04-15 08:47:58,789 INFO L290 TraceCheckUtils]: 83: Hoare triple {61784#true} ~cond := #in~cond; {61920#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:47:58,790 INFO L290 TraceCheckUtils]: 84: Hoare triple {61920#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:47:58,790 INFO L290 TraceCheckUtils]: 85: Hoare triple {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:47:58,790 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} {62032#(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; {62032#(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-15 08:47:58,791 INFO L272 TraceCheckUtils]: 87: Hoare triple {62032#(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)); {61784#true} is VALID [2022-04-15 08:47:58,791 INFO L290 TraceCheckUtils]: 88: Hoare triple {61784#true} ~cond := #in~cond; {61920#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:47:58,791 INFO L290 TraceCheckUtils]: 89: Hoare triple {61920#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:47:58,791 INFO L290 TraceCheckUtils]: 90: Hoare triple {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:47:58,792 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} {62032#(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; {62069#(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-15 08:47:58,792 INFO L272 TraceCheckUtils]: 92: Hoare triple {62069#(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)); {61784#true} is VALID [2022-04-15 08:47:58,793 INFO L290 TraceCheckUtils]: 93: Hoare triple {61784#true} ~cond := #in~cond; {61920#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:47:58,793 INFO L290 TraceCheckUtils]: 94: Hoare triple {61920#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:47:58,793 INFO L290 TraceCheckUtils]: 95: Hoare triple {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:47:58,795 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} {62069#(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; {62085#(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-15 08:47:58,795 INFO L272 TraceCheckUtils]: 97: Hoare triple {62085#(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)); {61784#true} is VALID [2022-04-15 08:47:58,795 INFO L290 TraceCheckUtils]: 98: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:47:58,795 INFO L290 TraceCheckUtils]: 99: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:47:58,795 INFO L290 TraceCheckUtils]: 100: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:47:58,796 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {61784#true} {62085#(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; {62085#(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-15 08:47:58,797 INFO L290 TraceCheckUtils]: 102: Hoare triple {62085#(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); {62085#(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-15 08:47:58,801 INFO L290 TraceCheckUtils]: 103: Hoare triple {62085#(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; {62107#(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-15 08:47:58,801 INFO L290 TraceCheckUtils]: 104: Hoare triple {62107#(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; {62107#(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-15 08:47:58,802 INFO L290 TraceCheckUtils]: 105: Hoare triple {62107#(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; {62107#(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-15 08:47:58,802 INFO L290 TraceCheckUtils]: 106: Hoare triple {62107#(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; {62107#(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-15 08:47:58,802 INFO L290 TraceCheckUtils]: 107: Hoare triple {62107#(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; {62107#(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-15 08:47:58,803 INFO L290 TraceCheckUtils]: 108: Hoare triple {62107#(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; {62107#(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-15 08:47:58,803 INFO L272 TraceCheckUtils]: 109: Hoare triple {62107#(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)); {61784#true} is VALID [2022-04-15 08:47:58,803 INFO L290 TraceCheckUtils]: 110: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:47:58,803 INFO L290 TraceCheckUtils]: 111: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:47:58,803 INFO L290 TraceCheckUtils]: 112: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:47:58,804 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {61784#true} {62107#(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; {62107#(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-15 08:47:58,804 INFO L272 TraceCheckUtils]: 114: Hoare triple {62107#(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)); {61784#true} is VALID [2022-04-15 08:47:58,804 INFO L290 TraceCheckUtils]: 115: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:47:58,804 INFO L290 TraceCheckUtils]: 116: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:47:58,804 INFO L290 TraceCheckUtils]: 117: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:47:58,804 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {61784#true} {62107#(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; {62107#(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-15 08:47:58,809 INFO L272 TraceCheckUtils]: 119: Hoare triple {62107#(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)); {62156#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:47:58,809 INFO L290 TraceCheckUtils]: 120: Hoare triple {62156#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {62160#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:47:58,810 INFO L290 TraceCheckUtils]: 121: Hoare triple {62160#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {61785#false} is VALID [2022-04-15 08:47:58,810 INFO L290 TraceCheckUtils]: 122: Hoare triple {61785#false} assume !false; {61785#false} is VALID [2022-04-15 08:47:58,810 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-15 08:47:58,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:48:59,577 INFO L290 TraceCheckUtils]: 122: Hoare triple {61785#false} assume !false; {61785#false} is VALID [2022-04-15 08:48:59,577 INFO L290 TraceCheckUtils]: 121: Hoare triple {62160#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {61785#false} is VALID [2022-04-15 08:48:59,577 INFO L290 TraceCheckUtils]: 120: Hoare triple {62156#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {62160#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:48:59,578 INFO L272 TraceCheckUtils]: 119: Hoare triple {62176#(= 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)); {62156#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:48:59,579 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {61784#true} {62176#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {62176#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 08:48:59,579 INFO L290 TraceCheckUtils]: 117: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:48:59,579 INFO L290 TraceCheckUtils]: 116: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:48:59,579 INFO L290 TraceCheckUtils]: 115: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:48:59,579 INFO L272 TraceCheckUtils]: 114: Hoare triple {62176#(= 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)); {61784#true} is VALID [2022-04-15 08:48:59,579 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {61784#true} {62176#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {62176#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 08:48:59,579 INFO L290 TraceCheckUtils]: 112: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:48:59,580 INFO L290 TraceCheckUtils]: 111: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:48:59,580 INFO L290 TraceCheckUtils]: 110: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:48:59,580 INFO L272 TraceCheckUtils]: 109: Hoare triple {62176#(= 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)); {61784#true} is VALID [2022-04-15 08:48:59,580 INFO L290 TraceCheckUtils]: 108: Hoare triple {62176#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {62176#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 08:48:59,580 INFO L290 TraceCheckUtils]: 107: Hoare triple {62176#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {62176#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 08:48:59,581 INFO L290 TraceCheckUtils]: 106: Hoare triple {62176#(= 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; {62176#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 08:48:59,581 INFO L290 TraceCheckUtils]: 105: Hoare triple {62176#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {62176#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 08:48:59,581 INFO L290 TraceCheckUtils]: 104: Hoare triple {62176#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {62176#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 08:49:01,583 WARN L290 TraceCheckUtils]: 103: Hoare triple {62225#(= (+ (* (+ (* (* 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; {62176#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-15 08:49:01,584 INFO L290 TraceCheckUtils]: 102: Hoare triple {62225#(= (+ (* (+ (* (* 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); {62225#(= (+ (* (+ (* (* 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-15 08:49:01,585 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {61784#true} {62225#(= (+ (* (+ (* (* 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; {62225#(= (+ (* (+ (* (* 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-15 08:49:01,585 INFO L290 TraceCheckUtils]: 100: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:49:01,585 INFO L290 TraceCheckUtils]: 99: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:49:01,585 INFO L290 TraceCheckUtils]: 98: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:49:01,585 INFO L272 TraceCheckUtils]: 97: Hoare triple {62225#(= (+ (* (+ (* (* 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)); {61784#true} is VALID [2022-04-15 08:49:01,586 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} {62247#(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; {62225#(= (+ (* (+ (* (* 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-15 08:49:01,586 INFO L290 TraceCheckUtils]: 95: Hoare triple {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:49:01,586 INFO L290 TraceCheckUtils]: 94: Hoare triple {62257#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:49:01,587 INFO L290 TraceCheckUtils]: 93: Hoare triple {61784#true} ~cond := #in~cond; {62257#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 08:49:01,587 INFO L272 TraceCheckUtils]: 92: Hoare triple {62247#(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)); {61784#true} is VALID [2022-04-15 08:49:01,587 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} {62264#(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; {62247#(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-15 08:49:01,588 INFO L290 TraceCheckUtils]: 90: Hoare triple {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:49:01,588 INFO L290 TraceCheckUtils]: 89: Hoare triple {62257#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:49:01,588 INFO L290 TraceCheckUtils]: 88: Hoare triple {61784#true} ~cond := #in~cond; {62257#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 08:49:01,588 INFO L272 TraceCheckUtils]: 87: Hoare triple {62264#(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)); {61784#true} is VALID [2022-04-15 08:49:01,657 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} {61784#true} #86#return; {62264#(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-15 08:49:01,658 INFO L290 TraceCheckUtils]: 85: Hoare triple {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:49:01,658 INFO L290 TraceCheckUtils]: 84: Hoare triple {62257#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {61924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:49:01,658 INFO L290 TraceCheckUtils]: 83: Hoare triple {61784#true} ~cond := #in~cond; {62257#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 08:49:01,658 INFO L272 TraceCheckUtils]: 82: Hoare triple {61784#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {61784#true} is VALID [2022-04-15 08:49:01,658 INFO L290 TraceCheckUtils]: 81: Hoare triple {61784#true} assume !!(#t~post7 < 10);havoc #t~post7; {61784#true} is VALID [2022-04-15 08:49:01,658 INFO L290 TraceCheckUtils]: 80: Hoare triple {61784#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61784#true} is VALID [2022-04-15 08:49:01,659 INFO L290 TraceCheckUtils]: 79: Hoare triple {61784#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {61784#true} is VALID [2022-04-15 08:49:01,659 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {61784#true} {61784#true} #92#return; {61784#true} is VALID [2022-04-15 08:49:01,659 INFO L290 TraceCheckUtils]: 77: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:49:01,659 INFO L290 TraceCheckUtils]: 76: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:49:01,659 INFO L290 TraceCheckUtils]: 75: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:49:01,659 INFO L272 TraceCheckUtils]: 74: Hoare triple {61784#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)); {61784#true} is VALID [2022-04-15 08:49:01,659 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {61784#true} {61784#true} #90#return; {61784#true} is VALID [2022-04-15 08:49:01,659 INFO L290 TraceCheckUtils]: 72: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:49:01,659 INFO L290 TraceCheckUtils]: 71: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:49:01,659 INFO L290 TraceCheckUtils]: 70: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:49:01,659 INFO L272 TraceCheckUtils]: 69: Hoare triple {61784#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {61784#true} is VALID [2022-04-15 08:49:01,659 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {61784#true} {61784#true} #88#return; {61784#true} is VALID [2022-04-15 08:49:01,659 INFO L290 TraceCheckUtils]: 67: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:49:01,659 INFO L290 TraceCheckUtils]: 66: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:49:01,659 INFO L290 TraceCheckUtils]: 65: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:49:01,660 INFO L272 TraceCheckUtils]: 64: Hoare triple {61784#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {61784#true} is VALID [2022-04-15 08:49:01,660 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {61784#true} {61784#true} #86#return; {61784#true} is VALID [2022-04-15 08:49:01,660 INFO L290 TraceCheckUtils]: 62: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:49:01,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:49:01,660 INFO L290 TraceCheckUtils]: 60: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:49:01,660 INFO L272 TraceCheckUtils]: 59: Hoare triple {61784#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {61784#true} is VALID [2022-04-15 08:49:01,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {61784#true} assume !!(#t~post7 < 10);havoc #t~post7; {61784#true} is VALID [2022-04-15 08:49:01,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {61784#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61784#true} is VALID [2022-04-15 08:49:01,660 INFO L290 TraceCheckUtils]: 56: Hoare triple {61784#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {61784#true} is VALID [2022-04-15 08:49:01,660 INFO L290 TraceCheckUtils]: 55: Hoare triple {61784#true} assume !!(#t~post6 < 10);havoc #t~post6; {61784#true} is VALID [2022-04-15 08:49:01,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {61784#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61784#true} is VALID [2022-04-15 08:49:01,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {61784#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; {61784#true} is VALID [2022-04-15 08:49:01,660 INFO L290 TraceCheckUtils]: 52: Hoare triple {61784#true} assume !(~c~0 >= ~b~0); {61784#true} is VALID [2022-04-15 08:49:01,660 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {61784#true} {61784#true} #92#return; {61784#true} is VALID [2022-04-15 08:49:01,660 INFO L290 TraceCheckUtils]: 50: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:49:01,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:49:01,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:49:01,661 INFO L272 TraceCheckUtils]: 47: Hoare triple {61784#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)); {61784#true} is VALID [2022-04-15 08:49:01,661 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {61784#true} {61784#true} #90#return; {61784#true} is VALID [2022-04-15 08:49:01,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:49:01,661 INFO L290 TraceCheckUtils]: 44: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:49:01,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:49:01,661 INFO L272 TraceCheckUtils]: 42: Hoare triple {61784#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {61784#true} is VALID [2022-04-15 08:49:01,661 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {61784#true} {61784#true} #88#return; {61784#true} is VALID [2022-04-15 08:49:01,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:49:01,661 INFO L290 TraceCheckUtils]: 39: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:49:01,661 INFO L290 TraceCheckUtils]: 38: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:49:01,661 INFO L272 TraceCheckUtils]: 37: Hoare triple {61784#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {61784#true} is VALID [2022-04-15 08:49:01,661 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {61784#true} {61784#true} #86#return; {61784#true} is VALID [2022-04-15 08:49:01,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:49:01,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:49:01,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:49:01,662 INFO L272 TraceCheckUtils]: 32: Hoare triple {61784#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {61784#true} is VALID [2022-04-15 08:49:01,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {61784#true} assume !!(#t~post7 < 10);havoc #t~post7; {61784#true} is VALID [2022-04-15 08:49:01,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {61784#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61784#true} is VALID [2022-04-15 08:49:01,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {61784#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {61784#true} is VALID [2022-04-15 08:49:01,662 INFO L290 TraceCheckUtils]: 28: Hoare triple {61784#true} assume !!(#t~post6 < 10);havoc #t~post6; {61784#true} is VALID [2022-04-15 08:49:01,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {61784#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61784#true} is VALID [2022-04-15 08:49:01,662 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {61784#true} {61784#true} #84#return; {61784#true} is VALID [2022-04-15 08:49:01,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:49:01,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:49:01,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:49:01,662 INFO L272 TraceCheckUtils]: 22: Hoare triple {61784#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {61784#true} is VALID [2022-04-15 08:49:01,662 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {61784#true} {61784#true} #82#return; {61784#true} is VALID [2022-04-15 08:49:01,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:49:01,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:49:01,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:49:01,663 INFO L272 TraceCheckUtils]: 17: Hoare triple {61784#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {61784#true} is VALID [2022-04-15 08:49:01,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {61784#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; {61784#true} is VALID [2022-04-15 08:49:01,663 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {61784#true} {61784#true} #80#return; {61784#true} is VALID [2022-04-15 08:49:01,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:49:01,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:49:01,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:49:01,663 INFO L272 TraceCheckUtils]: 11: Hoare triple {61784#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {61784#true} is VALID [2022-04-15 08:49:01,663 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {61784#true} {61784#true} #78#return; {61784#true} is VALID [2022-04-15 08:49:01,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:49:01,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {61784#true} assume !(0 == ~cond); {61784#true} is VALID [2022-04-15 08:49:01,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {61784#true} ~cond := #in~cond; {61784#true} is VALID [2022-04-15 08:49:01,663 INFO L272 TraceCheckUtils]: 6: Hoare triple {61784#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {61784#true} is VALID [2022-04-15 08:49:01,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {61784#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; {61784#true} is VALID [2022-04-15 08:49:01,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {61784#true} call #t~ret8 := main(); {61784#true} is VALID [2022-04-15 08:49:01,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61784#true} {61784#true} #98#return; {61784#true} is VALID [2022-04-15 08:49:01,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {61784#true} assume true; {61784#true} is VALID [2022-04-15 08:49:01,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {61784#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; {61784#true} is VALID [2022-04-15 08:49:01,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {61784#true} call ULTIMATE.init(); {61784#true} is VALID [2022-04-15 08:49:01,664 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-15 08:49:01,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:49:01,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753783578] [2022-04-15 08:49:01,664 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:49:01,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923348175] [2022-04-15 08:49:01,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923348175] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:49:01,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:49:01,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2022-04-15 08:49:01,665 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:49:01,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [922062522] [2022-04-15 08:49:01,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [922062522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:49:01,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:49:01,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 08:49:01,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986872702] [2022-04-15 08:49:01,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:49:01,665 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-15 08:49:01,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:49:01,666 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-15 08:49:01,754 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-15 08:49:01,755 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 08:49:01,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:49:01,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 08:49:01,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-15 08:49:01,755 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-15 08:49:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:49:05,789 INFO L93 Difference]: Finished difference Result 613 states and 769 transitions. [2022-04-15 08:49:05,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 08:49:05,790 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-15 08:49:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:49:05,790 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-15 08:49:05,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2022-04-15 08:49:05,791 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-15 08:49:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2022-04-15 08:49:05,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 138 transitions. [2022-04-15 08:49:05,952 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-15 08:49:05,968 INFO L225 Difference]: With dead ends: 613 [2022-04-15 08:49:05,968 INFO L226 Difference]: Without dead ends: 611 [2022-04-15 08:49:05,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-04-15 08:49:05,969 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:49:05,969 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 459 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 08:49:05,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-04-15 08:49:07,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 605. [2022-04-15 08:49:07,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:49:07,158 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-15 08:49:07,159 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-15 08:49:07,159 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-15 08:49:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:49:07,194 INFO L93 Difference]: Finished difference Result 611 states and 767 transitions. [2022-04-15 08:49:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 767 transitions. [2022-04-15 08:49:07,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:49:07,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:49:07,196 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-15 08:49:07,196 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-15 08:49:07,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:49:07,209 INFO L93 Difference]: Finished difference Result 611 states and 767 transitions. [2022-04-15 08:49:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 767 transitions. [2022-04-15 08:49:07,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:49:07,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:49:07,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:49:07,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:49:07,211 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-15 08:49:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 761 transitions. [2022-04-15 08:49:07,227 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 761 transitions. Word has length 123 [2022-04-15 08:49:07,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:49:07,228 INFO L478 AbstractCegarLoop]: Abstraction has 605 states and 761 transitions. [2022-04-15 08:49:07,228 INFO L479 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-15 08:49:07,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 605 states and 761 transitions. [2022-04-15 08:49:08,658 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-15 08:49:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 761 transitions. [2022-04-15 08:49:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-15 08:49:08,659 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:49:08,659 INFO L499 BasicCegarLoop]: 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-15 08:49:08,682 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-15 08:49:08,867 WARN L460 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-15 08:49:08,867 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:49:08,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:49:08,868 INFO L85 PathProgramCache]: Analyzing trace with hash -270396677, now seen corresponding path program 9 times [2022-04-15 08:49:08,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:49:08,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [970005370] [2022-04-15 08:49:08,868 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:49:08,868 INFO L85 PathProgramCache]: Analyzing trace with hash -270396677, now seen corresponding path program 10 times [2022-04-15 08:49:08,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:49:08,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455416784] [2022-04-15 08:49:08,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:49:08,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:49:08,879 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:49:08,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [837615160] [2022-04-15 08:49:08,879 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 08:49:08,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:49:08,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:49:08,880 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-15 08:49:08,881 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-15 08:49:08,950 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 08:49:08,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:49:08,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-15 08:49:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:49:08,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:49:10,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {66206#true} call ULTIMATE.init(); {66206#true} is VALID [2022-04-15 08:49:10,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {66206#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; {66206#true} is VALID [2022-04-15 08:49:10,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66206#true} {66206#true} #98#return; {66206#true} is VALID [2022-04-15 08:49:10,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {66206#true} call #t~ret8 := main(); {66206#true} is VALID [2022-04-15 08:49:10,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {66206#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; {66206#true} is VALID [2022-04-15 08:49:10,449 INFO L272 TraceCheckUtils]: 6: Hoare triple {66206#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {66206#true} is VALID [2022-04-15 08:49:10,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:49:10,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:49:10,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,449 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {66206#true} {66206#true} #78#return; {66206#true} is VALID [2022-04-15 08:49:10,450 INFO L272 TraceCheckUtils]: 11: Hoare triple {66206#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {66206#true} is VALID [2022-04-15 08:49:10,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:49:10,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:49:10,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,450 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {66206#true} {66206#true} #80#return; {66206#true} is VALID [2022-04-15 08:49:10,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {66206#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; {66259#(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-15 08:49:10,450 INFO L272 TraceCheckUtils]: 17: Hoare triple {66259#(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)); {66206#true} is VALID [2022-04-15 08:49:10,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:49:10,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:49:10,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,451 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {66206#true} {66259#(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; {66259#(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-15 08:49:10,451 INFO L272 TraceCheckUtils]: 22: Hoare triple {66259#(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)); {66206#true} is VALID [2022-04-15 08:49:10,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:49:10,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:49:10,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,452 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {66206#true} {66259#(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; {66259#(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-15 08:49:10,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {66259#(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; {66259#(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-15 08:49:10,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {66259#(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; {66259#(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-15 08:49:10,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {66259#(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; {66299#(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-15 08:49:10,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {66299#(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; {66299#(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-15 08:49:10,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {66299#(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; {66299#(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-15 08:49:10,454 INFO L272 TraceCheckUtils]: 32: Hoare triple {66299#(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)); {66206#true} is VALID [2022-04-15 08:49:10,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:49:10,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:49:10,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,455 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {66206#true} {66299#(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; {66299#(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-15 08:49:10,455 INFO L272 TraceCheckUtils]: 37: Hoare triple {66299#(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)); {66206#true} is VALID [2022-04-15 08:49:10,456 INFO L290 TraceCheckUtils]: 38: Hoare triple {66206#true} ~cond := #in~cond; {66327#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:49:10,456 INFO L290 TraceCheckUtils]: 39: Hoare triple {66327#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:49:10,456 INFO L290 TraceCheckUtils]: 40: Hoare triple {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:49:10,457 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} {66299#(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; {66338#(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-15 08:49:10,457 INFO L272 TraceCheckUtils]: 42: Hoare triple {66338#(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)); {66206#true} is VALID [2022-04-15 08:49:10,457 INFO L290 TraceCheckUtils]: 43: Hoare triple {66206#true} ~cond := #in~cond; {66327#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:49:10,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {66327#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:49:10,458 INFO L290 TraceCheckUtils]: 45: Hoare triple {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:49:10,459 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} {66338#(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; {66338#(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-15 08:49:10,459 INFO L272 TraceCheckUtils]: 47: Hoare triple {66338#(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)); {66206#true} is VALID [2022-04-15 08:49:10,459 INFO L290 TraceCheckUtils]: 48: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:49:10,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:49:10,459 INFO L290 TraceCheckUtils]: 50: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,460 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {66206#true} {66338#(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; {66338#(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-15 08:49:10,460 INFO L290 TraceCheckUtils]: 52: Hoare triple {66338#(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); {66338#(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-15 08:49:10,460 INFO L290 TraceCheckUtils]: 53: Hoare triple {66338#(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; {66375#(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-15 08:49:10,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {66375#(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; {66375#(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-15 08:49:10,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {66375#(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; {66375#(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-15 08:49:10,462 INFO L290 TraceCheckUtils]: 56: Hoare triple {66375#(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; {66385#(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-15 08:49:10,462 INFO L290 TraceCheckUtils]: 57: Hoare triple {66385#(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; {66385#(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-15 08:49:10,463 INFO L290 TraceCheckUtils]: 58: Hoare triple {66385#(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; {66385#(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-15 08:49:10,463 INFO L272 TraceCheckUtils]: 59: Hoare triple {66385#(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)); {66206#true} is VALID [2022-04-15 08:49:10,463 INFO L290 TraceCheckUtils]: 60: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:49:10,463 INFO L290 TraceCheckUtils]: 61: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:49:10,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,464 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {66206#true} {66385#(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; {66385#(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-15 08:49:10,464 INFO L272 TraceCheckUtils]: 64: Hoare triple {66385#(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)); {66206#true} is VALID [2022-04-15 08:49:10,464 INFO L290 TraceCheckUtils]: 65: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:49:10,464 INFO L290 TraceCheckUtils]: 66: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:49:10,464 INFO L290 TraceCheckUtils]: 67: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,465 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {66206#true} {66385#(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; {66385#(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-15 08:49:10,465 INFO L272 TraceCheckUtils]: 69: Hoare triple {66385#(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)); {66206#true} is VALID [2022-04-15 08:49:10,465 INFO L290 TraceCheckUtils]: 70: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:49:10,465 INFO L290 TraceCheckUtils]: 71: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:49:10,465 INFO L290 TraceCheckUtils]: 72: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,465 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {66206#true} {66385#(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; {66385#(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-15 08:49:10,466 INFO L272 TraceCheckUtils]: 74: Hoare triple {66385#(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)); {66206#true} is VALID [2022-04-15 08:49:10,466 INFO L290 TraceCheckUtils]: 75: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:49:10,466 INFO L290 TraceCheckUtils]: 76: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:49:10,466 INFO L290 TraceCheckUtils]: 77: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,466 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {66206#true} {66385#(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; {66385#(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-15 08:49:10,467 INFO L290 TraceCheckUtils]: 79: Hoare triple {66385#(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; {66455#(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-15 08:49:10,467 INFO L290 TraceCheckUtils]: 80: Hoare triple {66455#(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; {66455#(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-15 08:49:10,468 INFO L290 TraceCheckUtils]: 81: Hoare triple {66455#(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; {66455#(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-15 08:49:10,468 INFO L272 TraceCheckUtils]: 82: Hoare triple {66455#(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)); {66206#true} is VALID [2022-04-15 08:49:10,468 INFO L290 TraceCheckUtils]: 83: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:49:10,468 INFO L290 TraceCheckUtils]: 84: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:49:10,468 INFO L290 TraceCheckUtils]: 85: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,469 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {66206#true} {66455#(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; {66455#(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-15 08:49:10,469 INFO L272 TraceCheckUtils]: 87: Hoare triple {66455#(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)); {66206#true} is VALID [2022-04-15 08:49:10,469 INFO L290 TraceCheckUtils]: 88: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:49:10,469 INFO L290 TraceCheckUtils]: 89: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:49:10,469 INFO L290 TraceCheckUtils]: 90: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,470 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {66206#true} {66455#(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; {66455#(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-15 08:49:10,470 INFO L272 TraceCheckUtils]: 92: Hoare triple {66455#(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)); {66206#true} is VALID [2022-04-15 08:49:10,470 INFO L290 TraceCheckUtils]: 93: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:49:10,470 INFO L290 TraceCheckUtils]: 94: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:49:10,470 INFO L290 TraceCheckUtils]: 95: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,471 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {66206#true} {66455#(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; {66455#(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-15 08:49:10,471 INFO L272 TraceCheckUtils]: 97: Hoare triple {66455#(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)); {66206#true} is VALID [2022-04-15 08:49:10,471 INFO L290 TraceCheckUtils]: 98: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:49:10,471 INFO L290 TraceCheckUtils]: 99: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:49:10,471 INFO L290 TraceCheckUtils]: 100: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,472 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {66206#true} {66455#(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; {66455#(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-15 08:49:10,472 INFO L290 TraceCheckUtils]: 102: Hoare triple {66455#(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); {66455#(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-15 08:49:10,473 INFO L290 TraceCheckUtils]: 103: Hoare triple {66455#(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; {66528#(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-15 08:49:10,473 INFO L290 TraceCheckUtils]: 104: Hoare triple {66528#(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; {66528#(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-15 08:49:10,473 INFO L290 TraceCheckUtils]: 105: Hoare triple {66528#(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; {66528#(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-15 08:49:10,474 INFO L290 TraceCheckUtils]: 106: Hoare triple {66528#(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; {66528#(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-15 08:49:10,474 INFO L290 TraceCheckUtils]: 107: Hoare triple {66528#(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; {66528#(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-15 08:49:10,475 INFO L290 TraceCheckUtils]: 108: Hoare triple {66528#(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; {66528#(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-15 08:49:10,475 INFO L272 TraceCheckUtils]: 109: Hoare triple {66528#(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)); {66206#true} is VALID [2022-04-15 08:49:10,475 INFO L290 TraceCheckUtils]: 110: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:49:10,475 INFO L290 TraceCheckUtils]: 111: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:49:10,475 INFO L290 TraceCheckUtils]: 112: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,475 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {66206#true} {66528#(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; {66528#(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-15 08:49:10,476 INFO L272 TraceCheckUtils]: 114: Hoare triple {66528#(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)); {66206#true} is VALID [2022-04-15 08:49:10,476 INFO L290 TraceCheckUtils]: 115: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:49:10,476 INFO L290 TraceCheckUtils]: 116: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:49:10,476 INFO L290 TraceCheckUtils]: 117: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:49:10,476 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {66206#true} {66528#(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; {66528#(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-15 08:49:10,476 INFO L272 TraceCheckUtils]: 119: Hoare triple {66528#(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)); {66206#true} is VALID [2022-04-15 08:49:10,477 INFO L290 TraceCheckUtils]: 120: Hoare triple {66206#true} ~cond := #in~cond; {66327#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:49:10,477 INFO L290 TraceCheckUtils]: 121: Hoare triple {66327#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:49:10,477 INFO L290 TraceCheckUtils]: 122: Hoare triple {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:49:10,478 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} {66528#(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; {66528#(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-15 08:49:10,480 INFO L272 TraceCheckUtils]: 124: Hoare triple {66528#(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)); {66592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:49:10,480 INFO L290 TraceCheckUtils]: 125: Hoare triple {66592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {66596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:49:10,480 INFO L290 TraceCheckUtils]: 126: Hoare triple {66596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {66207#false} is VALID [2022-04-15 08:49:10,481 INFO L290 TraceCheckUtils]: 127: Hoare triple {66207#false} assume !false; {66207#false} is VALID [2022-04-15 08:49:10,481 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-15 08:49:10,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:50:17,375 INFO L290 TraceCheckUtils]: 127: Hoare triple {66207#false} assume !false; {66207#false} is VALID [2022-04-15 08:50:17,376 INFO L290 TraceCheckUtils]: 126: Hoare triple {66596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {66207#false} is VALID [2022-04-15 08:50:17,376 INFO L290 TraceCheckUtils]: 125: Hoare triple {66592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {66596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:50:17,377 INFO L272 TraceCheckUtils]: 124: Hoare triple {66612#(= (+ (* 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)); {66592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:50:17,378 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} {66616#(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; {66612#(= (+ (* 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-15 08:50:17,378 INFO L290 TraceCheckUtils]: 122: Hoare triple {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:50:17,379 INFO L290 TraceCheckUtils]: 121: Hoare triple {66626#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:50:17,379 INFO L290 TraceCheckUtils]: 120: Hoare triple {66206#true} ~cond := #in~cond; {66626#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 08:50:17,379 INFO L272 TraceCheckUtils]: 119: Hoare triple {66616#(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)); {66206#true} is VALID [2022-04-15 08:50:17,380 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {66206#true} {66616#(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; {66616#(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-15 08:50:17,380 INFO L290 TraceCheckUtils]: 117: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:17,380 INFO L290 TraceCheckUtils]: 116: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:50:17,380 INFO L290 TraceCheckUtils]: 115: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:50:17,380 INFO L272 TraceCheckUtils]: 114: Hoare triple {66616#(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)); {66206#true} is VALID [2022-04-15 08:50:17,381 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {66206#true} {66616#(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; {66616#(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-15 08:50:17,381 INFO L290 TraceCheckUtils]: 112: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:17,381 INFO L290 TraceCheckUtils]: 111: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:50:17,381 INFO L290 TraceCheckUtils]: 110: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:50:17,381 INFO L272 TraceCheckUtils]: 109: Hoare triple {66616#(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)); {66206#true} is VALID [2022-04-15 08:50:17,382 INFO L290 TraceCheckUtils]: 108: Hoare triple {66616#(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; {66616#(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-15 08:50:17,382 INFO L290 TraceCheckUtils]: 107: Hoare triple {66616#(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; {66616#(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-15 08:50:17,383 INFO L290 TraceCheckUtils]: 106: Hoare triple {66616#(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; {66616#(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-15 08:50:17,383 INFO L290 TraceCheckUtils]: 105: Hoare triple {66616#(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; {66616#(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-15 08:50:17,384 INFO L290 TraceCheckUtils]: 104: Hoare triple {66616#(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; {66616#(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-15 08:50:19,386 WARN L290 TraceCheckUtils]: 103: Hoare triple {66678#(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; {66616#(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-15 08:50:19,387 INFO L290 TraceCheckUtils]: 102: Hoare triple {66678#(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); {66678#(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-15 08:50:19,388 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {66206#true} {66678#(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; {66678#(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-15 08:50:19,388 INFO L290 TraceCheckUtils]: 100: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:19,388 INFO L290 TraceCheckUtils]: 99: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:50:19,388 INFO L290 TraceCheckUtils]: 98: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:50:19,389 INFO L272 TraceCheckUtils]: 97: Hoare triple {66678#(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)); {66206#true} is VALID [2022-04-15 08:50:19,389 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {66206#true} {66678#(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; {66678#(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-15 08:50:19,389 INFO L290 TraceCheckUtils]: 95: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:19,389 INFO L290 TraceCheckUtils]: 94: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:50:19,390 INFO L290 TraceCheckUtils]: 93: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:50:19,390 INFO L272 TraceCheckUtils]: 92: Hoare triple {66678#(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)); {66206#true} is VALID [2022-04-15 08:50:19,390 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {66206#true} {66678#(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; {66678#(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-15 08:50:19,391 INFO L290 TraceCheckUtils]: 90: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:19,391 INFO L290 TraceCheckUtils]: 89: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:50:19,391 INFO L290 TraceCheckUtils]: 88: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:50:19,391 INFO L272 TraceCheckUtils]: 87: Hoare triple {66678#(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)); {66206#true} is VALID [2022-04-15 08:50:19,392 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {66206#true} {66678#(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; {66678#(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-15 08:50:19,392 INFO L290 TraceCheckUtils]: 85: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:19,392 INFO L290 TraceCheckUtils]: 84: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:50:19,392 INFO L290 TraceCheckUtils]: 83: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:50:19,392 INFO L272 TraceCheckUtils]: 82: Hoare triple {66678#(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)); {66206#true} is VALID [2022-04-15 08:50:19,393 INFO L290 TraceCheckUtils]: 81: Hoare triple {66678#(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; {66678#(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-15 08:50:19,393 INFO L290 TraceCheckUtils]: 80: Hoare triple {66678#(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; {66678#(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-15 08:50:19,873 INFO L290 TraceCheckUtils]: 79: Hoare triple {66751#(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; {66678#(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-15 08:50:19,874 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {66206#true} {66751#(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; {66751#(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-15 08:50:19,874 INFO L290 TraceCheckUtils]: 77: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:19,874 INFO L290 TraceCheckUtils]: 76: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:50:19,874 INFO L290 TraceCheckUtils]: 75: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:50:19,874 INFO L272 TraceCheckUtils]: 74: Hoare triple {66751#(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)); {66206#true} is VALID [2022-04-15 08:50:19,875 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {66206#true} {66751#(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; {66751#(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-15 08:50:19,875 INFO L290 TraceCheckUtils]: 72: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:19,875 INFO L290 TraceCheckUtils]: 71: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:50:19,875 INFO L290 TraceCheckUtils]: 70: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:50:19,875 INFO L272 TraceCheckUtils]: 69: Hoare triple {66751#(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)); {66206#true} is VALID [2022-04-15 08:50:19,876 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {66206#true} {66751#(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; {66751#(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-15 08:50:19,876 INFO L290 TraceCheckUtils]: 67: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:19,876 INFO L290 TraceCheckUtils]: 66: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:50:19,876 INFO L290 TraceCheckUtils]: 65: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:50:19,876 INFO L272 TraceCheckUtils]: 64: Hoare triple {66751#(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)); {66206#true} is VALID [2022-04-15 08:50:19,877 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {66206#true} {66751#(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; {66751#(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-15 08:50:19,877 INFO L290 TraceCheckUtils]: 62: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:19,877 INFO L290 TraceCheckUtils]: 61: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:50:19,877 INFO L290 TraceCheckUtils]: 60: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:50:19,878 INFO L272 TraceCheckUtils]: 59: Hoare triple {66751#(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)); {66206#true} is VALID [2022-04-15 08:50:19,878 INFO L290 TraceCheckUtils]: 58: Hoare triple {66751#(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; {66751#(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-15 08:50:19,879 INFO L290 TraceCheckUtils]: 57: Hoare triple {66751#(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; {66751#(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-15 08:50:20,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {66821#(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; {66751#(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-15 08:50:20,061 INFO L290 TraceCheckUtils]: 55: Hoare triple {66821#(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; {66821#(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-15 08:50:20,062 INFO L290 TraceCheckUtils]: 54: Hoare triple {66821#(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; {66821#(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-15 08:50:29,342 WARN L290 TraceCheckUtils]: 53: Hoare triple {66831#(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; {66821#(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-15 08:50:29,343 INFO L290 TraceCheckUtils]: 52: Hoare triple {66831#(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); {66831#(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-15 08:50:29,344 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {66206#true} {66831#(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; {66831#(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-15 08:50:29,344 INFO L290 TraceCheckUtils]: 50: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:29,344 INFO L290 TraceCheckUtils]: 49: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:50:29,344 INFO L290 TraceCheckUtils]: 48: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:50:29,344 INFO L272 TraceCheckUtils]: 47: Hoare triple {66831#(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)); {66206#true} is VALID [2022-04-15 08:50:29,345 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} {66853#(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; {66831#(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-15 08:50:29,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:50:29,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {66626#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:50:29,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {66206#true} ~cond := #in~cond; {66626#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 08:50:29,346 INFO L272 TraceCheckUtils]: 42: Hoare triple {66853#(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)); {66206#true} is VALID [2022-04-15 08:50:29,347 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} {66869#(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; {66853#(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-15 08:50:29,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:50:29,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {66626#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {66331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:50:29,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {66206#true} ~cond := #in~cond; {66626#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 08:50:29,348 INFO L272 TraceCheckUtils]: 37: Hoare triple {66869#(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)); {66206#true} is VALID [2022-04-15 08:50:29,349 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {66206#true} {66869#(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; {66869#(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-15 08:50:29,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:29,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:50:29,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:50:29,349 INFO L272 TraceCheckUtils]: 32: Hoare triple {66869#(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)); {66206#true} is VALID [2022-04-15 08:50:29,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {66869#(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; {66869#(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-15 08:50:29,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {66869#(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; {66869#(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-15 08:50:29,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {66906#(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; {66869#(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-15 08:50:29,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {66906#(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; {66906#(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-15 08:50:29,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {66906#(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; {66906#(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-15 08:50:29,353 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {66206#true} {66906#(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; {66906#(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-15 08:50:29,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:29,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:50:29,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:50:29,353 INFO L272 TraceCheckUtils]: 22: Hoare triple {66906#(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)); {66206#true} is VALID [2022-04-15 08:50:29,354 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {66206#true} {66906#(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; {66906#(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-15 08:50:29,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:29,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:50:29,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:50:29,354 INFO L272 TraceCheckUtils]: 17: Hoare triple {66906#(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)); {66206#true} is VALID [2022-04-15 08:50:29,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {66206#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; {66906#(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-15 08:50:29,356 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {66206#true} {66206#true} #80#return; {66206#true} is VALID [2022-04-15 08:50:29,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:29,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:50:29,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:50:29,356 INFO L272 TraceCheckUtils]: 11: Hoare triple {66206#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {66206#true} is VALID [2022-04-15 08:50:29,356 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {66206#true} {66206#true} #78#return; {66206#true} is VALID [2022-04-15 08:50:29,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:29,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {66206#true} assume !(0 == ~cond); {66206#true} is VALID [2022-04-15 08:50:29,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {66206#true} ~cond := #in~cond; {66206#true} is VALID [2022-04-15 08:50:29,356 INFO L272 TraceCheckUtils]: 6: Hoare triple {66206#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {66206#true} is VALID [2022-04-15 08:50:29,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {66206#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; {66206#true} is VALID [2022-04-15 08:50:29,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {66206#true} call #t~ret8 := main(); {66206#true} is VALID [2022-04-15 08:50:29,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66206#true} {66206#true} #98#return; {66206#true} is VALID [2022-04-15 08:50:29,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {66206#true} assume true; {66206#true} is VALID [2022-04-15 08:50:29,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {66206#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; {66206#true} is VALID [2022-04-15 08:50:29,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {66206#true} call ULTIMATE.init(); {66206#true} is VALID [2022-04-15 08:50:29,358 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-15 08:50:29,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:50:29,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455416784] [2022-04-15 08:50:29,358 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:50:29,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837615160] [2022-04-15 08:50:29,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837615160] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:50:29,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:50:29,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 23 [2022-04-15 08:50:29,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:50:29,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [970005370] [2022-04-15 08:50:29,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [970005370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:50:29,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:50:29,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 08:50:29,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129722068] [2022-04-15 08:50:29,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:50:29,359 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-15 08:50:29,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:50:29,359 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-15 08:50:29,480 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-15 08:50:29,480 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 08:50:29,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:50:29,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 08:50:29,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=386, Unknown=1, NotChecked=0, Total=506 [2022-04-15 08:50:29,480 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-15 08:50:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:50:47,676 INFO L93 Difference]: Finished difference Result 617 states and 772 transitions. [2022-04-15 08:50:47,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 08:50:47,676 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-15 08:50:47,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:50:47,676 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-15 08:50:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-15 08:50:47,677 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-15 08:50:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-15 08:50:47,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 138 transitions. [2022-04-15 08:50:47,907 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-15 08:50:47,924 INFO L225 Difference]: With dead ends: 617 [2022-04-15 08:50:47,924 INFO L226 Difference]: Without dead ends: 615 [2022-04-15 08:50:47,924 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=158, Invalid=543, Unknown=1, NotChecked=0, Total=702 [2022-04-15 08:50:47,924 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 08:50:47,925 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 406 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 08:50:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-04-15 08:50:49,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 609. [2022-04-15 08:50:49,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:50:49,130 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-15 08:50:49,130 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-15 08:50:49,131 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-15 08:50:49,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:50:49,143 INFO L93 Difference]: Finished difference Result 615 states and 770 transitions. [2022-04-15 08:50:49,143 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 770 transitions. [2022-04-15 08:50:49,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:50:49,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:50:49,144 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-15 08:50:49,144 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-15 08:50:49,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:50:49,158 INFO L93 Difference]: Finished difference Result 615 states and 770 transitions. [2022-04-15 08:50:49,158 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 770 transitions. [2022-04-15 08:50:49,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:50:49,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:50:49,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:50:49,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:50:49,159 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-15 08:50:49,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 764 transitions. [2022-04-15 08:50:49,175 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 764 transitions. Word has length 128 [2022-04-15 08:50:49,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:50:49,175 INFO L478 AbstractCegarLoop]: Abstraction has 609 states and 764 transitions. [2022-04-15 08:50:49,175 INFO L479 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-15 08:50:49,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 609 states and 764 transitions. [2022-04-15 08:50:50,635 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-15 08:50:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 764 transitions. [2022-04-15 08:50:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-15 08:50:50,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:50:50,636 INFO L499 BasicCegarLoop]: 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-15 08:50:50,654 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-15 08:50:50,836 WARN L460 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-15 08:50:50,837 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:50:50,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:50:50,837 INFO L85 PathProgramCache]: Analyzing trace with hash -677811269, now seen corresponding path program 7 times [2022-04-15 08:50:50,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:50:50,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [675899684] [2022-04-15 08:50:50,837 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:50:50,837 INFO L85 PathProgramCache]: Analyzing trace with hash -677811269, now seen corresponding path program 8 times [2022-04-15 08:50:50,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:50:50,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127286798] [2022-04-15 08:50:50,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:50:50,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:50:50,863 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:50:50,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1809612855] [2022-04-15 08:50:50,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:50:50,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:50:50,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:50:50,871 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-15 08:50:50,872 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-15 08:50:50,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:50:50,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:50:50,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-15 08:50:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:50:50,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:50:52,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {70686#true} call ULTIMATE.init(); {70686#true} is VALID [2022-04-15 08:50:52,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {70686#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; {70686#true} is VALID [2022-04-15 08:50:52,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70686#true} {70686#true} #98#return; {70686#true} is VALID [2022-04-15 08:50:52,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {70686#true} call #t~ret8 := main(); {70686#true} is VALID [2022-04-15 08:50:52,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {70686#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; {70686#true} is VALID [2022-04-15 08:50:52,197 INFO L272 TraceCheckUtils]: 6: Hoare triple {70686#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {70686#true} is VALID [2022-04-15 08:50:52,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,197 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {70686#true} {70686#true} #78#return; {70686#true} is VALID [2022-04-15 08:50:52,197 INFO L272 TraceCheckUtils]: 11: Hoare triple {70686#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {70686#true} is VALID [2022-04-15 08:50:52,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,197 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {70686#true} {70686#true} #80#return; {70686#true} is VALID [2022-04-15 08:50:52,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {70686#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; {70739#(and (= 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-15 08:50:52,198 INFO L272 TraceCheckUtils]: 17: Hoare triple {70739#(and (= 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)); {70686#true} is VALID [2022-04-15 08:50:52,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,199 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {70686#true} {70739#(and (= 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; {70739#(and (= 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-15 08:50:52,199 INFO L272 TraceCheckUtils]: 22: Hoare triple {70739#(and (= 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)); {70686#true} is VALID [2022-04-15 08:50:52,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,199 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {70686#true} {70739#(and (= 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; {70739#(and (= 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-15 08:50:52,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {70739#(and (= 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; {70739#(and (= 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-15 08:50:52,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {70739#(and (= 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; {70739#(and (= 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-15 08:50:52,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {70739#(and (= 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; {70779#(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-15 08:50:52,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {70779#(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; {70779#(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-15 08:50:52,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {70779#(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; {70779#(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-15 08:50:52,201 INFO L272 TraceCheckUtils]: 32: Hoare triple {70779#(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)); {70686#true} is VALID [2022-04-15 08:50:52,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,202 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {70686#true} {70779#(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; {70779#(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-15 08:50:52,202 INFO L272 TraceCheckUtils]: 37: Hoare triple {70779#(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)); {70686#true} is VALID [2022-04-15 08:50:52,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,203 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {70686#true} {70779#(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; {70779#(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-15 08:50:52,203 INFO L272 TraceCheckUtils]: 42: Hoare triple {70779#(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)); {70686#true} is VALID [2022-04-15 08:50:52,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,204 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {70686#true} {70779#(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; {70779#(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-15 08:50:52,204 INFO L272 TraceCheckUtils]: 47: Hoare triple {70779#(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)); {70686#true} is VALID [2022-04-15 08:50:52,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,205 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {70686#true} {70779#(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; {70779#(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-15 08:50:52,207 INFO L290 TraceCheckUtils]: 52: Hoare triple {70779#(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; {70849#(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-15 08:50:52,207 INFO L290 TraceCheckUtils]: 53: Hoare triple {70849#(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; {70849#(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-15 08:50:52,208 INFO L290 TraceCheckUtils]: 54: Hoare triple {70849#(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; {70849#(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-15 08:50:52,208 INFO L272 TraceCheckUtils]: 55: Hoare triple {70849#(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)); {70686#true} is VALID [2022-04-15 08:50:52,208 INFO L290 TraceCheckUtils]: 56: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,208 INFO L290 TraceCheckUtils]: 57: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,208 INFO L290 TraceCheckUtils]: 58: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,209 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {70686#true} {70849#(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; {70849#(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-15 08:50:52,209 INFO L272 TraceCheckUtils]: 60: Hoare triple {70849#(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)); {70686#true} is VALID [2022-04-15 08:50:52,209 INFO L290 TraceCheckUtils]: 61: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,209 INFO L290 TraceCheckUtils]: 62: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,209 INFO L290 TraceCheckUtils]: 63: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,209 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {70686#true} {70849#(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; {70849#(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-15 08:50:52,210 INFO L272 TraceCheckUtils]: 65: Hoare triple {70849#(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)); {70686#true} is VALID [2022-04-15 08:50:52,210 INFO L290 TraceCheckUtils]: 66: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,210 INFO L290 TraceCheckUtils]: 67: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,210 INFO L290 TraceCheckUtils]: 68: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,210 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {70686#true} {70849#(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; {70849#(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-15 08:50:52,210 INFO L272 TraceCheckUtils]: 70: Hoare triple {70849#(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)); {70686#true} is VALID [2022-04-15 08:50:52,211 INFO L290 TraceCheckUtils]: 71: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,211 INFO L290 TraceCheckUtils]: 72: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,211 INFO L290 TraceCheckUtils]: 73: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,211 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {70686#true} {70849#(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; {70849#(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-15 08:50:52,212 INFO L290 TraceCheckUtils]: 75: Hoare triple {70849#(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; {70919#(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-15 08:50:52,213 INFO L290 TraceCheckUtils]: 76: Hoare triple {70919#(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; {70919#(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-15 08:50:52,213 INFO L290 TraceCheckUtils]: 77: Hoare triple {70919#(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; {70919#(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-15 08:50:52,213 INFO L272 TraceCheckUtils]: 78: Hoare triple {70919#(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)); {70686#true} is VALID [2022-04-15 08:50:52,213 INFO L290 TraceCheckUtils]: 79: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,213 INFO L290 TraceCheckUtils]: 80: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,213 INFO L290 TraceCheckUtils]: 81: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,214 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {70686#true} {70919#(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; {70919#(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-15 08:50:52,214 INFO L272 TraceCheckUtils]: 83: Hoare triple {70919#(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)); {70686#true} is VALID [2022-04-15 08:50:52,214 INFO L290 TraceCheckUtils]: 84: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,214 INFO L290 TraceCheckUtils]: 85: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,214 INFO L290 TraceCheckUtils]: 86: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,215 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {70686#true} {70919#(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; {70919#(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-15 08:50:52,215 INFO L272 TraceCheckUtils]: 88: Hoare triple {70919#(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)); {70686#true} is VALID [2022-04-15 08:50:52,215 INFO L290 TraceCheckUtils]: 89: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,215 INFO L290 TraceCheckUtils]: 90: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,215 INFO L290 TraceCheckUtils]: 91: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,216 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {70686#true} {70919#(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; {70919#(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-15 08:50:52,216 INFO L272 TraceCheckUtils]: 93: Hoare triple {70919#(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)); {70686#true} is VALID [2022-04-15 08:50:52,216 INFO L290 TraceCheckUtils]: 94: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,216 INFO L290 TraceCheckUtils]: 95: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,216 INFO L290 TraceCheckUtils]: 96: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,216 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {70686#true} {70919#(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; {70919#(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-15 08:50:52,218 INFO L290 TraceCheckUtils]: 98: Hoare triple {70919#(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; {70989#(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-15 08:50:52,218 INFO L290 TraceCheckUtils]: 99: Hoare triple {70989#(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; {70989#(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-15 08:50:52,218 INFO L290 TraceCheckUtils]: 100: Hoare triple {70989#(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; {70989#(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-15 08:50:52,218 INFO L272 TraceCheckUtils]: 101: Hoare triple {70989#(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)); {70686#true} is VALID [2022-04-15 08:50:52,219 INFO L290 TraceCheckUtils]: 102: Hoare triple {70686#true} ~cond := #in~cond; {71002#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:50:52,219 INFO L290 TraceCheckUtils]: 103: Hoare triple {71002#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:50:52,219 INFO L290 TraceCheckUtils]: 104: Hoare triple {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:50:52,220 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} {70989#(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; {71013#(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-15 08:50:52,220 INFO L272 TraceCheckUtils]: 106: Hoare triple {71013#(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)); {70686#true} is VALID [2022-04-15 08:50:52,220 INFO L290 TraceCheckUtils]: 107: Hoare triple {70686#true} ~cond := #in~cond; {71002#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:50:52,221 INFO L290 TraceCheckUtils]: 108: Hoare triple {71002#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:50:52,221 INFO L290 TraceCheckUtils]: 109: Hoare triple {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:50:52,223 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} {71013#(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; {71029#(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-15 08:50:52,223 INFO L272 TraceCheckUtils]: 111: Hoare triple {71029#(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)); {70686#true} is VALID [2022-04-15 08:50:52,223 INFO L290 TraceCheckUtils]: 112: Hoare triple {70686#true} ~cond := #in~cond; {71002#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:50:52,223 INFO L290 TraceCheckUtils]: 113: Hoare triple {71002#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:50:52,224 INFO L290 TraceCheckUtils]: 114: Hoare triple {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:50:52,225 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} {71029#(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; {71045#(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-15 08:50:52,225 INFO L272 TraceCheckUtils]: 116: Hoare triple {71045#(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)); {70686#true} is VALID [2022-04-15 08:50:52,225 INFO L290 TraceCheckUtils]: 117: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:50:52,225 INFO L290 TraceCheckUtils]: 118: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:50:52,225 INFO L290 TraceCheckUtils]: 119: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:50:52,226 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {70686#true} {71045#(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; {71045#(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-15 08:50:52,226 INFO L290 TraceCheckUtils]: 121: Hoare triple {71045#(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); {71045#(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-15 08:50:52,229 INFO L290 TraceCheckUtils]: 122: Hoare triple {71045#(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; {71067#(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-15 08:50:52,229 INFO L290 TraceCheckUtils]: 123: Hoare triple {71067#(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; {71067#(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-15 08:50:52,230 INFO L290 TraceCheckUtils]: 124: Hoare triple {71067#(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; {71067#(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-15 08:50:52,230 INFO L290 TraceCheckUtils]: 125: Hoare triple {71067#(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); {71077#(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-15 08:50:52,231 INFO L272 TraceCheckUtils]: 126: Hoare triple {71077#(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)); {71081#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:50:52,231 INFO L290 TraceCheckUtils]: 127: Hoare triple {71081#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {71085#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:50:52,231 INFO L290 TraceCheckUtils]: 128: Hoare triple {71085#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {70687#false} is VALID [2022-04-15 08:50:52,231 INFO L290 TraceCheckUtils]: 129: Hoare triple {70687#false} assume !false; {70687#false} is VALID [2022-04-15 08:50:52,232 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-15 08:50:52,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:52:54,670 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 08:53:30,344 INFO L290 TraceCheckUtils]: 129: Hoare triple {70687#false} assume !false; {70687#false} is VALID [2022-04-15 08:53:30,345 INFO L290 TraceCheckUtils]: 128: Hoare triple {71085#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {70687#false} is VALID [2022-04-15 08:53:30,345 INFO L290 TraceCheckUtils]: 127: Hoare triple {71081#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {71085#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:53:30,346 INFO L272 TraceCheckUtils]: 126: Hoare triple {71101#(= (+ (* 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)); {71081#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:53:30,346 INFO L290 TraceCheckUtils]: 125: Hoare triple {71105#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {71101#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-15 08:53:30,346 INFO L290 TraceCheckUtils]: 124: Hoare triple {71105#(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; {71105#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-15 08:53:30,347 INFO L290 TraceCheckUtils]: 123: Hoare triple {71105#(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; {71105#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-15 08:53:32,226 INFO L290 TraceCheckUtils]: 122: Hoare triple {71115#(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; {71105#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-15 08:53:32,226 INFO L290 TraceCheckUtils]: 121: Hoare triple {71115#(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); {71115#(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-15 08:53:32,227 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {70686#true} {71115#(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; {71115#(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-15 08:53:32,227 INFO L290 TraceCheckUtils]: 119: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,227 INFO L290 TraceCheckUtils]: 118: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,227 INFO L290 TraceCheckUtils]: 117: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,228 INFO L272 TraceCheckUtils]: 116: Hoare triple {71115#(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)); {70686#true} is VALID [2022-04-15 08:53:32,228 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} {71137#(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; {71115#(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-15 08:53:32,229 INFO L290 TraceCheckUtils]: 114: Hoare triple {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:53:32,229 INFO L290 TraceCheckUtils]: 113: Hoare triple {71147#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:53:32,229 INFO L290 TraceCheckUtils]: 112: Hoare triple {70686#true} ~cond := #in~cond; {71147#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 08:53:32,230 INFO L272 TraceCheckUtils]: 111: Hoare triple {71137#(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)); {70686#true} is VALID [2022-04-15 08:53:32,230 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} {71154#(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; {71137#(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-15 08:53:32,231 INFO L290 TraceCheckUtils]: 109: Hoare triple {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:53:32,231 INFO L290 TraceCheckUtils]: 108: Hoare triple {71147#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:53:32,231 INFO L290 TraceCheckUtils]: 107: Hoare triple {70686#true} ~cond := #in~cond; {71147#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 08:53:32,232 INFO L272 TraceCheckUtils]: 106: Hoare triple {71154#(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)); {70686#true} is VALID [2022-04-15 08:53:32,250 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} {70686#true} #86#return; {71154#(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-15 08:53:32,250 INFO L290 TraceCheckUtils]: 104: Hoare triple {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:53:32,251 INFO L290 TraceCheckUtils]: 103: Hoare triple {71147#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {71006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:53:32,251 INFO L290 TraceCheckUtils]: 102: Hoare triple {70686#true} ~cond := #in~cond; {71147#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 08:53:32,251 INFO L272 TraceCheckUtils]: 101: Hoare triple {70686#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {70686#true} is VALID [2022-04-15 08:53:32,251 INFO L290 TraceCheckUtils]: 100: Hoare triple {70686#true} assume !!(#t~post7 < 10);havoc #t~post7; {70686#true} is VALID [2022-04-15 08:53:32,251 INFO L290 TraceCheckUtils]: 99: Hoare triple {70686#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70686#true} is VALID [2022-04-15 08:53:32,251 INFO L290 TraceCheckUtils]: 98: Hoare triple {70686#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {70686#true} is VALID [2022-04-15 08:53:32,251 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {70686#true} {70686#true} #92#return; {70686#true} is VALID [2022-04-15 08:53:32,251 INFO L290 TraceCheckUtils]: 96: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,251 INFO L290 TraceCheckUtils]: 95: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,251 INFO L290 TraceCheckUtils]: 94: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,251 INFO L272 TraceCheckUtils]: 93: Hoare triple {70686#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)); {70686#true} is VALID [2022-04-15 08:53:32,252 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {70686#true} {70686#true} #90#return; {70686#true} is VALID [2022-04-15 08:53:32,252 INFO L290 TraceCheckUtils]: 91: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,252 INFO L290 TraceCheckUtils]: 90: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,252 INFO L290 TraceCheckUtils]: 89: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,252 INFO L272 TraceCheckUtils]: 88: Hoare triple {70686#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {70686#true} is VALID [2022-04-15 08:53:32,252 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {70686#true} {70686#true} #88#return; {70686#true} is VALID [2022-04-15 08:53:32,252 INFO L290 TraceCheckUtils]: 86: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,252 INFO L290 TraceCheckUtils]: 85: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,252 INFO L290 TraceCheckUtils]: 84: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,252 INFO L272 TraceCheckUtils]: 83: Hoare triple {70686#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {70686#true} is VALID [2022-04-15 08:53:32,252 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {70686#true} {70686#true} #86#return; {70686#true} is VALID [2022-04-15 08:53:32,252 INFO L290 TraceCheckUtils]: 81: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,252 INFO L290 TraceCheckUtils]: 80: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,252 INFO L290 TraceCheckUtils]: 79: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,252 INFO L272 TraceCheckUtils]: 78: Hoare triple {70686#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {70686#true} is VALID [2022-04-15 08:53:32,253 INFO L290 TraceCheckUtils]: 77: Hoare triple {70686#true} assume !!(#t~post7 < 10);havoc #t~post7; {70686#true} is VALID [2022-04-15 08:53:32,253 INFO L290 TraceCheckUtils]: 76: Hoare triple {70686#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70686#true} is VALID [2022-04-15 08:53:32,253 INFO L290 TraceCheckUtils]: 75: Hoare triple {70686#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {70686#true} is VALID [2022-04-15 08:53:32,253 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {70686#true} {70686#true} #92#return; {70686#true} is VALID [2022-04-15 08:53:32,253 INFO L290 TraceCheckUtils]: 73: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,253 INFO L290 TraceCheckUtils]: 72: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,253 INFO L290 TraceCheckUtils]: 71: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,253 INFO L272 TraceCheckUtils]: 70: Hoare triple {70686#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)); {70686#true} is VALID [2022-04-15 08:53:32,253 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {70686#true} {70686#true} #90#return; {70686#true} is VALID [2022-04-15 08:53:32,253 INFO L290 TraceCheckUtils]: 68: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,253 INFO L290 TraceCheckUtils]: 67: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,253 INFO L290 TraceCheckUtils]: 66: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,253 INFO L272 TraceCheckUtils]: 65: Hoare triple {70686#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {70686#true} is VALID [2022-04-15 08:53:32,253 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {70686#true} {70686#true} #88#return; {70686#true} is VALID [2022-04-15 08:53:32,253 INFO L290 TraceCheckUtils]: 63: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,253 INFO L290 TraceCheckUtils]: 62: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,254 INFO L290 TraceCheckUtils]: 61: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,254 INFO L272 TraceCheckUtils]: 60: Hoare triple {70686#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {70686#true} is VALID [2022-04-15 08:53:32,254 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {70686#true} {70686#true} #86#return; {70686#true} is VALID [2022-04-15 08:53:32,254 INFO L290 TraceCheckUtils]: 58: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,254 INFO L290 TraceCheckUtils]: 57: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,254 INFO L290 TraceCheckUtils]: 56: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,254 INFO L272 TraceCheckUtils]: 55: Hoare triple {70686#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {70686#true} is VALID [2022-04-15 08:53:32,254 INFO L290 TraceCheckUtils]: 54: Hoare triple {70686#true} assume !!(#t~post7 < 10);havoc #t~post7; {70686#true} is VALID [2022-04-15 08:53:32,254 INFO L290 TraceCheckUtils]: 53: Hoare triple {70686#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70686#true} is VALID [2022-04-15 08:53:32,254 INFO L290 TraceCheckUtils]: 52: Hoare triple {70686#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {70686#true} is VALID [2022-04-15 08:53:32,254 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {70686#true} {70686#true} #92#return; {70686#true} is VALID [2022-04-15 08:53:32,254 INFO L290 TraceCheckUtils]: 50: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,254 INFO L290 TraceCheckUtils]: 49: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,254 INFO L272 TraceCheckUtils]: 47: Hoare triple {70686#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)); {70686#true} is VALID [2022-04-15 08:53:32,255 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {70686#true} {70686#true} #90#return; {70686#true} is VALID [2022-04-15 08:53:32,255 INFO L290 TraceCheckUtils]: 45: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,255 INFO L290 TraceCheckUtils]: 44: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,255 INFO L290 TraceCheckUtils]: 43: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,255 INFO L272 TraceCheckUtils]: 42: Hoare triple {70686#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {70686#true} is VALID [2022-04-15 08:53:32,255 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {70686#true} {70686#true} #88#return; {70686#true} is VALID [2022-04-15 08:53:32,255 INFO L290 TraceCheckUtils]: 40: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,255 INFO L290 TraceCheckUtils]: 39: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,255 INFO L272 TraceCheckUtils]: 37: Hoare triple {70686#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {70686#true} is VALID [2022-04-15 08:53:32,255 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {70686#true} {70686#true} #86#return; {70686#true} is VALID [2022-04-15 08:53:32,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,255 INFO L272 TraceCheckUtils]: 32: Hoare triple {70686#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {70686#true} is VALID [2022-04-15 08:53:32,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {70686#true} assume !!(#t~post7 < 10);havoc #t~post7; {70686#true} is VALID [2022-04-15 08:53:32,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {70686#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70686#true} is VALID [2022-04-15 08:53:32,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {70686#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {70686#true} is VALID [2022-04-15 08:53:32,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {70686#true} assume !!(#t~post6 < 10);havoc #t~post6; {70686#true} is VALID [2022-04-15 08:53:32,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {70686#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70686#true} is VALID [2022-04-15 08:53:32,256 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {70686#true} {70686#true} #84#return; {70686#true} is VALID [2022-04-15 08:53:32,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,256 INFO L272 TraceCheckUtils]: 22: Hoare triple {70686#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {70686#true} is VALID [2022-04-15 08:53:32,256 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {70686#true} {70686#true} #82#return; {70686#true} is VALID [2022-04-15 08:53:32,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,256 INFO L272 TraceCheckUtils]: 17: Hoare triple {70686#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {70686#true} is VALID [2022-04-15 08:53:32,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {70686#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; {70686#true} is VALID [2022-04-15 08:53:32,257 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {70686#true} {70686#true} #80#return; {70686#true} is VALID [2022-04-15 08:53:32,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,257 INFO L272 TraceCheckUtils]: 11: Hoare triple {70686#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {70686#true} is VALID [2022-04-15 08:53:32,257 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {70686#true} {70686#true} #78#return; {70686#true} is VALID [2022-04-15 08:53:32,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {70686#true} assume !(0 == ~cond); {70686#true} is VALID [2022-04-15 08:53:32,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {70686#true} ~cond := #in~cond; {70686#true} is VALID [2022-04-15 08:53:32,257 INFO L272 TraceCheckUtils]: 6: Hoare triple {70686#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {70686#true} is VALID [2022-04-15 08:53:32,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {70686#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; {70686#true} is VALID [2022-04-15 08:53:32,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {70686#true} call #t~ret8 := main(); {70686#true} is VALID [2022-04-15 08:53:32,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70686#true} {70686#true} #98#return; {70686#true} is VALID [2022-04-15 08:53:32,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {70686#true} assume true; {70686#true} is VALID [2022-04-15 08:53:32,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {70686#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; {70686#true} is VALID [2022-04-15 08:53:32,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {70686#true} call ULTIMATE.init(); {70686#true} is VALID [2022-04-15 08:53:32,258 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-15 08:53:32,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:53:32,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127286798] [2022-04-15 08:53:32,258 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:53:32,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809612855] [2022-04-15 08:53:32,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809612855] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:53:32,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:53:32,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2022-04-15 08:53:32,259 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:53:32,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [675899684] [2022-04-15 08:53:32,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [675899684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:53:32,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:53:32,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 08:53:32,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955716733] [2022-04-15 08:53:32,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:53:32,260 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-15 08:53:32,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:53:32,260 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-15 08:53:32,350 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-15 08:53:32,350 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 08:53:32,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:53:32,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 08:53:32,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2022-04-15 08:53:32,351 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-15 08:53:36,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:53:36,818 INFO L93 Difference]: Finished difference Result 642 states and 811 transitions. [2022-04-15 08:53:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 08:53:36,818 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-15 08:53:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:53:36,818 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-15 08:53:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2022-04-15 08:53:36,819 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-15 08:53:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2022-04-15 08:53:36,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 138 transitions. [2022-04-15 08:53:37,000 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-15 08:53:37,018 INFO L225 Difference]: With dead ends: 642 [2022-04-15 08:53:37,018 INFO L226 Difference]: Without dead ends: 637 [2022-04-15 08:53:37,018 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-04-15 08:53:37,018 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 38 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 08:53:37,019 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 382 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 08:53:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-04-15 08:53:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 613. [2022-04-15 08:53:38,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:53:38,244 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-15 08:53:38,245 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-15 08:53:38,245 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-15 08:53:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:53:38,259 INFO L93 Difference]: Finished difference Result 637 states and 805 transitions. [2022-04-15 08:53:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 805 transitions. [2022-04-15 08:53:38,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:53:38,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:53:38,260 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-15 08:53:38,260 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-15 08:53:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:53:38,274 INFO L93 Difference]: Finished difference Result 637 states and 805 transitions. [2022-04-15 08:53:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 805 transitions. [2022-04-15 08:53:38,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:53:38,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:53:38,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:53:38,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:53:38,275 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-15 08:53:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 769 transitions. [2022-04-15 08:53:38,292 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 769 transitions. Word has length 130 [2022-04-15 08:53:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:53:38,293 INFO L478 AbstractCegarLoop]: Abstraction has 613 states and 769 transitions. [2022-04-15 08:53:38,293 INFO L479 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-15 08:53:38,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 613 states and 769 transitions. [2022-04-15 08:53:39,956 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-15 08:53:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 769 transitions. [2022-04-15 08:53:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-15 08:53:39,957 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:53:39,958 INFO L499 BasicCegarLoop]: 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-15 08:53:39,974 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-15 08:53:40,160 WARN L460 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-15 08:53:40,160 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:53:40,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:53:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2098906485, now seen corresponding path program 7 times [2022-04-15 08:53:40,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:53:40,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [859662714] [2022-04-15 08:53:40,161 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:53:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2098906485, now seen corresponding path program 8 times [2022-04-15 08:53:40,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:53:40,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396234558] [2022-04-15 08:53:40,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:53:40,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:53:40,176 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:53:40,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1082361025] [2022-04-15 08:53:40,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:53:40,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:53:40,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:53:40,177 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-15 08:53:40,178 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-15 08:53:40,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:53:40,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:53:40,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 08:53:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:53:40,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:53:40,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {75277#true} call ULTIMATE.init(); {75277#true} is VALID [2022-04-15 08:53:40,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {75277#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; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {75285#(<= ~counter~0 0)} assume true; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75285#(<= ~counter~0 0)} {75277#true} #98#return; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {75285#(<= ~counter~0 0)} call #t~ret8 := main(); {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {75285#(<= ~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; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,713 INFO L272 TraceCheckUtils]: 6: Hoare triple {75285#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {75285#(<= ~counter~0 0)} ~cond := #in~cond; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {75285#(<= ~counter~0 0)} assume !(0 == ~cond); {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {75285#(<= ~counter~0 0)} assume true; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,714 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {75285#(<= ~counter~0 0)} {75285#(<= ~counter~0 0)} #78#return; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,714 INFO L272 TraceCheckUtils]: 11: Hoare triple {75285#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {75285#(<= ~counter~0 0)} ~cond := #in~cond; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {75285#(<= ~counter~0 0)} assume !(0 == ~cond); {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {75285#(<= ~counter~0 0)} assume true; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,715 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {75285#(<= ~counter~0 0)} {75285#(<= ~counter~0 0)} #80#return; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {75285#(<= ~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; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,716 INFO L272 TraceCheckUtils]: 17: Hoare triple {75285#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {75285#(<= ~counter~0 0)} ~cond := #in~cond; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {75285#(<= ~counter~0 0)} assume !(0 == ~cond); {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {75285#(<= ~counter~0 0)} assume true; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,717 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {75285#(<= ~counter~0 0)} {75285#(<= ~counter~0 0)} #82#return; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,717 INFO L272 TraceCheckUtils]: 22: Hoare triple {75285#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {75285#(<= ~counter~0 0)} ~cond := #in~cond; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {75285#(<= ~counter~0 0)} assume !(0 == ~cond); {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {75285#(<= ~counter~0 0)} assume true; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,719 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {75285#(<= ~counter~0 0)} {75285#(<= ~counter~0 0)} #84#return; {75285#(<= ~counter~0 0)} is VALID [2022-04-15 08:53:40,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {75285#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75364#(<= ~counter~0 1)} is VALID [2022-04-15 08:53:40,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {75364#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {75364#(<= ~counter~0 1)} is VALID [2022-04-15 08:53:40,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {75364#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {75364#(<= ~counter~0 1)} is VALID [2022-04-15 08:53:40,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {75364#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {75374#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,722 INFO L272 TraceCheckUtils]: 32: Hoare triple {75374#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {75374#(<= ~counter~0 2)} ~cond := #in~cond; {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {75374#(<= ~counter~0 2)} assume !(0 == ~cond); {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {75374#(<= ~counter~0 2)} assume true; {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,723 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {75374#(<= ~counter~0 2)} {75374#(<= ~counter~0 2)} #86#return; {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,724 INFO L272 TraceCheckUtils]: 37: Hoare triple {75374#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {75374#(<= ~counter~0 2)} ~cond := #in~cond; {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {75374#(<= ~counter~0 2)} assume !(0 == ~cond); {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {75374#(<= ~counter~0 2)} assume true; {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,725 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {75374#(<= ~counter~0 2)} {75374#(<= ~counter~0 2)} #88#return; {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,726 INFO L272 TraceCheckUtils]: 42: Hoare triple {75374#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {75374#(<= ~counter~0 2)} ~cond := #in~cond; {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {75374#(<= ~counter~0 2)} assume !(0 == ~cond); {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {75374#(<= ~counter~0 2)} assume true; {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,727 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {75374#(<= ~counter~0 2)} {75374#(<= ~counter~0 2)} #90#return; {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,727 INFO L272 TraceCheckUtils]: 47: Hoare triple {75374#(<= ~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)); {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {75374#(<= ~counter~0 2)} ~cond := #in~cond; {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {75374#(<= ~counter~0 2)} assume !(0 == ~cond); {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {75374#(<= ~counter~0 2)} assume true; {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,729 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {75374#(<= ~counter~0 2)} {75374#(<= ~counter~0 2)} #92#return; {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {75374#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {75374#(<= ~counter~0 2)} is VALID [2022-04-15 08:53:40,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {75374#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,730 INFO L290 TraceCheckUtils]: 54: Hoare triple {75444#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,730 INFO L272 TraceCheckUtils]: 55: Hoare triple {75444#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,731 INFO L290 TraceCheckUtils]: 56: Hoare triple {75444#(<= ~counter~0 3)} ~cond := #in~cond; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {75444#(<= ~counter~0 3)} assume !(0 == ~cond); {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {75444#(<= ~counter~0 3)} assume true; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,732 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {75444#(<= ~counter~0 3)} {75444#(<= ~counter~0 3)} #86#return; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,732 INFO L272 TraceCheckUtils]: 60: Hoare triple {75444#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,732 INFO L290 TraceCheckUtils]: 61: Hoare triple {75444#(<= ~counter~0 3)} ~cond := #in~cond; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,733 INFO L290 TraceCheckUtils]: 62: Hoare triple {75444#(<= ~counter~0 3)} assume !(0 == ~cond); {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,733 INFO L290 TraceCheckUtils]: 63: Hoare triple {75444#(<= ~counter~0 3)} assume true; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,733 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {75444#(<= ~counter~0 3)} {75444#(<= ~counter~0 3)} #88#return; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,734 INFO L272 TraceCheckUtils]: 65: Hoare triple {75444#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,734 INFO L290 TraceCheckUtils]: 66: Hoare triple {75444#(<= ~counter~0 3)} ~cond := #in~cond; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,734 INFO L290 TraceCheckUtils]: 67: Hoare triple {75444#(<= ~counter~0 3)} assume !(0 == ~cond); {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,735 INFO L290 TraceCheckUtils]: 68: Hoare triple {75444#(<= ~counter~0 3)} assume true; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,735 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {75444#(<= ~counter~0 3)} {75444#(<= ~counter~0 3)} #90#return; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,736 INFO L272 TraceCheckUtils]: 70: Hoare triple {75444#(<= ~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)); {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,736 INFO L290 TraceCheckUtils]: 71: Hoare triple {75444#(<= ~counter~0 3)} ~cond := #in~cond; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,736 INFO L290 TraceCheckUtils]: 72: Hoare triple {75444#(<= ~counter~0 3)} assume !(0 == ~cond); {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,736 INFO L290 TraceCheckUtils]: 73: Hoare triple {75444#(<= ~counter~0 3)} assume true; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,737 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {75444#(<= ~counter~0 3)} {75444#(<= ~counter~0 3)} #92#return; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,737 INFO L290 TraceCheckUtils]: 75: Hoare triple {75444#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,737 INFO L290 TraceCheckUtils]: 76: Hoare triple {75444#(<= ~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; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:40,738 INFO L290 TraceCheckUtils]: 77: Hoare triple {75444#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75517#(<= ~counter~0 4)} is VALID [2022-04-15 08:53:40,738 INFO L290 TraceCheckUtils]: 78: Hoare triple {75517#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {75517#(<= ~counter~0 4)} is VALID [2022-04-15 08:53:40,739 INFO L290 TraceCheckUtils]: 79: Hoare triple {75517#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {75517#(<= ~counter~0 4)} is VALID [2022-04-15 08:53:40,739 INFO L290 TraceCheckUtils]: 80: Hoare triple {75517#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,740 INFO L290 TraceCheckUtils]: 81: Hoare triple {75527#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,740 INFO L272 TraceCheckUtils]: 82: Hoare triple {75527#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,740 INFO L290 TraceCheckUtils]: 83: Hoare triple {75527#(<= ~counter~0 5)} ~cond := #in~cond; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,741 INFO L290 TraceCheckUtils]: 84: Hoare triple {75527#(<= ~counter~0 5)} assume !(0 == ~cond); {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,741 INFO L290 TraceCheckUtils]: 85: Hoare triple {75527#(<= ~counter~0 5)} assume true; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,741 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {75527#(<= ~counter~0 5)} {75527#(<= ~counter~0 5)} #86#return; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,742 INFO L272 TraceCheckUtils]: 87: Hoare triple {75527#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,742 INFO L290 TraceCheckUtils]: 88: Hoare triple {75527#(<= ~counter~0 5)} ~cond := #in~cond; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,742 INFO L290 TraceCheckUtils]: 89: Hoare triple {75527#(<= ~counter~0 5)} assume !(0 == ~cond); {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,743 INFO L290 TraceCheckUtils]: 90: Hoare triple {75527#(<= ~counter~0 5)} assume true; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,743 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {75527#(<= ~counter~0 5)} {75527#(<= ~counter~0 5)} #88#return; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,752 INFO L272 TraceCheckUtils]: 92: Hoare triple {75527#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,752 INFO L290 TraceCheckUtils]: 93: Hoare triple {75527#(<= ~counter~0 5)} ~cond := #in~cond; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,753 INFO L290 TraceCheckUtils]: 94: Hoare triple {75527#(<= ~counter~0 5)} assume !(0 == ~cond); {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,753 INFO L290 TraceCheckUtils]: 95: Hoare triple {75527#(<= ~counter~0 5)} assume true; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,753 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {75527#(<= ~counter~0 5)} {75527#(<= ~counter~0 5)} #90#return; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,754 INFO L272 TraceCheckUtils]: 97: Hoare triple {75527#(<= ~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)); {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,754 INFO L290 TraceCheckUtils]: 98: Hoare triple {75527#(<= ~counter~0 5)} ~cond := #in~cond; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,754 INFO L290 TraceCheckUtils]: 99: Hoare triple {75527#(<= ~counter~0 5)} assume !(0 == ~cond); {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,755 INFO L290 TraceCheckUtils]: 100: Hoare triple {75527#(<= ~counter~0 5)} assume true; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,755 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {75527#(<= ~counter~0 5)} {75527#(<= ~counter~0 5)} #92#return; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,755 INFO L290 TraceCheckUtils]: 102: Hoare triple {75527#(<= ~counter~0 5)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:40,757 INFO L290 TraceCheckUtils]: 103: Hoare triple {75527#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,757 INFO L290 TraceCheckUtils]: 104: Hoare triple {75597#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,758 INFO L272 TraceCheckUtils]: 105: Hoare triple {75597#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,758 INFO L290 TraceCheckUtils]: 106: Hoare triple {75597#(<= ~counter~0 6)} ~cond := #in~cond; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,758 INFO L290 TraceCheckUtils]: 107: Hoare triple {75597#(<= ~counter~0 6)} assume !(0 == ~cond); {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,758 INFO L290 TraceCheckUtils]: 108: Hoare triple {75597#(<= ~counter~0 6)} assume true; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,759 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {75597#(<= ~counter~0 6)} {75597#(<= ~counter~0 6)} #86#return; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,759 INFO L272 TraceCheckUtils]: 110: Hoare triple {75597#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,760 INFO L290 TraceCheckUtils]: 111: Hoare triple {75597#(<= ~counter~0 6)} ~cond := #in~cond; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,760 INFO L290 TraceCheckUtils]: 112: Hoare triple {75597#(<= ~counter~0 6)} assume !(0 == ~cond); {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,760 INFO L290 TraceCheckUtils]: 113: Hoare triple {75597#(<= ~counter~0 6)} assume true; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,761 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {75597#(<= ~counter~0 6)} {75597#(<= ~counter~0 6)} #88#return; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,761 INFO L272 TraceCheckUtils]: 115: Hoare triple {75597#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,761 INFO L290 TraceCheckUtils]: 116: Hoare triple {75597#(<= ~counter~0 6)} ~cond := #in~cond; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,761 INFO L290 TraceCheckUtils]: 117: Hoare triple {75597#(<= ~counter~0 6)} assume !(0 == ~cond); {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,762 INFO L290 TraceCheckUtils]: 118: Hoare triple {75597#(<= ~counter~0 6)} assume true; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,762 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {75597#(<= ~counter~0 6)} {75597#(<= ~counter~0 6)} #90#return; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,763 INFO L272 TraceCheckUtils]: 120: Hoare triple {75597#(<= ~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)); {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,763 INFO L290 TraceCheckUtils]: 121: Hoare triple {75597#(<= ~counter~0 6)} ~cond := #in~cond; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,763 INFO L290 TraceCheckUtils]: 122: Hoare triple {75597#(<= ~counter~0 6)} assume !(0 == ~cond); {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,763 INFO L290 TraceCheckUtils]: 123: Hoare triple {75597#(<= ~counter~0 6)} assume true; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,764 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {75597#(<= ~counter~0 6)} {75597#(<= ~counter~0 6)} #92#return; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,764 INFO L290 TraceCheckUtils]: 125: Hoare triple {75597#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,765 INFO L290 TraceCheckUtils]: 126: Hoare triple {75597#(<= ~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; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:40,765 INFO L290 TraceCheckUtils]: 127: Hoare triple {75597#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75670#(<= |main_#t~post6| 6)} is VALID [2022-04-15 08:53:40,765 INFO L290 TraceCheckUtils]: 128: Hoare triple {75670#(<= |main_#t~post6| 6)} assume !(#t~post6 < 10);havoc #t~post6; {75278#false} is VALID [2022-04-15 08:53:40,765 INFO L272 TraceCheckUtils]: 129: Hoare triple {75278#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {75278#false} is VALID [2022-04-15 08:53:40,765 INFO L290 TraceCheckUtils]: 130: Hoare triple {75278#false} ~cond := #in~cond; {75278#false} is VALID [2022-04-15 08:53:40,765 INFO L290 TraceCheckUtils]: 131: Hoare triple {75278#false} assume 0 == ~cond; {75278#false} is VALID [2022-04-15 08:53:40,765 INFO L290 TraceCheckUtils]: 132: Hoare triple {75278#false} assume !false; {75278#false} is VALID [2022-04-15 08:53:40,766 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-15 08:53:40,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:53:41,225 INFO L290 TraceCheckUtils]: 132: Hoare triple {75278#false} assume !false; {75278#false} is VALID [2022-04-15 08:53:41,226 INFO L290 TraceCheckUtils]: 131: Hoare triple {75278#false} assume 0 == ~cond; {75278#false} is VALID [2022-04-15 08:53:41,226 INFO L290 TraceCheckUtils]: 130: Hoare triple {75278#false} ~cond := #in~cond; {75278#false} is VALID [2022-04-15 08:53:41,226 INFO L272 TraceCheckUtils]: 129: Hoare triple {75278#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {75278#false} is VALID [2022-04-15 08:53:41,226 INFO L290 TraceCheckUtils]: 128: Hoare triple {75698#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {75278#false} is VALID [2022-04-15 08:53:41,226 INFO L290 TraceCheckUtils]: 127: Hoare triple {75702#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75698#(< |main_#t~post6| 10)} is VALID [2022-04-15 08:53:41,227 INFO L290 TraceCheckUtils]: 126: Hoare triple {75702#(< ~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; {75702#(< ~counter~0 10)} is VALID [2022-04-15 08:53:41,227 INFO L290 TraceCheckUtils]: 125: Hoare triple {75702#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {75702#(< ~counter~0 10)} is VALID [2022-04-15 08:53:41,228 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {75277#true} {75702#(< ~counter~0 10)} #92#return; {75702#(< ~counter~0 10)} is VALID [2022-04-15 08:53:41,228 INFO L290 TraceCheckUtils]: 123: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,228 INFO L290 TraceCheckUtils]: 122: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,228 INFO L290 TraceCheckUtils]: 121: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,228 INFO L272 TraceCheckUtils]: 120: Hoare triple {75702#(< ~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)); {75277#true} is VALID [2022-04-15 08:53:41,228 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {75277#true} {75702#(< ~counter~0 10)} #90#return; {75702#(< ~counter~0 10)} is VALID [2022-04-15 08:53:41,228 INFO L290 TraceCheckUtils]: 118: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,229 INFO L290 TraceCheckUtils]: 117: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,229 INFO L290 TraceCheckUtils]: 116: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,229 INFO L272 TraceCheckUtils]: 115: Hoare triple {75702#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75277#true} is VALID [2022-04-15 08:53:41,229 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {75277#true} {75702#(< ~counter~0 10)} #88#return; {75702#(< ~counter~0 10)} is VALID [2022-04-15 08:53:41,229 INFO L290 TraceCheckUtils]: 113: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,229 INFO L290 TraceCheckUtils]: 112: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,230 INFO L290 TraceCheckUtils]: 111: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,230 INFO L272 TraceCheckUtils]: 110: Hoare triple {75702#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75277#true} is VALID [2022-04-15 08:53:41,230 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {75277#true} {75702#(< ~counter~0 10)} #86#return; {75702#(< ~counter~0 10)} is VALID [2022-04-15 08:53:41,230 INFO L290 TraceCheckUtils]: 108: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,230 INFO L290 TraceCheckUtils]: 107: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,230 INFO L290 TraceCheckUtils]: 106: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,230 INFO L272 TraceCheckUtils]: 105: Hoare triple {75702#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75277#true} is VALID [2022-04-15 08:53:41,231 INFO L290 TraceCheckUtils]: 104: Hoare triple {75702#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {75702#(< ~counter~0 10)} is VALID [2022-04-15 08:53:41,232 INFO L290 TraceCheckUtils]: 103: Hoare triple {75775#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75702#(< ~counter~0 10)} is VALID [2022-04-15 08:53:41,233 INFO L290 TraceCheckUtils]: 102: Hoare triple {75775#(< ~counter~0 9)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {75775#(< ~counter~0 9)} is VALID [2022-04-15 08:53:41,233 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {75277#true} {75775#(< ~counter~0 9)} #92#return; {75775#(< ~counter~0 9)} is VALID [2022-04-15 08:53:41,233 INFO L290 TraceCheckUtils]: 100: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,233 INFO L290 TraceCheckUtils]: 99: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,233 INFO L290 TraceCheckUtils]: 98: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,233 INFO L272 TraceCheckUtils]: 97: Hoare triple {75775#(< ~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)); {75277#true} is VALID [2022-04-15 08:53:41,234 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {75277#true} {75775#(< ~counter~0 9)} #90#return; {75775#(< ~counter~0 9)} is VALID [2022-04-15 08:53:41,234 INFO L290 TraceCheckUtils]: 95: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,234 INFO L290 TraceCheckUtils]: 94: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,234 INFO L290 TraceCheckUtils]: 93: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,234 INFO L272 TraceCheckUtils]: 92: Hoare triple {75775#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75277#true} is VALID [2022-04-15 08:53:41,235 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {75277#true} {75775#(< ~counter~0 9)} #88#return; {75775#(< ~counter~0 9)} is VALID [2022-04-15 08:53:41,235 INFO L290 TraceCheckUtils]: 90: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,235 INFO L290 TraceCheckUtils]: 89: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,235 INFO L290 TraceCheckUtils]: 88: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,235 INFO L272 TraceCheckUtils]: 87: Hoare triple {75775#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75277#true} is VALID [2022-04-15 08:53:41,236 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {75277#true} {75775#(< ~counter~0 9)} #86#return; {75775#(< ~counter~0 9)} is VALID [2022-04-15 08:53:41,236 INFO L290 TraceCheckUtils]: 85: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,236 INFO L290 TraceCheckUtils]: 84: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,236 INFO L290 TraceCheckUtils]: 83: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,236 INFO L272 TraceCheckUtils]: 82: Hoare triple {75775#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75277#true} is VALID [2022-04-15 08:53:41,236 INFO L290 TraceCheckUtils]: 81: Hoare triple {75775#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {75775#(< ~counter~0 9)} is VALID [2022-04-15 08:53:41,237 INFO L290 TraceCheckUtils]: 80: Hoare triple {75845#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75775#(< ~counter~0 9)} is VALID [2022-04-15 08:53:41,237 INFO L290 TraceCheckUtils]: 79: Hoare triple {75845#(< ~counter~0 8)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {75845#(< ~counter~0 8)} is VALID [2022-04-15 08:53:41,237 INFO L290 TraceCheckUtils]: 78: Hoare triple {75845#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {75845#(< ~counter~0 8)} is VALID [2022-04-15 08:53:41,238 INFO L290 TraceCheckUtils]: 77: Hoare triple {75597#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75845#(< ~counter~0 8)} is VALID [2022-04-15 08:53:41,238 INFO L290 TraceCheckUtils]: 76: Hoare triple {75597#(<= ~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; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:41,239 INFO L290 TraceCheckUtils]: 75: Hoare triple {75597#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:41,239 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {75277#true} {75597#(<= ~counter~0 6)} #92#return; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:41,239 INFO L290 TraceCheckUtils]: 73: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,239 INFO L290 TraceCheckUtils]: 72: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,240 INFO L272 TraceCheckUtils]: 70: Hoare triple {75597#(<= ~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)); {75277#true} is VALID [2022-04-15 08:53:41,240 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {75277#true} {75597#(<= ~counter~0 6)} #90#return; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:41,240 INFO L290 TraceCheckUtils]: 68: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,240 INFO L290 TraceCheckUtils]: 67: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,240 INFO L290 TraceCheckUtils]: 66: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,240 INFO L272 TraceCheckUtils]: 65: Hoare triple {75597#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75277#true} is VALID [2022-04-15 08:53:41,241 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {75277#true} {75597#(<= ~counter~0 6)} #88#return; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:41,241 INFO L290 TraceCheckUtils]: 63: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,241 INFO L290 TraceCheckUtils]: 62: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,241 INFO L290 TraceCheckUtils]: 61: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,241 INFO L272 TraceCheckUtils]: 60: Hoare triple {75597#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75277#true} is VALID [2022-04-15 08:53:41,242 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {75277#true} {75597#(<= ~counter~0 6)} #86#return; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:41,242 INFO L290 TraceCheckUtils]: 58: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,242 INFO L290 TraceCheckUtils]: 57: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,242 INFO L290 TraceCheckUtils]: 56: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,242 INFO L272 TraceCheckUtils]: 55: Hoare triple {75597#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75277#true} is VALID [2022-04-15 08:53:41,242 INFO L290 TraceCheckUtils]: 54: Hoare triple {75597#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:41,243 INFO L290 TraceCheckUtils]: 53: Hoare triple {75527#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75597#(<= ~counter~0 6)} is VALID [2022-04-15 08:53:41,243 INFO L290 TraceCheckUtils]: 52: Hoare triple {75527#(<= ~counter~0 5)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:41,244 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {75277#true} {75527#(<= ~counter~0 5)} #92#return; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:41,244 INFO L290 TraceCheckUtils]: 50: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,244 INFO L290 TraceCheckUtils]: 49: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,244 INFO L290 TraceCheckUtils]: 48: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,244 INFO L272 TraceCheckUtils]: 47: Hoare triple {75527#(<= ~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)); {75277#true} is VALID [2022-04-15 08:53:41,245 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {75277#true} {75527#(<= ~counter~0 5)} #90#return; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:41,245 INFO L290 TraceCheckUtils]: 45: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,245 INFO L272 TraceCheckUtils]: 42: Hoare triple {75527#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75277#true} is VALID [2022-04-15 08:53:41,246 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {75277#true} {75527#(<= ~counter~0 5)} #88#return; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:41,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,246 INFO L272 TraceCheckUtils]: 37: Hoare triple {75527#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75277#true} is VALID [2022-04-15 08:53:41,246 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {75277#true} {75527#(<= ~counter~0 5)} #86#return; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:41,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,247 INFO L272 TraceCheckUtils]: 32: Hoare triple {75527#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75277#true} is VALID [2022-04-15 08:53:41,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {75527#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:41,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {75517#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75527#(<= ~counter~0 5)} is VALID [2022-04-15 08:53:41,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {75517#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {75517#(<= ~counter~0 4)} is VALID [2022-04-15 08:53:41,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {75517#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {75517#(<= ~counter~0 4)} is VALID [2022-04-15 08:53:41,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {75444#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75517#(<= ~counter~0 4)} is VALID [2022-04-15 08:53:41,249 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {75277#true} {75444#(<= ~counter~0 3)} #84#return; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:41,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,249 INFO L272 TraceCheckUtils]: 22: Hoare triple {75444#(<= ~counter~0 3)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {75277#true} is VALID [2022-04-15 08:53:41,250 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {75277#true} {75444#(<= ~counter~0 3)} #82#return; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:41,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,250 INFO L272 TraceCheckUtils]: 17: Hoare triple {75444#(<= ~counter~0 3)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {75277#true} is VALID [2022-04-15 08:53:41,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {75444#(<= ~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; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:41,251 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {75277#true} {75444#(<= ~counter~0 3)} #80#return; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:41,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,251 INFO L272 TraceCheckUtils]: 11: Hoare triple {75444#(<= ~counter~0 3)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {75277#true} is VALID [2022-04-15 08:53:41,251 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {75277#true} {75444#(<= ~counter~0 3)} #78#return; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:41,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {75277#true} assume true; {75277#true} is VALID [2022-04-15 08:53:41,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {75277#true} assume !(0 == ~cond); {75277#true} is VALID [2022-04-15 08:53:41,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {75277#true} ~cond := #in~cond; {75277#true} is VALID [2022-04-15 08:53:41,252 INFO L272 TraceCheckUtils]: 6: Hoare triple {75444#(<= ~counter~0 3)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {75277#true} is VALID [2022-04-15 08:53:41,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {75444#(<= ~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; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:41,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {75444#(<= ~counter~0 3)} call #t~ret8 := main(); {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:41,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75444#(<= ~counter~0 3)} {75277#true} #98#return; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:41,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {75444#(<= ~counter~0 3)} assume true; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:41,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {75277#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; {75444#(<= ~counter~0 3)} is VALID [2022-04-15 08:53:41,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {75277#true} call ULTIMATE.init(); {75277#true} is VALID [2022-04-15 08:53:41,254 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-15 08:53:41,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:53:41,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396234558] [2022-04-15 08:53:41,254 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:53:41,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082361025] [2022-04-15 08:53:41,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082361025] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:53:41,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:53:41,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-15 08:53:41,254 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:53:41,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [859662714] [2022-04-15 08:53:41,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [859662714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:53:41,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:53:41,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 08:53:41,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622033434] [2022-04-15 08:53:41,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:53:41,255 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-15 08:53:41,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:53:41,255 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-15 08:53:41,331 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-15 08:53:41,332 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 08:53:41,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:53:41,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 08:53:41,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:53:41,332 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-15 08:53:43,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:53:43,058 INFO L93 Difference]: Finished difference Result 629 states and 787 transitions. [2022-04-15 08:53:43,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 08:53:43,058 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-15 08:53:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:53:43,058 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-15 08:53:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 150 transitions. [2022-04-15 08:53:43,059 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-15 08:53:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 150 transitions. [2022-04-15 08:53:43,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 150 transitions. [2022-04-15 08:53:43,193 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-15 08:53:43,211 INFO L225 Difference]: With dead ends: 629 [2022-04-15 08:53:43,211 INFO L226 Difference]: Without dead ends: 622 [2022-04-15 08:53:43,212 INFO L912 BasicCegarLoop]: 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-15 08:53:43,212 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 52 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:53:43,212 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 215 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:53:43,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2022-04-15 08:53:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2022-04-15 08:53:44,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:53:44,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 622 states. Second operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-15 08:53:44,487 INFO L74 IsIncluded]: Start isIncluded. First operand 622 states. Second operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-15 08:53:44,487 INFO L87 Difference]: Start difference. First operand 622 states. Second operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-15 08:53:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:53:44,500 INFO L93 Difference]: Finished difference Result 622 states and 778 transitions. [2022-04-15 08:53:44,500 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 778 transitions. [2022-04-15 08:53:44,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:53:44,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:53:44,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) Second operand 622 states. [2022-04-15 08:53:44,501 INFO L87 Difference]: Start difference. First operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) Second operand 622 states. [2022-04-15 08:53:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:53:44,531 INFO L93 Difference]: Finished difference Result 622 states and 778 transitions. [2022-04-15 08:53:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 778 transitions. [2022-04-15 08:53:44,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:53:44,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:53:44,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:53:44,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:53:44,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-15 08:53:44,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 778 transitions. [2022-04-15 08:53:44,559 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 778 transitions. Word has length 133 [2022-04-15 08:53:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:53:44,559 INFO L478 AbstractCegarLoop]: Abstraction has 622 states and 778 transitions. [2022-04-15 08:53:44,559 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (23), 7 states have call predecessors, (23), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-15 08:53:44,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 622 states and 778 transitions.